Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₀) :|: 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀-1, X₀-1) :|: X₁ ≤ 0 ∧ 2 ≤ X₀
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ 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₀
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₂: l1(X₀, X₁) → l1(X₀-1, X₀-1) :|: X₁ ≤ 0 ∧ 2 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
Cut unsatisfiable transition t₅₆: n_l1___2→l1
Found invariant 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l1
Found invariant 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₀ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: 2⋅X₀ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₀ {O(n)}