Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ < 1
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 < X₃
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃
t₈: l2(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₁: l3(X₀, X₁, X₂, X₃) → l1(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 2⋅X₂ < X₃
t₇: l4(X₀, X₁, X₂, X₃) → l1(X₀+1-2⋅X₂, X₁, X₂, X₃)
Found invariant X₃ ≤ 1 ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 0 ≤ X₀ for location l4
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ < 1
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 < X₃
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃
t₈: l2(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₁: l3(X₀, X₁, X₂, X₃) → l1(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 2⋅X₂ < X₃
t₇: l4(X₀, X₁, X₂, X₃) → l1(X₀+1-2⋅X₂, X₁, X₂, X₃) :|: X₃ ≤ 1 ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 0 ≤ X₀
Chain transitions t₇: l4→l1 and t₃: l1→l4 to t₅₈: l4→l4
Chain transitions t₁: l3→l1 and t₃: l1→l4 to t₅₉: l3→l4
Chain transitions t₁: l3→l1 and t₆: l1→l2 to t₆₀: l3→l2
Chain transitions t₇: l4→l1 and t₆: l1→l2 to t₆₁: l4→l2
Chain transitions t₁: l3→l1 and t₅: l1→l2 to t₆₂: l3→l2
Chain transitions t₇: l4→l1 and t₅: l1→l2 to t₆₃: l4→l2
Chain transitions t₁: l3→l1 and t₄: l1→l2 to t₆₄: l3→l2
Chain transitions t₇: l4→l1 and t₄: l1→l2 to t₆₅: l4→l2
Cut unsatisfiable transition t₆₁: l4→l2
Cut unsatisfiable transition t₆₃: l4→l2
Found invariant X₀ ≤ X₁ for location l1
Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
new bound:
X₁+1 {O(n)}
Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___3
Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___1
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
new bound:
2⋅X₁+2⋅X₂+1 {O(n)}
new bound:
2⋅X₁+4⋅X₂+1 {O(n)}
new bound:
Infinite
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l5, n_l1___2, n_l4___1, n_l4___3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ < 1 ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 < X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁₁₉: l1(X₀, X₁, X₂, X₃) → n_l4___3(X₀, X₁, X₂, 1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₃ ≤ 2⋅X₂ ∧ 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₈: l2(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₁: l3(X₀, X₁, X₂, X₃) → l1(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 2⋅X₂ < X₃
t₁₂₇: n_l1___2(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₁₈: n_l1___2(X₀, X₁, X₂, X₃) → n_l4___1(X₀, X₁, X₂, 1) :|: X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ 1 ≤ X₀+2⋅X₂ ∧ 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₂₀: n_l4___1(X₀, X₁, X₂, X₃) → n_l1___2(X₀+1-2⋅X₂, X₁, X₂, 1) :|: 1 ≤ X₀+2⋅X₂ ∧ X₃ ≤ 1 ∧ X₃ ≤ 1 ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₂₁: n_l4___3(X₀, X₁, X₂, X₃) → n_l1___2(X₀+1-2⋅X₂, X₁, X₂, 1) :|: 1 ≤ 2⋅X₂ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₃ ≤ 1 ∧ X₃ ≤ 1 ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
new bound:
4⋅X₁+6⋅X₂+2 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l5, n_l1___2, n_l4___1, n_l4___3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ < 1 ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 < X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁₁₉: l1(X₀, X₁, X₂, X₃) → n_l4___3(X₀, X₁, X₂, 1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₃ ≤ 2⋅X₂ ∧ 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₈: l2(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₁: l3(X₀, X₁, X₂, X₃) → l1(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 2⋅X₂ < X₃
t₁₂₇: n_l1___2(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₁₈: n_l1___2(X₀, X₁, X₂, X₃) → n_l4___1(X₀, X₁, X₂, 1) :|: X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ 1 ≤ X₀+2⋅X₂ ∧ 0 ≤ X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₂₀: n_l4___1(X₀, X₁, X₂, X₃) → n_l1___2(X₀+1-2⋅X₂, X₁, X₂, 1) :|: 1 ≤ X₀+2⋅X₂ ∧ X₃ ≤ 1 ∧ X₃ ≤ 1 ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₂₁: n_l4___3(X₀, X₁, X₂, X₃) → n_l1___2(X₀+1-2⋅X₂, X₁, X₂, 1) :|: 1 ≤ 2⋅X₂ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₃ ≤ 1 ∧ X₃ ≤ 1 ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ 0 ≤ X₀ ∧ 1 ≤ X₃ ∧ X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ 1+X₁ ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
Overall timebound:4⋅X₁+6⋅X₂+12 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₈: 1 {O(1)}
t₁₁₈: 2⋅X₁+2⋅X₂+1 {O(n)}
t₁₁₉: 1 {O(1)}
t₁₂₀: 2⋅X₁+4⋅X₂+1 {O(n)}
t₁₂₁: 1 {O(1)}
t₁₂₇: 1 {O(1)}
Overall costbound: 4⋅X₁+6⋅X₂+12 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₈: 1 {O(1)}
t₁₁₈: 2⋅X₁+2⋅X₂+1 {O(n)}
t₁₁₉: 1 {O(1)}
t₁₂₀: 2⋅X₁+4⋅X₂+1 {O(n)}
t₁₂₁: 1 {O(1)}
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₁: 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⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁+2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂⋅X₂+2⋅X₂+5⋅X₁+X₀ {O(EXP)}
t₈, X₁: 6⋅X₁ {O(n)}
t₈, X₂: 6⋅X₂ {O(n)}
t₈, X₃: 4⋅X₃+1 {O(n)}
t₁₁₈, X₀: 2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁+2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂⋅X₂ {O(EXP)}
t₁₁₈, X₁: X₁ {O(n)}
t₁₁₈, X₂: X₂ {O(n)}
t₁₁₈, X₃: 1 {O(1)}
t₁₁₉, X₀: X₁ {O(n)}
t₁₁₉, X₁: X₁ {O(n)}
t₁₁₉, X₂: X₂ {O(n)}
t₁₁₉, X₃: 1 {O(1)}
t₁₂₀, X₀: 2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁+2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂⋅X₂ {O(EXP)}
t₁₂₀, X₁: X₁ {O(n)}
t₁₂₀, X₂: X₂ {O(n)}
t₁₂₀, X₃: 1 {O(1)}
t₁₂₁, X₀: 2⋅X₁+2⋅X₂ {O(n)}
t₁₂₁, X₁: X₁ {O(n)}
t₁₂₁, X₂: X₂ {O(n)}
t₁₂₁, X₃: 1 {O(1)}
t₁₂₇, X₀: 2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁+2⋅2^(2⋅X₁+4⋅X₂+1)⋅X₁⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂+2^(2⋅X₁+4⋅X₂+1)⋅4⋅X₂⋅X₂+2⋅X₁+2⋅X₂ {O(EXP)}
t₁₂₇, X₁: 2⋅X₁ {O(n)}
t₁₂₇, X₂: 2⋅X₂ {O(n)}
t₁₂₇, X₃: 1 {O(1)}