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