Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
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₁
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀+X₁ < 0
t₄: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ < X₀
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, 20, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ < X₀+5
t₆: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+X₀ < 5
t₇: l3(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: 5+X₀ ≤ X₁ ∧ 5 ≤ X₁+X₀
t₁₂: l4(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₈: l5(X₀, X₁, X₂, X₃) → l1(-X₀, X₁, X₂, X₃)
t₉: l6(X₀, X₁, X₂, X₃) → l1(X₀-1, -1, X₂, X₃) :|: X₀ ≤ 1 ∧ 1 ≤ X₀
t₁₀: l6(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁+1, X₂, X₃) :|: X₀ < 1
t₁₁: l6(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁+1, X₂, X₃) :|: 1 < X₀
Preprocessing
Eliminate variables {X₃} that do not contribute to the problem
Found invariant 5 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁ for location l6
Found invariant 0 ≤ 1+X₁ for location l7
Found invariant 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant 0 ≤ 1+X₁ for location l1
Found invariant 0 ≤ 1+X₁ for location l4
Found invariant 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ for location l3
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₂₆: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂₇: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₁+X₀ ∧ X₀ ≤ X₁ ∧ 0 ≤ 1+X₁
t₂₈: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀+X₁ < 0 ∧ 0 ≤ 1+X₁
t₂₉: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₁ < X₀ ∧ 0 ≤ 1+X₁
t₃₀: l2(X₀, X₁, X₂) → l1(X₂, 20, X₂)
t₃₁: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₁ < X₀+5 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁
t₃₂: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₁+X₀ < 5 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁
t₃₃: l3(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: 5+X₀ ≤ X₁ ∧ 5 ≤ X₁+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁
t₃₄: l4(X₀, X₁, X₂) → l7(X₀, X₁, X₂) :|: 0 ≤ 1+X₁
t₃₅: l5(X₀, X₁, X₂) → l1(-X₀, X₁, X₂) :|: 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁
t₃₆: l6(X₀, X₁, X₂) → l1(X₀-1, -1, X₂) :|: X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 5 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁
t₃₇: l6(X₀, X₁, X₂) → l1(X₀-1, X₁+1, X₂) :|: X₀ < 1 ∧ 5 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁
t₃₈: l6(X₀, X₁, X₂) → l1(X₀-1, X₁+1, X₂) :|: 1 < X₀ ∧ 5 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁
Analysing control-flow refined program
Cut unsatisfiable transition t₁₅₂: n_l1___10→l4
Cut unsatisfiable transition t₁₅₇: n_l1___10→l4
Cut unsatisfiable transition t₁₅₃: n_l1___13→l4
Cut unsatisfiable transition t₁₅₈: n_l1___13→l4
Cut unsatisfiable transition t₁₅₄: n_l1___5→l4
Cut unsatisfiable transition t₁₅₉: n_l1___5→l4
Cut unsatisfiable transition t₁₅₅: n_l1___6→l4
Cut unsatisfiable transition t₁₆₀: n_l1___6→l4
Found invariant X₂ ≤ 0 ∧ 21+X₂ ≤ X₁ ∧ 1+X₀+X₂ ≤ 0 ∧ 0 ≤ 15+X₂ ∧ 6 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀+X₁ ≤ 20 ∧ 21 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 22+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l6___3
Found invariant X₂ ≤ 0 ∧ 21+X₂ ≤ X₁ ∧ 1+X₀+X₂ ≤ 0 ∧ 0 ≤ 15+X₂ ∧ 6 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀+X₁ ≤ 20 ∧ 21 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 22+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l1___6
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 40 ∧ 16 ≤ X₂ ∧ 36 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 32 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 40 ∧ 20 ≤ X₁ ∧ 36 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 20 ∧ 16 ≤ X₀ for location n_l5___16
Found invariant X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ for location n_l6___1
Found invariant X₂ ≤ 0 ∧ 21+X₂ ≤ X₁ ∧ 1+X₀+X₂ ≤ 0 ∧ 0 ≤ 15+X₂ ∧ 6 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀+X₁ ≤ 20 ∧ 21 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 22+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l3___4
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ 40+X₀ ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ 40+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 40+X₀ ∧ X₀+X₁ ≤ 4 ∧ 20 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 36+X₀ ≤ X₁ ∧ 16+X₀ ≤ 0 ∧ 0 ≤ 20+X₀ for location n_l5___11
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 40 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ 40+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 40+X₀ ∧ X₀+X₁ ≤ 40 ∧ 20 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 20 ∧ 0 ≤ 20+X₀ for location n_l3___17
Found invariant X₂ ≤ 15 ∧ 5+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 35 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 30 ∧ 0 ≤ 15+X₂ ∧ 5 ≤ X₁+X₂ ∧ X₁ ≤ 35+X₂ ∧ 0 ≤ 30+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 35+X₀ ∧ X₀+X₁ ≤ 35 ∧ 20 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁ ∧ X₀ ≤ 15 ∧ 0 ≤ 15+X₀ for location n_l6___14
Found invariant X₂ ≤ 15 ∧ X₂ ≤ 16+X₁ ∧ X₁+X₂ ≤ 14 ∧ X₂ ≤ 15+X₀ ∧ X₀+X₂ ≤ 15 ∧ 1 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___7
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 40 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ 40+X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 40 ∧ 20 ≤ X₁ ∧ 36 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 20 ∧ 16 ≤ X₀ for location n_l1___10
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ 40+X₀ ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ 40+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 40+X₀ ∧ X₀+X₁ ≤ 4 ∧ 20 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 36+X₀ ≤ X₁ ∧ 16+X₀ ≤ 0 ∧ 0 ≤ 20+X₀ for location n_l1___13
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 40 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ 40+X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 40 ∧ 20 ≤ X₁ ∧ 36 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 20 ∧ 16 ≤ X₀ for location n_l5___8
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ 40+X₀ ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ 40+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 40+X₀ ∧ X₀+X₁ ≤ 4 ∧ 20 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 36+X₀ ≤ X₁ ∧ 16+X₀ ≤ 0 ∧ 0 ≤ 20+X₀ for location n_l3___12
Found invariant X₂ ≤ 15+X₀ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ 0 ≤ 1+X₁ for location l7
Found invariant 16+X₂ ≤ 0 ∧ 36+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 4 ∧ X₂ ≤ X₀ ∧ 32+X₀+X₂ ≤ 0 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ 40+X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 40+X₀ ∧ X₀+X₁ ≤ 4 ∧ 20 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 36+X₀ ≤ X₁ ∧ 16+X₀ ≤ 0 ∧ 0 ≤ 20+X₀ for location n_l5___15
Found invariant X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ for location n_l1___5
Found invariant X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ for location n_l3___2
Found invariant X₂ ≤ 20 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 40 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 40 ∧ 0 ≤ 20+X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 40+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ 40+X₂ ∧ X₁ ≤ 20 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 40 ∧ 20 ≤ X₁ ∧ 36 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 20 ∧ 16 ≤ X₀ for location n_l3___9
Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ 20 ≤ X₁ for location l1
Found invariant X₂ ≤ 15+X₀ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 20 ∧ 0 ≤ 1+X₁ for location l4
Cut unsatisfiable transition t₁₂₆: n_l6___1→n_l1___6
MPRF for transition t₁₁₂: n_l1___5(X₀, X₁, X₂) → n_l3___2(X₀, X₁, X₂) :|: X₀ ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 6 ≤ X₁ ∧ 1 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ of depth 1:
new bound:
56 {O(1)}
MPRF:
n_l3___2 [34-X₁ ]
n_l6___1 [34-X₁ ]
n_l1___5 [35-X₁ ]
MPRF for transition t₁₁₈: n_l3___2(X₀, X₁, X₂) → n_l6___1(X₀, X₁, X₂) :|: 5+X₀ ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 6 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5+X₀ ≤ X₁ ∧ X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ of depth 1:
new bound:
14 {O(1)}
MPRF:
n_l3___2 [X₀ ]
n_l6___1 [X₀-1 ]
n_l1___5 [X₀ ]
MPRF for transition t₁₂₅: n_l6___1(X₀, X₁, X₂) → n_l1___5(X₀-1, X₁+1, X₂) :|: 5+X₀ ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 6 ≤ X₁ ∧ 1 < X₀ ∧ 5+X₀ ≤ X₁ ∧ X₂ ≤ 15 ∧ 6+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 49 ∧ X₂ ≤ 14+X₀ ∧ X₀+X₂ ≤ 29 ∧ 2 ≤ X₂ ∧ 23 ≤ X₁+X₂ ∧ X₁ ≤ 32+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 34 ∧ X₁ ≤ 33+X₀ ∧ X₀+X₁ ≤ 35 ∧ 21 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 7+X₀ ≤ X₁ ∧ X₀ ≤ 14 ∧ 1 ≤ X₀ of depth 1:
new bound:
56 {O(1)}
MPRF:
n_l3___2 [35-X₁ ]
n_l6___1 [35-X₁ ]
n_l1___5 [35-X₁ ]
CFR did not improve the program. Rolling back
All Bounds
Timebounds
Overall timebound:inf {Infinity}
t₂₆: 1 {O(1)}
t₂₇: inf {Infinity}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: inf {Infinity}
t₃₄: 1 {O(1)}
t₃₅: inf {Infinity}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
Costbounds
Overall costbound: inf {Infinity}
t₂₆: 1 {O(1)}
t₂₇: inf {Infinity}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: inf {Infinity}
t₃₄: 1 {O(1)}
t₃₅: inf {Infinity}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
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₁: 21 {O(1)}
t₂₈, X₂: 2⋅X₂ {O(n)}
t₂₉, X₀: X₂ {O(n)}
t₂₉, X₁: 21 {O(1)}
t₂₉, X₂: 2⋅X₂ {O(n)}
t₃₀, X₀: X₂ {O(n)}
t₃₀, X₁: 20 {O(1)}
t₃₀, X₂: X₂ {O(n)}
t₃₁, X₂: X₂ {O(n)}
t₃₂, X₂: X₂ {O(n)}
t₃₃, X₂: X₂ {O(n)}
t₃₄, X₀: 2⋅X₂ {O(n)}
t₃₄, X₁: 42 {O(1)}
t₃₄, X₂: 4⋅X₂ {O(n)}
t₃₅, X₂: X₂ {O(n)}
t₃₆, X₀: 0 {O(1)}
t₃₆, X₁: 1 {O(1)}
t₃₆, X₂: X₂ {O(n)}
t₃₇, X₂: X₂ {O(n)}
t₃₈, X₂: X₂ {O(n)}