Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₀ < 10
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 10 ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃) → l1(0, X₁, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Eliminate variables {X₁,X₂,X₃} that do not contribute to the problem
Found invariant 1 ≤ 0 for location l5
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₁₃: l1→l4
Cut unsatisfiable transition t₁₆: l4→l5
Cut unreachable locations [l4; l5] from the program graph
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₁: l0(X₀) → l2(X₀)
t₁₂: l1(X₀) → l3(X₀) :|: X₀ < 10 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₄: l2(X₀) → l1(0)
t₁₅: l3(X₀) → l1(X₀) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
Chain transitions t₁₅: l3→l1 and t₁₂: l1→l3 to t₃₈: l3→l3
Chain transitions t₁₄: l2→l1 and t₁₂: l1→l3 to t₃₉: l2→l3
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₁, X₀: X₀ {O(n)}
t₁₂, X₀: 0 {O(1)}
t₁₄, X₀: 0 {O(1)}
t₁₅, X₀: 0 {O(1)}