Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀+X₁ < 0
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₃ < X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃, X₄, X₅, X₆)
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Found invariant X₆ ≤ X₂ for location l5
Found invariant X₆ ≤ X₂ for location l1
Found invariant X₆ ≤ X₂ for location l4
Found invariant X₆ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₀+X₁ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃ ∧ X₆ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀+X₁ < 0 ∧ X₆ ≤ X₂
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₃ < X₀ ∧ X₆ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃, X₄, X₅, X₆) :|: X₆ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₀+X₁
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₆ ≤ X₂
Cut unsatisfiable transition t₅₄: n_l1___1→l4
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₃+X₅ ∧ X₁ ≤ X₅ ∧ 0 ≤ X₀+X₅ ∧ X₄ ≤ X₃ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₁+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₀+X₁ for location n_l3___4
Found invariant 1+X₆ ≤ X₂ ∧ X₆ ≤ X₁ ∧ X₂ ≤ 1+X₆ ∧ X₁ ≤ X₆ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₃+X₅ ∧ X₄ ≤ X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ for location n_l1___3
Found invariant X₆ ≤ X₂ for location l5
Found invariant 1+X₆ ≤ X₂ ∧ X₆ ≤ X₁ ∧ 0 ≤ X₃+X₆ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₃+X₅ ∧ X₄ ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 0 ≤ X₀+X₁ for location n_l3___2
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄ for location l1
Found invariant X₆ ≤ X₂ for location l4
Found invariant 2+X₆ ≤ X₂ ∧ 1+X₆ ≤ X₁ ∧ 0 ≤ X₃+X₆ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₃+X₅ ∧ X₄ ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
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₄: 1 {O(1)}
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)}
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)}
t₃, X₃: 2⋅X₃ {O(n)}
t₃, X₄: 2⋅X₄ {O(n)}
t₃, X₅: 2⋅X₅ {O(n)}
t₃, X₆: 2⋅X₆ {O(n)}
t₄, X₃: 2⋅X₃ {O(n)}
t₄, X₄: 2⋅X₄ {O(n)}
t₄, X₅: 2⋅X₅ {O(n)}
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₆: 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₃: 4⋅X₃ {O(n)}
t₆, X₄: 4⋅X₄ {O(n)}
t₆, X₅: 4⋅X₅ {O(n)}
t₆, X₆: 4⋅X₆ {O(n)}