Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₁₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₂, X₃, X₂, X₃, X₄, X₅)
t₇: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₀-1, X₃, X₄, X₅)
t₉: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅)
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₀ ∧ 0 ≤ X₁
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 0
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₄, X₅, X₂, X₃, X₄, X₅)
t₅: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1
t₆: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁-1, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁
t₁₁: l7(X₀, X₁, X₂, X₃, X₄, X₅) → l8(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

Found invariant 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l6

Found invariant X₀ ≤ X₄ for location l7

Found invariant X₀ ≤ X₄ for location l8

Found invariant 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l1

Found invariant X₀ ≤ X₄ for location l4

Found invariant 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₁₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₂, X₃, X₂, X₃, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₇: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₀-1, X₃, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₉: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₄
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < 0 ∧ X₀ ≤ X₄
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 0 ∧ X₀ ≤ X₄
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₄, X₅, X₂, X₃, X₄, X₅)
t₅: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₆: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁-1, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁ ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₁: l7(X₀, X₁, X₂, X₃, X₄, X₅) → l8(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₄

MPRF for transition t₅: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₄+1 {O(n)}

MPRF for transition t₇: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₀-1, X₃, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₄+1 {O(n)}

MPRF for transition t₉: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₄+1 {O(n)}

MPRF for transition t₁₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₂, X₃, X₂, X₃, X₄, X₅) :|: 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₄+1 {O(n)}

Chain transitions t₉: l3→l1 and t₁₀: l1→l4 to t₇₉: l3→l4

Chain transitions t₅: l6→l2 and t₇: l2→l3 to t₈₀: l6→l3

Chain transitions t₈₀: l6→l3 and t₇₉: l3→l4 to t₈₁: l6→l4

Chain transitions t₈₀: l6→l3 and t₉: l3→l1 to t₈₂: l6→l1

Chain transitions t₈₁: l6→l4 and t₄: l4→l7 to t₈₃: l6→l7

Chain transitions t₆: l6→l4 and t₄: l4→l7 to t₈₄: l6→l7

Chain transitions t₆: l6→l4 and t₃: l4→l7 to t₈₅: l6→l7

Chain transitions t₈₁: l6→l4 and t₃: l4→l7 to t₈₆: l6→l7

Chain transitions t₁: l5→l4 and t₃: l4→l7 to t₈₇: l5→l7

Chain transitions t₁: l5→l4 and t₄: l4→l7 to t₈₈: l5→l7

Chain transitions t₁: l5→l4 and t₂: l4→l6 to t₈₉: l5→l6

Chain transitions t₆: l6→l4 and t₂: l4→l6 to t₉₀: l6→l6

Chain transitions t₈₁: l6→l4 and t₂: l4→l6 to t₉₁: l6→l6

Analysing control-flow refined program

Cut unsatisfiable transition t₈₄: l6→l7

Cut unsatisfiable transition t₈₅: l6→l7

Eliminate variables {Temp_Int₄₀₅,X₂,X₃} that do not contribute to the problem

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l6

Found invariant X₀ ≤ X₂ for location l7

Found invariant X₀ ≤ X₂ for location l8

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l1

Found invariant X₀ ≤ X₂ for location l4

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3

MPRF for transition t₁₂₄: l6(X₀, X₁, X₂, X₃) -{5}> l6(X₀-1, Temp_Int₃₉₇, X₂, X₃) :|: X₁ < 1 ∧ 1 ≤ X₀ ∧ 0 ≤ Temp_Int₃₉₇ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₂+1 {O(n)}

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l6___1

Found invariant 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l6___2

Found invariant X₅ ≤ X₁ ∧ 0 ≤ X₅ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 0 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l6___4

Found invariant 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l4___3

Found invariant X₀ ≤ X₄ for location l7

Found invariant X₀ ≤ X₄ for location l8

Found invariant 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l1

Found invariant X₀ ≤ X₄ for location l4

Found invariant 0 ≤ X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₉₆: l4(X₀, X₁, X₂, X₃, X₄, X₅) → n_l6___1(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₄ ∧ 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₄ ∧ X₀ ≤ X₄ ∧ X₀ ≤ X₄

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₁₉₇: l4(X₀, X₁, X₂, X₃, X₄, X₅) → n_l6___4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ X₅ ∧ X₅ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₄ ∧ X₀ ≤ X₄ ∧ X₀ ≤ X₄ ∧ X₀ ≤ X₄

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₉₈: n_l6___1(X₀, X₁, X₂, X₃, X₄, X₅) → n_l4___3(X₀, X₁-1, X₂, X₃, X₄, X₅) :|: 1+X₂ ≤ X₄ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₁ ∧ 0 ≤ X₀ ∧ X₀ ≤ X₄ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂₀₀: n_l6___4(X₀, X₁, X₂, X₃, X₄, X₅) → n_l4___3(X₀, X₁-1, X₂, X₃, X₄, X₅) :|: X₄ ≤ X₀ ∧ X₁ ≤ X₅ ∧ X₅ ≤ X₁ ∧ 1 ≤ X₁ ∧ 0 ≤ X₁ ∧ 0 ≤ X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₀ ∧ X₀ ≤ X₄ ∧ X₅ ≤ X₁ ∧ 0 ≤ X₅ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 0 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₀₆: n_l6___1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂₀₈: n_l6___4(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ X₅ ≤ X₁ ∧ 0 ≤ X₅ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 0 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀

MPRF for transition t₂₀₇: n_l6___2(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < 1 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₄+1 {O(n)}

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₄+1 {O(n)}
t₆: inf {Infinity}
t₇: X₄+1 {O(n)}
t₉: X₄+1 {O(n)}
t₁₀: X₄+1 {O(n)}
t₁₁: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₄+1 {O(n)}
t₆: inf {Infinity}
t₇: X₄+1 {O(n)}
t₉: X₄+1 {O(n)}
t₁₀: X₄+1 {O(n)}
t₁₁: 1 {O(1)}

Sizebounds

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₂+X₄+2 {O(n)}
t₂, X₄: X₄ {O(n)}
t₂, X₅: X₅ {O(n)}
t₃, X₀: 2⋅X₄+1 {O(n)}
t₃, X₂: X₂+X₄+2 {O(n)}
t₃, X₄: 2⋅X₄ {O(n)}
t₃, X₅: 2⋅X₅ {O(n)}
t₄, X₀: 2⋅X₄+1 {O(n)}
t₄, X₂: X₂+X₄+2 {O(n)}
t₄, X₄: 2⋅X₄ {O(n)}
t₄, X₅: 2⋅X₅ {O(n)}
t₅, X₀: X₄+1 {O(n)}
t₅, X₁: 0 {O(1)}
t₅, X₂: X₂+X₄+2 {O(n)}
t₅, X₄: X₄ {O(n)}
t₅, X₅: X₅ {O(n)}
t₆, X₀: X₄+1 {O(n)}
t₆, X₂: X₂+X₄+2 {O(n)}
t₆, X₄: X₄ {O(n)}
t₆, X₅: X₅ {O(n)}
t₇, X₀: X₄+1 {O(n)}
t₇, X₁: 0 {O(1)}
t₇, X₂: X₄+2 {O(n)}
t₇, X₄: X₄ {O(n)}
t₇, X₅: X₅ {O(n)}
t₉, X₀: X₄+1 {O(n)}
t₉, X₁: 0 {O(1)}
t₉, X₂: X₄+2 {O(n)}
t₉, X₄: X₄ {O(n)}
t₉, X₅: X₅ {O(n)}
t₁₀, X₀: X₄+1 {O(n)}
t₁₀, X₂: X₄+2 {O(n)}
t₁₀, X₄: X₄ {O(n)}
t₁₀, X₅: X₅ {O(n)}
t₁₁, X₀: 4⋅X₄+2 {O(n)}
t₁₁, X₂: 2⋅X₂+2⋅X₄+4 {O(n)}
t₁₁, X₄: 4⋅X₄ {O(n)}
t₁₁, X₅: 4⋅X₅ {O(n)}