Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(0, 0)
t₁: l1(X₀, X₁) → l1(X₀+1, X₁+1)
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁+1 ≤ X₀
Found invariant 1 ≤ 0 for location l2
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1
Cut unsatisfiable transition t₂: l1→l2
Cut unreachable locations [l2] from the program graph
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(0, 0)
t₁: l1(X₀, X₁) → l1(X₀+1, X₁+1) :|: X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₀, X₀: 0 {O(1)}
t₀, X₁: 0 {O(1)}