Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₂
t₁: l1(X₀, X₁, X₂) → l1(4⋅X₀, 9⋅X₁-8⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ X₀ < 0
t₂: l1(X₀, X₁, X₂) → l1(4⋅X₀, 9⋅X₁-8⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ 0 < X₀
Found invariant 1 ≤ X₂ for location l1
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₂
t₁: l1(X₀, X₁, X₂) → l1(4⋅X₀, 9⋅X₁-8⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ X₀ < 0 ∧ 1 ≤ X₂
t₂: l1(X₀, X₁, X₂) → l1(4⋅X₀, 9⋅X₁-8⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ 0 < X₀ ∧ 1 ≤ X₂
Found invariant 1 ≤ X₂ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₁: X₁ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 2⋅X₁+6 {O(n)}
relevant size-bounds w.r.t. t₀:
X₁: X₁ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 2⋅X₁+6 {O(n)}
Overall timebound:4⋅X₁+13 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+6 {O(n)}
t₂: 2⋅X₁+6 {O(n)}
Overall costbound: 4⋅X₁+13 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+6 {O(n)}
t₂: 2⋅X₁+6 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 4^(2⋅X₁+6)⋅X₀ {O(EXP)}
t₁, X₂: X₂ {O(n)}
t₂, X₀: 4^(2⋅X₁+6)⋅X₀ {O(EXP)}
t₂, X₂: X₂ {O(n)}