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