Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀
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 ∧ X₁ < 0
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ 0 ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₀ < 0
t₇: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ 0 ≤ X₀
t₈: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₀ < 0
t₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Preprocessing
Cut unsatisfiable transition t₆: l3→l1
Cut unsatisfiable transition t₇: l3→l1
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ for location l1
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l4
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ for location l3
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₄: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₈: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₀ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0
MPRF for transition t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ of depth 1:
new bound:
X₂+1 {O(n)}
MPRF:
l3 [X₀+1 ]
l1 [X₀+1 ]
Found invariant 1 ≤ 0 for location l5
Found invariant 1 ≤ 0 for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant 1 ≤ 0 for location l3
Found invariant X₁ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ 2+X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant X₁ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ 2+X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l4
Found invariant X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l3
knowledge_propagation leads to new time bound X₂+2 {O(n)} for transition t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
Analysing control-flow refined program
Cut unsatisfiable transition t₁₅₃: n_l1___6→l4
Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀ for location n_l1___6
Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l3___4
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ for location n_l1___9
Found invariant 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l3___3
Found invariant 0 ≤ X₃ ∧ 1+X₂ ≤ X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l1___2
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___11
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___8
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l5
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l1___5
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2+X₂ ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l3___1
Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ for location n_l3___10
Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀ for location n_l3___7
MPRF for transition t₁₂₆: n_l1___2(X₀, X₁, X₂, X₃) → n_l3___1(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1+X₂ ≤ X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 of depth 1:
new bound:
X₃+2 {O(n)}
MPRF:
n_l3___1 [X₁ ]
n_l1___2 [X₁+1 ]
MPRF for transition t₁₃₂: n_l3___1(X₀, X₁, X₂, X₃) → n_l1___2(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 1 ≤ X₃ ∧ 2+X₂ ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 of depth 1:
new bound:
X₃+2 {O(n)}
MPRF:
n_l3___1 [X₁+1 ]
n_l1___2 [X₁+1 ]
MPRF for transition t₁₃₁: n_l1___9(X₀, X₁, X₂, X₃) → n_l3___8(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
X₂+2 {O(n)}
MPRF:
n_l3___8 [X₀ ]
n_l1___9 [X₀+1 ]
MPRF for transition t₁₄₀: n_l3___8(X₀, X₁, X₂, X₃) → n_l1___9(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ of depth 1:
new bound:
X₂+2 {O(n)}
MPRF:
n_l3___8 [X₀+1 ]
n_l1___9 [X₀+1 ]
MPRF for transition t₁₂₈: n_l1___6(X₀, X₁, X₂, X₃) → n_l3___4(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
3⋅X₂+5 {O(n)}
MPRF:
n_l3___4 [X₀ ]
n_l3___7 [X₀ ]
n_l1___6 [X₀+1 ]
MPRF for transition t₁₂₉: n_l1___6(X₀, X₁, X₂, X₃) → n_l3___7(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
3⋅X₂+7 {O(n)}
MPRF:
n_l3___4 [X₀+1 ]
n_l3___7 [X₀+1 ]
n_l1___6 [X₀+2 ]
MPRF for transition t₁₃₇: n_l3___4(X₀, X₁, X₂, X₃) → n_l1___6(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
3⋅X₂+5 {O(n)}
MPRF:
n_l3___4 [X₀+1 ]
n_l3___7 [X₀ ]
n_l1___6 [X₀+1 ]
MPRF for transition t₁₃₉: n_l3___7(X₀, X₁, X₂, X₃) → n_l1___6(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
3⋅X₂+6 {O(n)}
MPRF:
n_l3___4 [X₀ ]
n_l3___7 [X₀+1 ]
n_l1___6 [X₀+1 ]
MPRF for transition t₁₂₇: n_l1___5(X₀, X₁, X₂, X₃) → n_l3___3(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
6⋅X₃+3 {O(n)}
MPRF:
n_l3___3 [X₁ ]
n_l1___5 [X₁+1 ]
MPRF for transition t₁₃₆: n_l3___3(X₀, X₁, X₂, X₃) → n_l1___5(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
6⋅X₃+3 {O(n)}
MPRF:
n_l3___3 [X₁+1 ]
n_l1___5 [X₁+1 ]
CFR: Improvement to new bound with the following program:
new bound:
14⋅X₂+14⋅X₃+37 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l4, l5, n_l1___2, n_l1___5, n_l1___6, n_l1___9, n_l3___1, n_l3___10, n_l3___11, n_l3___3, n_l3___4, n_l3___7, n_l3___8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₄: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₁₂₄: l1(X₀, X₁, X₂, X₃) → n_l3___10(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₁₂₅: l1(X₀, X₁, X₂, X₃) → n_l3___11(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0
t₁₅₁: n_l1___2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1+X₂ ≤ X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0
t₁₂₆: n_l1___2(X₀, X₁, X₂, X₃) → n_l3___1(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1+X₂ ≤ X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0
t₁₅₂: n_l1___5(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₁₂₇: n_l1___5(X₀, X₁, X₂, X₃) → n_l3___3(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₁₂₈: n_l1___6(X₀, X₁, X₂, X₃) → n_l3___4(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀
t₁₂₉: n_l1___6(X₀, X₁, X₂, X₃) → n_l3___7(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀
t₁₅₄: n_l1___9(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀
t₁₃₀: n_l1___9(X₀, X₁, X₂, X₃) → n_l3___7(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀
t₁₃₁: n_l1___9(X₀, X₁, X₂, X₃) → n_l3___8(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀
t₁₃₂: n_l3___1(X₀, X₁, X₂, X₃) → n_l1___2(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 1 ≤ X₃ ∧ 2+X₂ ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0
t₁₃₃: n_l3___10(X₀, X₁, X₂, X₃) → n_l1___2(X₀, X₁-1, X₂, X₃) :|: 0 ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁
t₁₃₄: n_l3___10(X₀, X₁, X₂, X₃) → n_l1___6(X₀-1, X₁, X₂, X₃) :|: 0 ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁
t₁₃₅: n_l3___11(X₀, X₁, X₂, X₃) → n_l1___9(X₀-1, X₁, X₂, X₃) :|: 0 ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₁₃₆: n_l3___3(X₀, X₁, X₂, X₃) → n_l1___5(X₀, X₁-1, X₂, X₃) :|: X₀ < 0 ∧ X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₁₃₇: n_l3___4(X₀, X₁, X₂, X₃) → n_l1___6(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₃₈: n_l3___7(X₀, X₁, X₂, X₃) → n_l1___5(X₀, X₁-1, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₀ < 0 ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀
t₁₃₉: n_l3___7(X₀, X₁, X₂, X₃) → n_l1___6(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 0 ≤ 1+X₀
t₁₄₀: n_l3___8(X₀, X₁, X₂, X₃) → n_l1___9(X₀-1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀
All Bounds
Timebounds
Overall timebound:14⋅X₂+14⋅X₃+51 {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₁₂₆: X₃+2 {O(n)}
t₁₅₁: 1 {O(1)}
t₁₂₇: 6⋅X₃+3 {O(n)}
t₁₅₂: 1 {O(1)}
t₁₂₈: 3⋅X₂+5 {O(n)}
t₁₂₉: 3⋅X₂+7 {O(n)}
t₁₃₀: 1 {O(1)}
t₁₃₁: X₂+2 {O(n)}
t₁₅₄: 1 {O(1)}
t₁₃₂: X₃+2 {O(n)}
t₁₃₃: 1 {O(1)}
t₁₃₄: 1 {O(1)}
t₁₃₅: 1 {O(1)}
t₁₃₆: 6⋅X₃+3 {O(n)}
t₁₃₇: 3⋅X₂+5 {O(n)}
t₁₃₈: 1 {O(1)}
t₁₃₉: 3⋅X₂+6 {O(n)}
t₁₄₀: X₂+2 {O(n)}
Costbounds
Overall costbound: 14⋅X₂+14⋅X₃+51 {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₁₂₆: X₃+2 {O(n)}
t₁₅₁: 1 {O(1)}
t₁₂₇: 6⋅X₃+3 {O(n)}
t₁₅₂: 1 {O(1)}
t₁₂₈: 3⋅X₂+5 {O(n)}
t₁₂₉: 3⋅X₂+7 {O(n)}
t₁₃₀: 1 {O(1)}
t₁₃₁: X₂+2 {O(n)}
t₁₅₄: 1 {O(1)}
t₁₃₂: X₃+2 {O(n)}
t₁₃₃: 1 {O(1)}
t₁₃₄: 1 {O(1)}
t₁₃₅: 1 {O(1)}
t₁₃₆: 6⋅X₃+3 {O(n)}
t₁₃₇: 3⋅X₂+5 {O(n)}
t₁₃₈: 1 {O(1)}
t₁₃₉: 3⋅X₂+6 {O(n)}
t₁₄₀: X₂+2 {O(n)}
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₂ {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₀: 3⋅X₂+2 {O(n)}
t₉, X₁: 3⋅X₃+2 {O(n)}
t₉, X₂: 5⋅X₂ {O(n)}
t₉, X₃: 5⋅X₃ {O(n)}
t₁₂₆, X₀: X₂ {O(n)}
t₁₂₆, X₁: X₃+2 {O(n)}
t₁₂₆, X₂: X₂ {O(n)}
t₁₂₆, X₃: X₃ {O(n)}
t₁₅₁, X₀: 2⋅X₂ {O(n)}
t₁₅₁, X₁: 1 {O(1)}
t₁₅₁, X₂: 2⋅X₂ {O(n)}
t₁₅₁, X₃: 2⋅X₃ {O(n)}
t₁₂₇, X₀: 1 {O(1)}
t₁₂₇, X₁: 6⋅X₃+3 {O(n)}
t₁₂₇, X₂: 6⋅X₂ {O(n)}
t₁₂₇, X₃: 6⋅X₃ {O(n)}
t₁₅₂, X₀: 1 {O(1)}
t₁₅₂, X₁: 1 {O(1)}
t₁₅₂, X₂: 12⋅X₂ {O(n)}
t₁₅₂, X₃: 12⋅X₃ {O(n)}
t₁₂₈, X₀: 4⋅X₂+6 {O(n)}
t₁₂₈, X₁: 4⋅X₃ {O(n)}
t₁₂₈, X₂: 4⋅X₂ {O(n)}
t₁₂₈, X₃: 4⋅X₃ {O(n)}
t₁₂₉, X₀: 4⋅X₂+6 {O(n)}
t₁₂₉, X₁: 4⋅X₃ {O(n)}
t₁₂₉, X₂: 4⋅X₂ {O(n)}
t₁₂₉, X₃: 4⋅X₃ {O(n)}
t₁₃₀, X₀: 2⋅X₂+3 {O(n)}
t₁₃₀, X₁: 2⋅X₃ {O(n)}
t₁₃₀, X₂: 2⋅X₂ {O(n)}
t₁₃₀, X₃: 2⋅X₃ {O(n)}
t₁₃₁, X₀: X₂+2 {O(n)}
t₁₃₁, X₁: X₃ {O(n)}
t₁₃₁, X₂: X₂ {O(n)}
t₁₃₁, X₃: X₃ {O(n)}
t₁₅₄, X₀: 1 {O(1)}
t₁₅₄, X₁: 2⋅X₃ {O(n)}
t₁₅₄, X₂: 2⋅X₂ {O(n)}
t₁₅₄, X₃: 2⋅X₃ {O(n)}
t₁₃₂, X₀: X₂ {O(n)}
t₁₃₂, X₁: X₃+2 {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₀: X₂+1 {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₃: X₃ {O(n)}
t₁₃₆, X₀: 1 {O(1)}
t₁₃₆, X₁: 6⋅X₃+3 {O(n)}
t₁₃₆, X₂: 6⋅X₂ {O(n)}
t₁₃₆, X₃: 6⋅X₃ {O(n)}
t₁₃₇, X₀: 4⋅X₂+6 {O(n)}
t₁₃₇, X₁: 4⋅X₃ {O(n)}
t₁₃₇, X₂: 4⋅X₂ {O(n)}
t₁₃₇, X₃: 4⋅X₃ {O(n)}
t₁₃₈, X₀: 1 {O(1)}
t₁₃₈, X₁: 6⋅X₃+2 {O(n)}
t₁₃₈, X₂: 6⋅X₂ {O(n)}
t₁₃₈, X₃: 6⋅X₃ {O(n)}
t₁₃₉, X₀: 4⋅X₂+6 {O(n)}
t₁₃₉, X₁: 4⋅X₃ {O(n)}
t₁₃₉, X₂: 4⋅X₂ {O(n)}
t₁₃₉, X₃: 4⋅X₃ {O(n)}
t₁₄₀, X₀: X₂+2 {O(n)}
t₁₄₀, X₁: X₃ {O(n)}
t₁₄₀, X₂: X₂ {O(n)}
t₁₄₀, X₃: X₃ {O(n)}