Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, 3⋅X₁+X₂, -6⋅X₁-2⋅X₂, X₃+2⋅(X₀)²) :|: 0 < X₀
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃) → l2(X₀, X₁-1, X₂, X₃-1) :|: 0 < X₁+X₃
Found invariant X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, 3⋅X₁+X₂, -6⋅X₁-2⋅X₂, X₃+2⋅(X₀)²) :|: 0 < X₀
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃) → l2(X₀, X₁-1, X₂, X₃-1) :|: 0 < X₁+X₃ ∧ X₀ ≤ 0
new bound:
X₀ {O(n)}
Found invariant X₀ ≤ 0 for location l2
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: X₀ {O(n)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: X₀ {O(n)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₀, X₃: X₃ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: 12^(X₀)⋅X₁+12^(X₀)⋅X₂ {O(EXP)}
t₁, X₂: 12^(X₀)⋅X₁+12^(X₀)⋅X₂ {O(EXP)}
t₂, X₀: 2⋅X₀ {O(n)}
t₂, X₁: 12^(X₀)⋅X₁+12^(X₀)⋅X₂+X₁ {O(EXP)}
t₂, X₂: 12^(X₀)⋅X₁+12^(X₀)⋅X₂+X₂ {O(EXP)}
t₃, X₀: 2⋅X₀ {O(n)}
t₃, X₂: 12^(X₀)⋅X₁+12^(X₀)⋅X₂+X₂ {O(EXP)}