Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁) :|: X₀+X₁+1 ≤ 0 ∧ 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-X₁, X₁) :|: 0 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀+1 ≤ 0
Found invariant 1 ≤ 0 for location l2
Found invariant 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1 ≤ 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(X₀, X₁) :|: X₀+X₁+1 ≤ 0 ∧ 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-X₁, X₁) :|: 0 ≤ X₀ ∧ 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1 ≤ X₀
Found invariant 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1 ≤ X₀ for location l1
Found invariant 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location l1
Found invariant 2+X₁ ≤ 0 ∧ 5+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l1___1
Found invariant 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location l1
Found invariant 2+X₁ ≤ 0 ∧ 5+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 3 ≤ 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₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}