Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(C-2, X₁) :|: X₀+1 ≤ 0
t₁: l1(X₀, X₁) → l1(2+C, X₁) :|: 1 ≤ X₀
t₃: l1(X₀, X₁) → l2(X₀, C) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Start: l0
Program_Vars: X₀
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₉: l0(X₀) → l1(X₀)
t₁₀: l1(X₀) → l1(C-2) :|: X₀+1 ≤ 0
t₁₁: l1(X₀) → l1(2+C) :|: 1 ≤ X₀
t₁₂: l1(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Overall timebound:inf {Infinity}
t₉: 1 {O(1)}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: 1 {O(1)}
Overall costbound: inf {Infinity}
t₉: 1 {O(1)}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: 1 {O(1)}
t₉, X₀: X₀ {O(n)}
t₁₂, X₀: 0 {O(1)}