Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3
Transitions:
t₃: l0(X₀, X₁, X₂, X₃) → l1(0, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₀, X₃) :|: X₀ ≤ 9
t₀: l1(X₀, X₁, X₂, X₃) → l2(X₀, E, X₂, X₃) :|: 10 ≤ X₀
t₂: l3(X₀, X₁, X₂, X₃) → l1(-1, X₁, X₂, -1) :|: X₀ ≤ 9
Cut unreachable locations [l3] from the program graph
Cut unsatisfiable transition t₀: l1→l2
Cut unreachable locations [l2] from the program graph
Eliminate variables {X₁,X₂,X₃} that do not contribute to the problem
Found invariant X₀ ≤ 0 for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₈: l0(X₀) → l1(0)
t₉: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 9 ∧ X₀ ≤ 0
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant 1+X₀ ≤ 0 for location n_l1___1
Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₈, X₀: 0 {O(1)}