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