Initial Problem

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

Preprocessing

Found invariant 1+X₁ ≤ 0 ∧ X₁ ≤ 2+X₀ ∧ 4+X₀+X₁ ≤ 0 ∧ 2+X₀ ≤ X₁ ∧ 3+X₀ ≤ 0 for location l6

Found invariant 0 ≤ X₀ for location l7

Found invariant 1+X₀ ≤ 0 for location l5

Found invariant 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ 3 ≤ X₀ for location l8

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l9

Problem after Preprocessing

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

Chain transitions t₁₂: l8→l1 and t₄: l1→l4 to t₃₃₀: l8→l4

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

Chain transitions t₁₁: l7→l1 and t₃: l1→l3 to t₃₃₂: l7→l3

Chain transitions t₁₂: l8→l1 and t₃: l1→l3 to t₃₃₃: l8→l3

Chain transitions t₉: l6→l1 and t₃: l1→l3 to t₃₃₄: l6→l3

Chain transitions t₉: l6→l1 and t₄: l1→l4 to t₃₃₅: l6→l4

Chain transitions t₉: l6→l1 and t₂: l1→l3 to t₃₃₆: l6→l3

Chain transitions t₁₁: l7→l1 and t₂: l1→l3 to t₃₃₇: l7→l3

Chain transitions t₁₂: l8→l1 and t₂: l1→l3 to t₃₃₈: l8→l3

Chain transitions t₈: l5→l1 and t₂: l1→l3 to t₃₃₉: l5→l3

Chain transitions t₈: l5→l1 and t₃: l1→l3 to t₃₄₀: l5→l3

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

Chain transitions t₁: l2→l1 and t₂: l1→l3 to t₃₄₂: l2→l3

Chain transitions t₁: l2→l1 and t₃: l1→l3 to t₃₄₃: l2→l3

Chain transitions t₁: l2→l1 and t₄: l1→l4 to t₃₄₄: l2→l4

Chain transitions t₃₃₈: l8→l3 and t₆: l3→l7 to t₃₄₅: l8→l7

Chain transitions t₃₃₃: l8→l3 and t₆: l3→l7 to t₃₄₆: l8→l7

Chain transitions t₃₃₃: l8→l3 and t₅: l3→l5 to t₃₄₇: l8→l5

Chain transitions t₃₃₈: l8→l3 and t₅: l3→l5 to t₃₄₈: l8→l5

Chain transitions t₃₃₇: l7→l3 and t₅: l3→l5 to t₃₄₉: l7→l5

Chain transitions t₃₃₇: l7→l3 and t₆: l3→l7 to t₃₅₀: l7→l7

Chain transitions t₃₃₂: l7→l3 and t₅: l3→l5 to t₃₅₁: l7→l5

Chain transitions t₃₃₂: l7→l3 and t₆: l3→l7 to t₃₅₂: l7→l7

Chain transitions t₃₃₆: l6→l3 and t₅: l3→l5 to t₃₅₃: l6→l5

Chain transitions t₃₃₆: l6→l3 and t₆: l3→l7 to t₃₅₄: l6→l7

Chain transitions t₃₃₄: l6→l3 and t₅: l3→l5 to t₃₅₅: l6→l5

Chain transitions t₃₃₄: l6→l3 and t₆: l3→l7 to t₃₅₆: l6→l7

Chain transitions t₃₄₀: l5→l3 and t₅: l3→l5 to t₃₅₇: l5→l5

Chain transitions t₃₄₀: l5→l3 and t₆: l3→l7 to t₃₅₈: l5→l7

Chain transitions t₃₃₉: l5→l3 and t₅: l3→l5 to t₃₅₉: l5→l5

Chain transitions t₃₃₉: l5→l3 and t₆: l3→l7 to t₃₆₀: l5→l7

Chain transitions t₃₄₃: l2→l3 and t₅: l3→l5 to t₃₆₁: l2→l5

Chain transitions t₃₄₃: l2→l3 and t₆: l3→l7 to t₃₆₂: l2→l7

Chain transitions t₃₄₂: l2→l3 and t₅: l3→l5 to t₃₆₃: l2→l5

Chain transitions t₃₄₂: l2→l3 and t₆: l3→l7 to t₃₆₄: l2→l7

Chain transitions t₇: l5→l6 and t₃₅₆: l6→l7 to t₃₆₅: l5→l7

Chain transitions t₇: l5→l6 and t₃₅₄: l6→l7 to t₃₆₆: l5→l7

Chain transitions t₇: l5→l6 and t₃₅₅: l6→l5 to t₃₆₇: l5→l5

Chain transitions t₇: l5→l6 and t₃₅₃: l6→l5 to t₃₆₈: l5→l5

Chain transitions t₇: l5→l6 and t₃₃₅: l6→l4 to t₃₆₉: l5→l4

Chain transitions t₇: l5→l6 and t₃₃₆: l6→l3 to t₃₇₀: l5→l3

Chain transitions t₇: l5→l6 and t₃₃₄: l6→l3 to t₃₇₁: l5→l3

Chain transitions t₇: l5→l6 and t₉: l6→l1 to t₃₇₂: l5→l1

Chain transitions t₁₀: l7→l8 and t₃₄₆: l8→l7 to t₃₇₃: l7→l7

Chain transitions t₁₀: l7→l8 and t₃₄₅: l8→l7 to t₃₇₄: l7→l7

Chain transitions t₁₀: l7→l8 and t₃₄₈: l8→l5 to t₃₇₅: l7→l5

Chain transitions t₁₀: l7→l8 and t₃₄₇: l8→l5 to t₃₇₆: l7→l5

Chain transitions t₁₀: l7→l8 and t₃₃₀: l8→l4 to t₃₇₇: l7→l4

Chain transitions t₁₀: l7→l8 and t₃₃₈: l8→l3 to t₃₇₈: l7→l3

Chain transitions t₁₀: l7→l8 and t₃₃₃: l8→l3 to t₃₇₉: l7→l3

Chain transitions t₁₀: l7→l8 and t₁₂: l8→l1 to t₃₈₀: l7→l1

Analysing control-flow refined program

Cut unsatisfiable transition t₃₃₂: l7→l3

Cut unsatisfiable transition t₃₃₉: l5→l3

Cut unsatisfiable transition t₃₅₀: l7→l7

Cut unsatisfiable transition t₃₅₁: l7→l5

Cut unsatisfiable transition t₃₅₂: l7→l7

Cut unsatisfiable transition t₃₅₇: l5→l5

Cut unsatisfiable transition t₃₅₉: l5→l5

Cut unsatisfiable transition t₃₆₀: l5→l7

Cut unsatisfiable transition t₃₆₁: l2→l5

Cut unsatisfiable transition t₃₆₄: l2→l7

Cut unsatisfiable transition t₃₆₆: l5→l7

Cut unsatisfiable transition t₃₆₇: l5→l5

Cut unsatisfiable transition t₃₆₈: l5→l5

Cut unsatisfiable transition t₃₆₉: l5→l4

Cut unsatisfiable transition t₃₇₀: l5→l3

Cut unsatisfiable transition t₃₇₃: l7→l7

Cut unsatisfiable transition t₃₇₄: l7→l7

Cut unsatisfiable transition t₃₇₆: l7→l5

Cut unsatisfiable transition t₃₇₇: l7→l4

Cut unsatisfiable transition t₃₇₉: l7→l3

Eliminate variables {X₁,X₂} that do not contribute to the problem

Found invariant 3+X₀ ≤ 0 for location l6

Found invariant 1 ≤ X₀ for location l7

Found invariant 1+X₀ ≤ 0 for location l5

Found invariant 3 ≤ X₀ for location l8

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l9

MPRF for transition t₆₅₀: l5(X₀, X₁) -{4}> l7(-2-X₀, X₁) :|: X₀+2 < 0 ∧ 2+X₀ < 0 ∧ 2+X₀ ≤ 0 ∧ 1+X₀ ≤ 0 of depth 1:

new bound:

2⋅X₁+2 {O(n)}

MPRF for transition t₆₅₇: l7(X₀, X₁) -{4}> l5(2-X₀, X₁) :|: 2 < X₀ ∧ 2 < X₀ ∧ 2 < X₀ ∧ 1 ≤ X₀ of depth 1:

new bound:

2⋅X₁+4 {O(n)}

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Cut unsatisfiable transition t₈₅₁: n_l1___13→l4

Cut unsatisfiable transition t₈₅₂: n_l1___16→l4

Cut unsatisfiable transition t₈₅₄: n_l1___6→l4

Found invariant X₁+X₂ ≤ 2 ∧ X₀+X₂ ≤ 0 ∧ 3 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 4+X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 6+X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ X₁ ≤ 2+X₀ ∧ 4+X₀+X₁ ≤ 0 ∧ 2+X₀ ≤ X₁ ∧ 3+X₀ ≤ 0 for location n_l6___3

Found invariant X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location n_l1___6

Found invariant X₃ ≤ 2+X₂ ∧ X₃ ≤ X₀ ∧ 3 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 2+X₂ ≤ X₃ ∧ 6 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ 3 ≤ X₀ for location n_l8___1

Found invariant 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l3___15

Found invariant 1+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 2+X₀+X₃ ≤ 0 ∧ X₀ ≤ X₃ ∧ 1+X₀ ≤ 0 for location n_l3___23

Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l7___17

Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location n_l1___20

Found invariant X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location n_l3___5

Found invariant 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l5___14

Found invariant 3+X₃ ≤ 0 ∧ 2+X₃ ≤ X₁ ∧ 4+X₁+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 6+X₀+X₃ ≤ 0 ∧ X₁ ≤ 2+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ 0 ∧ X₁ ≤ 2+X₀ ∧ 4+X₀+X₁ ≤ 0 ∧ 2+X₀ ≤ X₁ ∧ 3+X₀ ≤ 0 for location n_l6___19

Found invariant X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l1___10

Found invariant 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___13

Found invariant 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l3___12

Found invariant 1+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 2+X₀+X₃ ≤ 0 ∧ X₀ ≤ X₃ ∧ 1+X₀ ≤ 0 for location n_l5___21

Found invariant X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location n_l5___4

Found invariant 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l3___8

Found invariant X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location n_l7___2

Found invariant 2+X₁+X₂ ≤ 0 ∧ 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 ≤ 2+X₁+X₂ ∧ 4+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ 3+X₁ ≤ 0 ∧ 6+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l8___9

Found invariant 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l1___16

Found invariant X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location n_l3___22

Found invariant 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l5___7

Found invariant X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l1

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l9

Found invariant 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l7___11

Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l3___18

MPRF for transition t₈₀₀: n_l1___13(X₀, X₁, X₂, X₃) → n_l3___12(X₀, X₁, X₂, X₃) :|: 0 ≤ 2+X₀ ∧ 0 < X₀ ∧ 1 ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 0 < X₀ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

2⋅X₃+2 {O(n)}

MPRF for transition t₈₀₅: n_l1___6(X₀, X₁, X₂, X₃) → n_l3___5(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ 0 ∧ X₀ < 0 ∧ X₀ ≤ 2 ∧ 1+X₀ ≤ 0 ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ ∧ 1+X₀ ≤ 0 ∧ X₀ < 0 ∧ X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 of depth 1:

new bound:

2⋅X₃+2 {O(n)}

MPRF for transition t₈₀₆: n_l3___12(X₀, X₁, X₂, X₃) → n_l7___11(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

2⋅X₃+4 {O(n)}

MPRF for transition t₈₁₁: n_l3___5(X₀, X₁, X₂, X₃) → n_l5___4(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ 0 ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ ∧ X₀ < 0 ∧ X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 of depth 1:

new bound:

2⋅X₃+2 {O(n)}

MPRF for transition t₈₁₇: n_l5___4(X₀, X₁, X₂, X₃) → n_l6___3(X₀, X₀+2, X₂, X₃) :|: X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ < 0 ∧ 1+X₀ ≤ 0 ∧ X₀+X₂ ≤ 0 ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 of depth 1:

new bound:

2⋅X₃+2 {O(n)}

MPRF for transition t₈₂₀: n_l6___3(X₀, X₁, X₂, X₃) → n_l1___13(-X₀-2, X₀+2, X₂, X₃) :|: 2 < X₂ ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ ∧ X₁+X₂ ≤ 2 ∧ 2 ≤ X₁+X₂ ∧ X₀+2 ≤ X₁ ∧ 3+X₀ ≤ 0 ∧ X₁ ≤ 2+X₀ ∧ X₁+X₂ ≤ 2 ∧ X₀+X₂ ≤ 0 ∧ 3 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 4+X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 6+X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ X₁ ≤ 2+X₀ ∧ 4+X₀+X₁ ≤ 0 ∧ 2+X₀ ≤ X₁ ∧ 3+X₀ ≤ 0 of depth 1:

new bound:

2⋅X₃+2 {O(n)}

MPRF for transition t₈₂₂: n_l7___11(X₀, X₁, X₂, X₃) → n_l8___9(X₀, X₁, X₀-2, X₃) :|: 1 ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 2 < X₀ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

2⋅X₃+6 {O(n)}

MPRF for transition t₈₂₇: n_l8___9(X₀, X₁, X₂, X₃) → n_l1___6(2-X₀, X₁, X₀-2, X₃) :|: 2 < X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₂+2 ∧ X₀ ≤ X₂+2 ∧ 2+X₂ ≤ X₀ ∧ 3 ≤ X₀ ∧ 2+X₂ ≤ X₀ ∧ 2+X₁+X₂ ≤ 0 ∧ 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 ≤ 2+X₁+X₂ ∧ 4+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ 3+X₁ ≤ 0 ∧ 6+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₀+X₁ ∧ 3 ≤ X₀ of depth 1:

new bound:

2⋅X₃+6 {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₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: inf {Infinity}
t₁₃: 1 {O(1)}

Costbounds

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