Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M, N, O, P, Q, R, S
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(X₀, L, N, P, Q, X₅, X₆, L, M, O, R) :|: X₆ ≤ 0
t₃: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(X₀, N, N, P, Q, R, X₆, L, M, O, S) :|: X₀ ≤ 0 ∧ 1 ≤ X₆
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, N, N, P, Q, R, X₆, L, M, O, X₁₀) :|: 1 ≤ X₀ ∧ 1 ≤ X₆
t₀: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₂, X₂, L, M, N, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
Eliminate variables {L,M,N,O,P,Q,R,S,X₁,X₂,X₃,X₄,X₅,X₇,X₈,X₉,X₁₀} that do not contribute to the problem
Found invariant 1 ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ 1 ≤ X₀ for location l2
Start: l0
Program_Vars: X₀, X₆
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₇: l0(X₀, X₆) → l1(X₀, X₆) :|: X₆ ≤ 0
t₉: l0(X₀, X₆) → l1(X₀, X₆) :|: X₀ ≤ 0 ∧ 1 ≤ X₆
t₈: l0(X₀, X₆) → l2(X₀, X₆) :|: 1 ≤ X₀ ∧ 1 ≤ X₆
t₁₀: l2(X₀, X₆) → l2(X₀, X₆) :|: 1 ≤ X₀ ∧ 1 ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ 1 ≤ X₀
Found invariant 1 ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ 1 ≤ X₀ for location l2
Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
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₇, X₀: X₀ {O(n)}
t₇, X₆: X₆ {O(n)}
t₈, X₀: X₀ {O(n)}
t₈, X₆: X₆ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₆: X₆ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₀, X₆: X₆ {O(n)}