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₁-X₀) :|: 1 ≤ X₀ ∧ 0 ≤ X₁
Found invariant 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₁-X₀) :|: 1 ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀
new bound:
X₁+1 {O(n)}
Overall timebound:X₁+2 {O(n)}
t₀: 1 {O(1)}
t₁: X₁+1 {O(n)}
Overall costbound: X₁+2 {O(n)}
t₀: 1 {O(1)}
t₁: X₁+1 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: 2⋅X₀+X₁ {O(n)}