Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(0, X₁)
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₁
t₃: l1(X₀, X₁) → l2(-1, X₁) :|: X₁ ≤ 0
t₂: l2(X₀, X₁) → l2(X₀, X₁)
Eliminate variables {X₀} that do not contribute to the problem
Found invariant 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) :|: 1 ≤ X₀
t₁₁: l1(X₀) → l2(X₀) :|: X₀ ≤ 0
t₁₂: l2(X₀) → l2(X₀) :|: X₀ ≤ 0
new bound:
X₀ {O(n)}
Found invariant X₀ ≤ 0 for location l2
Overall timebound:inf {Infinity}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
Overall costbound: inf {Infinity}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₉, X₀: X₀ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₁, X₀: 2⋅X₀ {O(n)}
t₁₂, X₀: 2⋅X₀ {O(n)}