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(1, 2, X₂, 1, 10, X₅, X₆, X₇, 10, 2, L)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(L, X₁, X₂, X₃, X₄, X₃, X₃, X₇, X₈, X₉, X₁₀) :|: 1+X₄ ≤ X₃
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(L, X₁, X₂, X₃, X₄, X₃, X₃, M, X₈, X₉, X₁₀) :|: X₃ ≤ X₄
t₀: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₁, X₁+X₀, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: X₁ ≤ X₀
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₁, X₁-X₀, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 1+X₀ ≤ X₁
Cut unsatisfiable transition t₂: l1→l3
Eliminate variables {M,X₂,X₅,X₆,X₇,X₈,X₉,X₁₀} that do not contribute to the problem
Found invariant X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ X₁ ≤ 2 ∧ 2 ≤ X₁ for location l2
Found invariant X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ X₄ ≤ 9+X₀ ∧ X₀+X₄ ≤ 11 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ 11 ≤ X₀+X₄ ∧ 9+X₀ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ X₃ ≤ X₀ ∧ X₀+X₃ ≤ 2 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₁ ≤ 2 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 3 ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ X₁ ≤ 2 ∧ 2 ≤ X₁ for location l3
Start: l0
Program_Vars: X₀, X₁, X₃, X₄
Temp_Vars: L
Locations: l0, l1, l2, l3
Transitions:
t₁₀: l0(X₀, X₁, X₃, X₄) → l1(1, 2, 1, 10)
t₁₁: l1(X₀, X₁, X₃, X₄) → l3(L, X₁, X₃, X₄) :|: X₃ ≤ X₄ ∧ X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ X₄ ≤ 9+X₀ ∧ X₀+X₄ ≤ 11 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ 11 ≤ X₀+X₄ ∧ 9+X₀ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ X₃ ≤ X₀ ∧ X₀+X₃ ≤ 2 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₁ ≤ 2 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 3 ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₁₂: l3(X₀, X₁, X₃, X₄) → l2(X₀, X₁, X₃, X₄) :|: X₁ ≤ X₀ ∧ X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ X₁ ≤ 2 ∧ 2 ≤ X₁
t₁₃: l3(X₀, X₁, X₃, X₄) → l2(X₀, X₁, X₃, X₄) :|: 1+X₀ ≤ X₁ ∧ X₄ ≤ 10 ∧ X₄ ≤ 9+X₃ ∧ X₃+X₄ ≤ 11 ∧ X₄ ≤ 8+X₁ ∧ X₁+X₄ ≤ 12 ∧ 10 ≤ X₄ ∧ 11 ≤ X₃+X₄ ∧ 9+X₃ ≤ X₄ ∧ 12 ≤ X₁+X₄ ∧ 8+X₁ ≤ X₄ ∧ X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₁+X₃ ≤ 3 ∧ 1 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ X₁ ≤ 2 ∧ 2 ≤ X₁
Overall timebound:4 {O(1)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
Overall costbound: 4 {O(1)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}