Initial Problem

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

Preprocessing

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

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

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

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

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

Problem after Preprocessing

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

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→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→l2 to t₁₉₂: l5→l2

Chain transitions t₄: l5→l1 and t₇: l1→l2 to t₁₉₃: l5→l2

Chain transitions t₁₉₁: l5→l3 and t₉: l3→l5 to t₁₉₄: l5→l5

Chain transitions t₁₉₀: l5→l3 and t₉: l3→l5 to t₁₉₅: l5→l5

Chain transitions t₁₉₀: l5→l3 and t₈: l3→l5 to t₁₉₆: l5→l5

Chain transitions t₁₉₁: l5→l3 and t₈: l3→l5 to t₁₉₇: l5→l5

Chain transitions t₁₈₉: l5→l3 and t₈: l3→l5 to t₁₉₈: l5→l5

Chain transitions t₁₈₉: l5→l3 and t₉: l3→l5 to t₁₉₉: l5→l5

Chain transitions t₁₈₈: l5→l3 and t₈: l3→l5 to t₂₀₀: l5→l5

Chain transitions t₁₈₈: l5→l3 and t₉: l3→l5 to t₂₀₁: l5→l5

Analysing control-flow refined program

Cut unsatisfiable transition t₁₉₅: l5→l5

Cut unsatisfiable transition t₁₉₉: l5→l5

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

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

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

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

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

MPRF for transition t₁₉₇: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, X₂+1) :|: X₀+1 ≤ X₂ ∧ Temp_Int₅₅₂+1 ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₂₀₀: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, X₂+1) :|: X₀+1 ≤ X₂ ∧ 1 ≤ Temp_Int₅₄₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

knowledge_propagation leads to new time bound 2⋅X₀+2⋅X₁+4 {O(n)} for transition t₁₉₄: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, 0) :|: X₀+1 ≤ X₂ ∧ Temp_Int₅₅₂+1 ≤ 0 ∧ X₁+1 ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀

knowledge_propagation leads to new time bound 2⋅X₀+2⋅X₁+4 {O(n)} for transition t₂₀₁: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, 0) :|: X₀+1 ≤ X₂ ∧ 1 ≤ Temp_Int₅₄₀ ∧ X₁+1 ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀

MPRF for transition t₁₉₆: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, X₂+1) :|: X₂+1 ≤ X₀ ∧ Temp_Int₅₄₈+1 ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

8⋅X₀⋅X₁+8⋅X₁⋅X₁+21⋅X₁+5⋅X₀+10 {O(n^2)}

MPRF for transition t₁₉₈: l5(X₀, X₁, X₂) -{3}> l5(X₀, X₁, X₂+1) :|: X₂+1 ≤ X₀ ∧ 1 ≤ Temp_Int₅₄₄ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

8⋅X₀⋅X₁+8⋅X₁⋅X₁+21⋅X₁+5⋅X₀+10 {O(n^2)}

Analysing control-flow refined program

Cut unsatisfiable transition t₂: l5→l2

Cut unsatisfiable transition t₅₀₉: n_l5___5→n_l1___3

Cut unsatisfiable transition t₅₂₈: n_l5___11→l2

Cut unreachable locations [n_l1___3; n_l3___1] from the program graph

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

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

Found invariant X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l5___11

Found invariant 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l1___4

Found invariant 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l5___5

Found invariant X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___7

Found invariant X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___6

Found invariant X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___10

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

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

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

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

Found invariant 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___2

Found invariant X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___9

MPRF for transition t₄₉₁: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₄₉₂: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₅₀₅: n_l3___9(X₀, X₁, X₂) → n_l5___11(X₀, X₁, X₂+1) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₅₀₇: n_l5___11(X₀, X₁, X₂) → n_l1___10(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₄₉₇: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₄₉₈: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₅₀₃: n_l3___2(X₀, X₁, X₂) → n_l5___5(X₀, X₁, X₂+1) :|: 1+X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ of depth 1:

new bound:

8⋅X₀+1 {O(n)}

MPRF for transition t₅₁₀: n_l5___5(X₀, X₁, X₂) → n_l1___4(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

8⋅X₀+2 {O(n)}

CFR: Improvement to new bound with the following program:

new bound:

Infinite

cfr-program:

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l2, l4, l5, l6, n_l1___10, n_l1___13, n_l1___4, n_l1___7, n_l3___12, n_l3___2, n_l3___6, n_l3___9, n_l5___11, n_l5___5, n_l5___8
Transitions:
t₀: l0(X₀, X₁, X₂) → l4(X₀, X₁, X₂)
t₁₀: l2(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₀+1) :|: 0 ≤ X₀ ∧ X₀+1 ≤ X₁
t₅₀₈: l5(X₀, X₁, X₂) → n_l1___13(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₁: n_l1___10(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₁: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₂: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₂: n_l1___13(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₃: n_l1___13(X₀, X₁, X₂) → n_l3___12(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₄: n_l1___13(X₀, X₁, X₂) → n_l3___12(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₄: n_l1___4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₄₉₇: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₄₉₈: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₅₃₅: n_l1___7(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₄₉₉: n_l1___7(X₀, X₁, X₂) → n_l3___6(X₀, X₁, X₂) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₀: n_l1___7(X₀, X₁, X₂) → n_l3___6(X₀, X₁, X₂) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₂: n_l3___12(X₀, X₁, X₂) → n_l5___11(X₀, X₁, X₂+1) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₃: n_l3___2(X₀, X₁, X₂) → n_l5___5(X₀, X₁, X₂+1) :|: 1+X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₅₀₄: n_l3___6(X₀, X₁, X₂) → n_l5___5(X₀, X₁, X₂+1) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₅: n_l3___9(X₀, X₁, X₂) → n_l5___11(X₀, X₁, X₂+1) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₆: n_l3___9(X₀, X₁, X₂) → n_l5___8(X₀, X₁, 0) :|: 1+X₀ ≤ X₂ ∧ X₁+1 ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₇: n_l5___11(X₀, X₁, X₂) → n_l1___10(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₂₉: n_l5___5(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₁₀: n_l5___5(X₀, X₁, X₂) → n_l1___4(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₃₀: n_l5___8(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₁₁: n_l5___8(X₀, X₁, X₂) → n_l1___7(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀

CFR: Improvement to new bound with the following program:

new bound:

24⋅X₀+24⋅X₁+30 {O(n)}

cfr-program:

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l2, l4, l5, l6, n_l1___10, n_l1___13, n_l1___4, n_l1___7, n_l3___12, n_l3___2, n_l3___6, n_l3___9, n_l5___11, n_l5___5, n_l5___8
Transitions:
t₀: l0(X₀, X₁, X₂) → l4(X₀, X₁, X₂)
t₁₀: l2(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₀+1) :|: 0 ≤ X₀ ∧ X₀+1 ≤ X₁
t₅₀₈: l5(X₀, X₁, X₂) → n_l1___13(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₁: n_l1___10(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₁: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₂: n_l1___10(X₀, X₁, X₂) → n_l3___9(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₂: n_l1___13(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₃: n_l1___13(X₀, X₁, X₂) → n_l3___12(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄₉₄: n_l1___13(X₀, X₁, X₂) → n_l3___12(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₃₄: n_l1___4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₄₉₇: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₄₉₈: n_l1___4(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₅₃₅: n_l1___7(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₄₉₉: n_l1___7(X₀, X₁, X₂) → n_l3___6(X₀, X₁, X₂) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₀: n_l1___7(X₀, X₁, X₂) → n_l3___6(X₀, X₁, X₂) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₂: n_l3___12(X₀, X₁, X₂) → n_l5___11(X₀, X₁, X₂+1) :|: X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀+1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₃: n_l3___2(X₀, X₁, X₂) → n_l5___5(X₀, X₁, X₂+1) :|: 1+X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀
t₅₀₄: n_l3___6(X₀, X₁, X₂) → n_l5___5(X₀, X₁, X₂+1) :|: 1 ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₀₅: n_l3___9(X₀, X₁, X₂) → n_l5___11(X₀, X₁, X₂+1) :|: 1+X₀ ≤ X₂ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₆: n_l3___9(X₀, X₁, X₂) → n_l5___8(X₀, X₁, 0) :|: 1+X₀ ≤ X₂ ∧ X₁+1 ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₀₇: n_l5___11(X₀, X₁, X₂) → n_l1___10(X₀, X₁, X₂) :|: 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₂₉: n_l5___5(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₁₀: n_l5___5(X₀, X₁, X₂) → n_l1___4(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅₃₀: n_l5___8(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅₁₁: n_l5___8(X₀, X₁, X₂) → n_l1___7(X₀, X₁, X₂) :|: X₂ ≤ X₁ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 1+X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀

All Bounds

Timebounds

Overall timebound:24⋅X₀+24⋅X₁+48 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₁₀: 1 {O(1)}
t₄₉₁: 2⋅X₀+2⋅X₁+6 {O(n)}
t₄₉₂: 2⋅X₀+2⋅X₁+6 {O(n)}
t₄₉₃: 1 {O(1)}
t₄₉₄: 1 {O(1)}
t₄₉₇: 8⋅X₁+2 {O(n)}
t₄₉₈: 8⋅X₁+2 {O(n)}
t₄₉₉: 1 {O(1)}
t₅₀₀: 1 {O(1)}
t₅₀₂: 1 {O(1)}
t₅₀₃: 8⋅X₀+1 {O(n)}
t₅₀₄: 1 {O(1)}
t₅₀₅: 2⋅X₀+2⋅X₁+5 {O(n)}
t₅₀₆: 1 {O(1)}
t₅₀₇: 2⋅X₀+2⋅X₁+6 {O(n)}
t₅₀₈: 1 {O(1)}
t₅₁₀: 8⋅X₀+2 {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)}

Costbounds

Overall costbound: 24⋅X₀+24⋅X₁+48 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₁₀: 1 {O(1)}
t₄₉₁: 2⋅X₀+2⋅X₁+6 {O(n)}
t₄₉₂: 2⋅X₀+2⋅X₁+6 {O(n)}
t₄₉₃: 1 {O(1)}
t₄₉₄: 1 {O(1)}
t₄₉₇: 8⋅X₁+2 {O(n)}
t₄₉₈: 8⋅X₁+2 {O(n)}
t₄₉₉: 1 {O(1)}
t₅₀₀: 1 {O(1)}
t₅₀₂: 1 {O(1)}
t₅₀₃: 8⋅X₀+1 {O(n)}
t₅₀₄: 1 {O(1)}
t₅₀₅: 2⋅X₀+2⋅X₁+5 {O(n)}
t₅₀₆: 1 {O(1)}
t₅₀₇: 2⋅X₀+2⋅X₁+6 {O(n)}
t₅₀₈: 1 {O(1)}
t₅₁₀: 8⋅X₀+2 {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)}

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