Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0 ∧ X₁ < 0
t₅: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₀
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁
t₉: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₄, X₅, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₃+1 ∧ X₃+1 ≤ X₂ ∧ X₄ < 0
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ < X₃+1
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃+1 < X₂
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₄
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+X₂-X₃-1, X₁+X₃-X₂-1, X₂, X₃, X₄, X₅)
Found invariant 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ for location l1
Found invariant 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ for location l4
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0 ∧ X₁ < 0 ∧ 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃
t₅: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₀ ∧ 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁ ∧ 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃
t₉: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₄, X₅, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₃+1 ∧ X₃+1 ≤ X₂ ∧ X₄ < 0
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ < X₃+1
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃+1 < X₂
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₄
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+X₂-X₃-1, X₁+X₃-X₂-1, X₂, X₃, X₄, X₅) :|: 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃
new bound:
X₅+1 {O(n)}
MPRF:
l4 [X₁-1 ]
l1 [X₁+1 ]
Cut unsatisfiable transition t₇₅: l1→n_l4___5
Cut unsatisfiable transition t₈₅: n_l1___3→l2
Found invariant 1 ≤ 0 for location n_l4___2
Found invariant 0 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 0 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ 1+X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l4___4
Found invariant 1 ≤ 0 for location n_l1___3
Found invariant 1 ≤ 0 for location n_l4___5
Found invariant X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 1+X₀ ≤ 0 for location l1
Found invariant 0 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 0 ≤ 2+X₁+X₅ ∧ 2+X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ 1+X₁ ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ 2+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1+X₀ ≤ 0 for location n_l1___1
Cut unsatisfiable transition t₇₁: n_l1___1→n_l4___5
Cut unsatisfiable transition t₇₂: n_l1___3→n_l4___2
Cut unsatisfiable transition t₇₃: n_l1___3→n_l4___5
Cut unsatisfiable transition t₇₆: n_l4___2→n_l1___3
Cut unsatisfiable transition t₇₈: n_l4___5→n_l1___3
Cut unreachable locations [n_l1___3; n_l4___2; n_l4___5] from the program graph
new bound:
X₅+1 {O(n)}
MPRF:
n_l4___4 [X₁-1 ]
n_l1___1 [X₁+1 ]
new bound:
X₅+1 {O(n)}
MPRF:
n_l4___4 [X₁+1 ]
n_l1___1 [X₁+1 ]
new bound:
2⋅X₅+2 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l5, n_l1___1, n_l4___4
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0 ∧ X₁ < 0 ∧ 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 1+X₀ ≤ 0
t₇₄: l1(X₀, X₁, X₂, X₃, X₄, X₅) → n_l4___4(X₀, X₁, X₂, X₂-1, X₄, X₅) :|: X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ 1+X₄ ≤ 0 ∧ 0 ≤ X₁ ∧ X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 1+X₀ ≤ 0
t₉: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₄, X₅, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₃+1 ∧ X₃+1 ≤ X₂ ∧ X₄ < 0
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ < X₃+1
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃+1 < X₂
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₄
t₈₄: n_l1___1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0 ∧ X₁ < 0 ∧ 1+X₄ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 0 ≤ 2+X₁+X₅ ∧ 2+X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ 1+X₁ ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ 2+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1+X₀ ≤ 0
t₇₀: n_l1___1(X₀, X₁, X₂, X₃, X₄, X₅) → n_l4___4(X₀, X₁, X₂, X₂-1, X₄, X₅) :|: 1+X₄ ≤ 0 ∧ X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 1+X₃ ≤ X₂ ∧ 1+X₄ ≤ 0 ∧ 1+X₄ ≤ 0 ∧ 0 ≤ X₁ ∧ X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 0 ≤ 2+X₁+X₅ ∧ 2+X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ X₄ ≤ 1+X₁ ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ 2+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1+X₀ ≤ 0
t₇₇: n_l4___4(X₀, X₁, X₂, X₃, X₄, X₅) → n_l1___1(X₀, X₁-2, X₂, X₂-1, X₄, X₅) :|: 1+X₄ ≤ 0 ∧ 0 ≤ X₁ ∧ X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ 1+X₄ ≤ 0 ∧ X₂ ≤ X₃+1 ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 0 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ 0 ∧ 1+X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 2+X₀+X₄ ≤ 0 ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ X₂ ≤ 1+X₃ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0
Overall timebound:2⋅X₅+11 {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₄: 1 {O(1)}
t₇₀: X₅+1 {O(n)}
t₈₄: 1 {O(1)}
t₇₇: X₅+1 {O(n)}
Overall costbound: 2⋅X₅+11 {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₄: 1 {O(1)}
t₇₀: X₅+1 {O(n)}
t₈₄: 1 {O(1)}
t₇₇: X₅+1 {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₂+1 {O(n)}
t₇₄, X₄: X₄ {O(n)}
t₇₄, X₅: X₅ {O(n)}
t₉, X₀: 2⋅X₄+3⋅X₀ {O(n)}
t₉, X₁: 3⋅X₁+X₅+2 {O(n)}
t₉, X₂: 5⋅X₂ {O(n)}
t₉, X₃: 5⋅X₃ {O(n)}
t₉, X₄: 5⋅X₄ {O(n)}
t₉, X₅: 5⋅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₅: X₅ {O(n)}
t₇₀, X₀: X₄ {O(n)}
t₇₀, X₁: X₅+2 {O(n)}
t₇₀, X₂: X₂ {O(n)}
t₇₀, X₃: X₂+1 {O(n)}
t₇₀, X₄: X₄ {O(n)}
t₇₀, X₅: X₅ {O(n)}
t₈₄, X₀: X₄ {O(n)}
t₈₄, X₁: 2 {O(1)}
t₈₄, X₂: X₂ {O(n)}
t₈₄, X₃: 2⋅X₂+2 {O(n)}
t₈₄, X₄: X₄ {O(n)}
t₈₄, X₅: X₅ {O(n)}
t₇₇, X₀: X₄ {O(n)}
t₇₇, X₁: X₅+2 {O(n)}
t₇₇, X₂: X₂ {O(n)}
t₇₇, X₃: 2⋅X₂+2 {O(n)}
t₇₇, X₄: X₄ {O(n)}
t₇₇, X₅: X₅ {O(n)}