Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₃: l0(X₀, X₁) → l2(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₂: l1(X₀, X₁) → l2(X₀-1, X₁) :|: 1 ≤ X₀ ∧ X₁ ≤ 0
t₀: l2(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₀
Found invariant 1 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₃: l0(X₀, X₁) → l2(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀-1, X₁) :|: 1 ≤ X₀ ∧ X₁ ≤ 0 ∧ 1 ≤ X₀
t₀: l2(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₀
new bound:
X₀ {O(n)}
new bound:
X₁ {O(n)}
new bound:
X₀ {O(n)}
Overall timebound:2⋅X₀+X₁+1 {O(n)}
t₀: X₀ {O(n)}
t₁: X₁ {O(n)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
Overall costbound: 2⋅X₀+X₁+1 {O(n)}
t₀: X₀ {O(n)}
t₁: X₁ {O(n)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₃, X₀: X₀ {O(n)}
t₃, X₁: X₁ {O(n)}