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