Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M
Locations: l0, l1, l2, l3
Transitions:
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(M, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: L ≤ 15
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀)
t₄: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₁, X₂, 1, 1, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: M ≤ 15
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(0, X₁, X₂, 0, 0, X₅, X₆, M, M, 0, 0) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(X₀, M, M, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: X₀+1 ≤ 0
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(X₀, M, M, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(X₀-1, X₁, X₂, X₃, X₄, 0, 0, X₇, X₈, X₉, X₁₀)
Eliminate variables {X₁,X₂,X₃,X₄,X₅,X₆,X₇,X₈,X₉,X₁₀} that do not contribute to the problem
Start: l0
Program_Vars: X₀
Temp_Vars: L, M
Locations: l0, l1, l2, l3
Transitions:
t₁₃: l0(X₀) → l1(M) :|: L ≤ 15
t₁₂: l0(X₀) → l2(X₀)
t₁₄: l0(X₀) → l2(X₀) :|: M ≤ 15
t₁₇: l1(X₀) → l2(0) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₅: l1(X₀) → l3(X₀) :|: X₀+1 ≤ 0
t₁₆: l1(X₀) → l3(X₀) :|: 1 ≤ X₀
t₁₈: l3(X₀) → l1(X₀-1)
Cut unsatisfiable transition t₅₁: n_l1___1→l2
Found invariant 1+X₀ ≤ 0 for location n_l3___3
Found invariant 1 ≤ X₀ for location n_l3___2
Found invariant 2+X₀ ≤ 0 for location n_l1___1
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₂, X₀: X₀ {O(n)}
t₁₄, X₀: X₀ {O(n)}
t₁₇, X₀: 0 {O(1)}