Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉
Temp_Vars: K, L, M, N, O
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, K, L, K)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, K, L, M, N, O, X₆, X₇, X₈, X₉) :|: 1 ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l2(X₀, K, L, X₃, X₄, X₅, M, X₇, X₈, X₉) :|: X₀ ≤ 0
Eliminate variables {K,L,M,N,O,X₁,X₂,X₃,X₄,X₅,X₆,X₇,X₈,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 ≤ X₀
t₁₀: l1(X₀) → l2(X₀) :|: X₀ ≤ 0
Found invariant X₀ ≤ 0 for location l2
Found invariant X₀ ≤ 0 for location l2
Found invariant 1 ≤ X₀ for location n_l1___1
Found invariant X₀ ≤ 0 for location l2
Found invariant 1 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
t₈, X₀: X₀ {O(n)}
t₉, X₀: X₀ {O(n)}
t₁₀, X₀: X₀ {O(n)}