Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: X₃ < 0
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: 0 < X₃
t₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₂, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ 0 ≤ X₃
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅, X₆)
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 ≤ X₀
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < 0
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₁₀: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Found invariant X₂ ≤ X₆ ∧ 0 ≤ X₀ for location l2
Found invariant X₂ ≤ X₆ ∧ 1+X₀ ≤ 0 for location l6
Found invariant X₂ ≤ X₆ ∧ 1+X₀ ≤ 0 for location l7
Found invariant X₂ ≤ X₆ ∧ 0 ≤ X₀ for location l1
Found invariant X₂ ≤ X₆ for location l4
Found invariant X₂ ≤ X₆ ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: X₃ < 0 ∧ X₂ ≤ X₆ ∧ 0 ≤ X₀
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: 0 < X₃ ∧ X₂ ≤ X₆ ∧ 0 ≤ X₀
t₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀+X₂, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₂ ≤ X₆ ∧ 0 ≤ X₀
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₂ ≤ X₆ ∧ 0 ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅, X₆) :|: X₂ ≤ X₆ ∧ 0 ≤ X₀
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 ≤ X₀ ∧ X₂ ≤ X₆
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < 0 ∧ X₂ ≤ X₆
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₁₀: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₂ ≤ X₆ ∧ 1+X₀ ≤ 0
Chain transitions t₆: l3→l1 and t₉: l1→l4 to t₁₂₂: l3→l4
Chain transitions t₆: l3→l1 and t₈: l1→l4 to t₁₂₃: l3→l4
Chain transitions t₆: l3→l1 and t₇: l1→l4 to t₁₂₄: l3→l4
Chain transitions t₂: l4→l2 and t₄: l2→l3 to t₁₂₅: l4→l3
Chain transitions t₁₂₅: l4→l3 and t₁₂₄: l3→l4 to t₁₂₆: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₁₂₃: l3→l4 to t₁₂₇: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₁₂₂: l3→l4 to t₁₂₈: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₆: l3→l1 to t₁₂₉: l4→l1
Eliminate variables {Temp_Int₈₂₁,X₃} that do not contribute to the problem
Found invariant X₂ ≤ X₅ ∧ 0 ≤ X₀ for location l2
Found invariant X₂ ≤ X₅ ∧ 1+X₀ ≤ 0 for location l6
Found invariant X₂ ≤ X₅ ∧ 1+X₀ ≤ 0 for location l7
Found invariant X₂ ≤ X₅ ∧ 0 ≤ X₀ for location l1
Found invariant X₂ ≤ X₅ for location l4
Found invariant X₂ ≤ X₅ ∧ 0 ≤ X₀ for location l3
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ 0 ≤ X₀ for location n_l2___6
Found invariant X₂ ≤ X₆ ∧ X₀ ≤ X₄ ∧ 1+X₀ ≤ 0 for location l6
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₀ for location n_l1___9
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ 0 ≤ X₀ for location n_l3___5
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₀ for location n_l2___11
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₀ for location n_l2___3
Found invariant X₂ ≤ X₆ ∧ X₀ ≤ X₄ ∧ 1+X₀ ≤ 0 for location l7
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₀ for location n_l3___2
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄ for location l4
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ for location n_l4___8
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₀ for location n_l1___1
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₀ for location n_l3___10
Found invariant 1+X₂ ≤ X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 1+X₂ ≤ X₀ for location n_l4___7
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
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₁₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
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₁₀: 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₄: 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₄: 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₃: 0 {O(1)}
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)}