Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₀
t₁: l1(X₀, X₁, X₂) → l1(X₀+X₂, X₁, X₂-1) :|: 0 < X₂
t₂: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 0
t₃: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂-2⋅X₁) :|: X₀ < (X₁)²
t₄: l3(X₀, X₁, X₂) → l4(5⋅X₀, X₁, X₂+X₁)
t₅: l4(X₀, X₁, X₂) → l2(X₀+(X₂)⁴, 2⋅X₁, X₂+X₁)

Preprocessing

Found invariant 1 ≤ X₀ for location l2

Found invariant 1 ≤ X₀ for location l1

Found invariant 5 ≤ X₀ for location l4

Found invariant 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₀
t₁: l1(X₀, X₁, X₂) → l1(X₀+X₂, X₁, X₂-1) :|: 0 < X₂ ∧ 1 ≤ X₀
t₂: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 0 ∧ 1 ≤ X₀
t₃: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂-2⋅X₁) :|: X₀ < (X₁)² ∧ 1 ≤ X₀
t₄: l3(X₀, X₁, X₂) → l4(5⋅X₀, X₁, X₂+X₁) :|: 1 ≤ X₀
t₅: l4(X₀, X₁, X₂) → l2(X₀+(X₂)⁴, 2⋅X₁, X₂+X₁) :|: 5 ≤ X₀

MPRF for transition t₁: l1(X₀, X₁, X₂) → l1(X₀+X₂, X₁, X₂-1) :|: 0 < X₂ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₂ {O(n)}

MPRF:

l1 [X₂ ]

Analysing control-flow refined program

Found invariant X₂ ≤ 0 ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₀ for location l2

Found invariant 5 ≤ X₀ for location n_l4___4

Found invariant 1 ≤ X₀ for location n_l3___5

Found invariant 5 ≤ X₀ for location n_l4___1

Found invariant 1 ≤ X₀ for location n_l3___2

Found invariant 1 ≤ X₀ for location l1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: X₂ {O(n)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: inf {Infinity}
t₅: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: X₂ {O(n)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: inf {Infinity}
t₅: inf {Infinity}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 2⋅X₂⋅X₂+2⋅X₂+X₀ {O(n^2)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₂, X₀: 2⋅X₂⋅X₂+2⋅X₀+2⋅X₂ {O(n^2)}
t₂, X₁: 2⋅X₁ {O(n)}
t₂, X₂: 2⋅X₂ {O(n)}