Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(0, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l2(X₀+1, X₁, 0, X₃) :|: X₀+1 ≤ X₁
t₈: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₄: l2(X₀, X₁, X₂, X₃) → l2(X₀+1, X₁, X₂+1, E) :|: X₀+1 ≤ X₁ ∧ E+1 ≤ 0
t₅: l2(X₀, X₁, X₂, X₃) → l2(X₀+1, X₁, X₂+1, E) :|: X₀+1 ≤ X₁ ∧ 1 ≤ E
t₂: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, 0) :|: X₀+1 ≤ X₁
t₃: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₇: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 1 ≤ X₂
Eliminate variables {X₃} that do not contribute to the problem
Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l2
Found invariant 0 ≤ X₀ for location l1
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l4
Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₁₉: l0(X₀, X₁, X₂) → l1(0, X₁, X₂)
t₂₀: l1(X₀, X₁, X₂) → l2(X₀+1, X₁, 0) :|: X₀+1 ≤ X₁ ∧ 0 ≤ X₀
t₂₁: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ 0 ≤ X₀
t₂₄: l2(X₀, X₁, X₂) → l2(X₀+1, X₁, X₂+1) :|: X₀+1 ≤ X₁ ∧ E+1 ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂₅: l2(X₀, X₁, X₂) → l2(X₀+1, X₁, X₂+1) :|: X₀+1 ≤ X₁ ∧ 1 ≤ E ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂₂: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₀+1 ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂₃: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂₆: l3(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂₇: l3(X₀, X₁, X₂) → l1(X₀-1, X₁, X₂) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
Cut unsatisfiable transition t₅₃₂: n_l1___1→n_l2___12
Cut unsatisfiable transition t₅₇₄: n_l1___2→l4
Cut unsatisfiable transition t₅₇₅: n_l1___4→l4
Cut unsatisfiable transition t₅₇₆: n_l1___6→l4
Found invariant 2+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___6
Found invariant 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 1+X₀ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___4
Found invariant X₂ ≤ 0 ∧ 3+X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___5
Found invariant X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___11
Found invariant X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l2___12
Found invariant X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___3
Found invariant 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___8
Found invariant X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___9
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l4
Found invariant X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___1
Found invariant X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___10
Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___7
Overall timebound:inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: inf {Infinity}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: inf {Infinity}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: inf {Infinity}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: inf {Infinity}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₁₉, X₀: 0 {O(1)}
t₁₉, X₁: X₁ {O(n)}
t₁₉, X₂: X₂ {O(n)}
t₂₀, X₁: X₁ {O(n)}
t₂₀, X₂: 0 {O(1)}
t₂₁, X₁: 2⋅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₂: 0 {O(1)}
t₂₇, X₁: X₁ {O(n)}