Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 0 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀, C) :|: X₀+1 ≤ 0
Eliminate variables {C,X₁} that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀) → l1(X₀)
t₇: l1(X₀) → l1(X₀-1) :|: 0 ≤ X₀
t₈: l1(X₀) → l2(X₀) :|: X₀+1 ≤ 0
new bound:
X₀+1 {O(n)}
Overall timebound:X₀+3 {O(n)}
t₆: 1 {O(1)}
t₇: X₀+1 {O(n)}
t₈: 1 {O(1)}
Overall costbound: X₀+3 {O(n)}
t₆: 1 {O(1)}
t₇: X₀+1 {O(n)}
t₈: 1 {O(1)}
t₆, X₀: X₀ {O(n)}
t₇, X₀: X₀+1 {O(n)}
t₈, X₀: 2⋅X₀+1 {O(n)}