Initial Problem

Start: eval_while2_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_while2_0, eval_while2_1, eval_while2_2, eval_while2_3, eval_while2_4, eval_while2_8, eval_while2_9, eval_while2_bb0_in, eval_while2_bb1_in, eval_while2_bb2_in, eval_while2_bb3_in, eval_while2_bb4_in, eval_while2_bb5_in, eval_while2_start, eval_while2_stop
Transitions:
t₂: eval_while2_0(X₀, X₁, X₂, X₃) → eval_while2_1(X₀, X₁, X₂, X₃)
t₃: eval_while2_1(X₀, X₁, X₂, X₃) → eval_while2_2(X₀, X₁, X₂, X₃)
t₄: eval_while2_2(X₀, X₁, X₂, X₃) → eval_while2_3(X₀, X₁, X₂, X₃)
t₅: eval_while2_3(X₀, X₁, X₂, X₃) → eval_while2_4(X₀, X₁, X₂, X₃)
t₆: eval_while2_4(X₀, X₁, X₂, X₃) → eval_while2_bb1_in(X₀, X₁, X₁, X₃)
t₁₃: eval_while2_8(X₀, X₁, X₂, X₃) → eval_while2_9(X₀, X₁, X₂, X₃)
t₁₄: eval_while2_9(X₀, X₁, X₂, X₃) → eval_while2_bb1_in(X₀, X₁, X₀, X₃)
t₁: eval_while2_bb0_in(X₀, X₁, X₂, X₃) → eval_while2_0(X₀, X₁, X₂, X₃)
t₇: eval_while2_bb1_in(X₀, X₁, X₂, X₃) → eval_while2_bb2_in(X₀, X₁, X₂, X₁) :|: 1 ≤ X₂
t₈: eval_while2_bb1_in(X₀, X₁, X₂, X₃) → eval_while2_bb5_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₉: eval_while2_bb2_in(X₀, X₁, X₂, X₃) → eval_while2_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₃
t₁₀: eval_while2_bb2_in(X₀, X₁, X₂, X₃) → eval_while2_bb4_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0
t₁₁: eval_while2_bb3_in(X₀, X₁, X₂, X₃) → eval_while2_bb2_in(X₀, X₁, X₂, X₃-1)
t₁₂: eval_while2_bb4_in(X₀, X₁, X₂, X₃) → eval_while2_8(X₂-1, X₁, X₂, X₃)
t₁₅: eval_while2_bb5_in(X₀, X₁, X₂, X₃) → eval_while2_stop(X₀, X₁, X₂, X₃)
t₀: eval_while2_start(X₀, X₁, X₂, X₃) → eval_while2_bb0_in(X₀, X₁, X₂, X₃)

Preprocessing

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb3_in

Found invariant X₂ ≤ X₁ for location eval_while2_bb1_in

Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb2_in

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ for location eval_while2_bb5_in

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb4_in

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ 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₀ for location eval_while2_8

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ 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₀ for location eval_while2_9

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ for location eval_while2_stop

Problem after Preprocessing

Start: eval_while2_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_while2_0, eval_while2_1, eval_while2_2, eval_while2_3, eval_while2_4, eval_while2_8, eval_while2_9, eval_while2_bb0_in, eval_while2_bb1_in, eval_while2_bb2_in, eval_while2_bb3_in, eval_while2_bb4_in, eval_while2_bb5_in, eval_while2_start, eval_while2_stop
Transitions:
t₂: eval_while2_0(X₀, X₁, X₂, X₃) → eval_while2_1(X₀, X₁, X₂, X₃)
t₃: eval_while2_1(X₀, X₁, X₂, X₃) → eval_while2_2(X₀, X₁, X₂, X₃)
t₄: eval_while2_2(X₀, X₁, X₂, X₃) → eval_while2_3(X₀, X₁, X₂, X₃)
t₅: eval_while2_3(X₀, X₁, X₂, X₃) → eval_while2_4(X₀, X₁, X₂, X₃)
t₆: eval_while2_4(X₀, X₁, X₂, X₃) → eval_while2_bb1_in(X₀, X₁, X₁, X₃)
t₁₃: eval_while2_8(X₀, X₁, X₂, X₃) → eval_while2_9(X₀, X₁, X₂, X₃) :|: X₂ ≤ 1+X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₃ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0
t₁₄: eval_while2_9(X₀, X₁, X₂, X₃) → eval_while2_bb1_in(X₀, X₁, X₀, X₃) :|: X₂ ≤ 1+X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₃ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0
t₁: eval_while2_bb0_in(X₀, X₁, X₂, X₃) → eval_while2_0(X₀, X₁, X₂, X₃)
t₇: eval_while2_bb1_in(X₀, X₁, X₂, X₃) → eval_while2_bb2_in(X₀, X₁, X₂, X₁) :|: 1 ≤ X₂ ∧ X₂ ≤ X₁
t₈: eval_while2_bb1_in(X₀, X₁, X₂, X₃) → eval_while2_bb5_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ X₂ ≤ X₁
t₉: eval_while2_bb2_in(X₀, X₁, X₂, X₃) → eval_while2_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃
t₁₀: eval_while2_bb2_in(X₀, X₁, X₂, X₃) → eval_while2_bb4_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0 ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃
t₁₁: eval_while2_bb3_in(X₀, X₁, X₂, X₃) → eval_while2_bb2_in(X₀, X₁, X₂, X₃-1) :|: 1 ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₁ ∧ X₃ ≤ X₁
t₁₂: eval_while2_bb4_in(X₀, X₁, X₂, X₃) → eval_while2_8(X₂-1, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0
t₁₅: eval_while2_bb5_in(X₀, X₁, X₂, X₃) → eval_while2_stop(X₀, X₁, X₂, X₃) :|: X₂ ≤ X₁ ∧ X₂ ≤ 0
t₀: eval_while2_start(X₀, X₁, X₂, X₃) → eval_while2_bb0_in(X₀, X₁, X₂, X₃)

MPRF for transition t₇: eval_while2_bb1_in(X₀, X₁, X₂, X₃) → eval_while2_bb2_in(X₀, X₁, X₂, X₁) :|: 1 ≤ X₂ ∧ X₂ ≤ X₁ of depth 1:

new bound:

X₁ {O(n)}

• eval_while2_8: [X₀]
• eval_while2_9: [X₀]
• eval_while2_bb1_in: [X₂]
• eval_while2_bb2_in: [X₂-1]
• eval_while2_bb3_in: [X₂-1]
• eval_while2_bb4_in: [X₂-1]

MPRF for transition t₁₀: eval_while2_bb2_in(X₀, X₁, X₂, X₃) → eval_while2_bb4_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0 ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₁ {O(n)}

• eval_while2_8: [X₀]
• eval_while2_9: [X₀]
• eval_while2_bb1_in: [X₂]
• eval_while2_bb2_in: [X₂]
• eval_while2_bb3_in: [X₂]
• eval_while2_bb4_in: [X₂-1]

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

new bound:

X₁ {O(n)}

• eval_while2_8: [X₀]
• eval_while2_9: [X₀]
• eval_while2_bb1_in: [X₂]
• eval_while2_bb2_in: [X₂]
• eval_while2_bb3_in: [X₂]
• eval_while2_bb4_in: [X₂+X₃]

MPRF for transition t₁₃: eval_while2_8(X₀, X₁, X₂, X₃) → eval_while2_9(X₀, X₁, X₂, X₃) :|: X₂ ≤ 1+X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₃ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0 of depth 1:

new bound:

X₁+1 {O(n)}

• eval_while2_8: [1+X₂]
• eval_while2_9: [X₂]
• eval_while2_bb1_in: [1+X₂]
• eval_while2_bb2_in: [1+X₂]
• eval_while2_bb3_in: [1+X₂]
• eval_while2_bb4_in: [1+X₂]

MPRF for transition t₁₄: eval_while2_9(X₀, X₁, X₂, X₃) → eval_while2_bb1_in(X₀, X₁, X₀, X₃) :|: X₂ ≤ 1+X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₃ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0 of depth 1:

new bound:

X₁ {O(n)}

• eval_while2_8: [X₂]
• eval_while2_9: [X₂-X₃]
• eval_while2_bb1_in: [X₂]
• eval_while2_bb2_in: [X₂]
• eval_while2_bb3_in: [X₂]
• eval_while2_bb4_in: [X₂]

TWN: t₁₁: eval_while2_bb3_in→eval_while2_bb2_in

Show Graph

Termination: true
Formula:

TWN - Lifting for [9: eval_while2_bb2_in->eval_while2_bb3_in; 11: eval_while2_bb3_in->eval_while2_bb2_in] of 12⋅X₃+4⋅X₁+4⋅X₂+20 {O(n)}

Cut unsatisfiable transition [t₁₀: eval_while2_bb2_in→eval_while2_bb4_in; t₈₀: eval_while2_bb2_in→eval_while2_bb4_in]

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb3_in_v1

Found invariant X₂ ≤ X₁ for location eval_while2_bb1_in

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ for location eval_while2_bb5_in

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ for location eval_while2_stop

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb2_in_v1

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb2_in

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location eval_while2_bb4_in

Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₁ for location eval_while2_bb3_in_v2

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ 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₀ for location eval_while2_8

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ 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₀ for location eval_while2_9

All Bounds

Timebounds

Overall timebound:64⋅X₁⋅X₁+45⋅X₁+10 {O(n^2)}
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)}
t₇: X₁ {O(n)}
t₈: 1 {O(1)}
t₉: 32⋅X₁⋅X₁+20⋅X₁ {O(n^2)}
t₁₀: X₁ {O(n)}
t₁₁: 32⋅X₁⋅X₁+20⋅X₁ {O(n^2)}
t₁₂: X₁ {O(n)}
t₁₃: X₁+1 {O(n)}
t₁₄: X₁ {O(n)}
t₁₅: 1 {O(1)}

Costbounds

Overall costbound: 64⋅X₁⋅X₁+45⋅X₁+10 {O(n^2)}
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)}
t₇: X₁ {O(n)}
t₈: 1 {O(1)}
t₉: 32⋅X₁⋅X₁+20⋅X₁ {O(n^2)}
t₁₀: X₁ {O(n)}
t₁₁: 32⋅X₁⋅X₁+20⋅X₁ {O(n^2)}
t₁₂: X₁ {O(n)}
t₁₃: X₁+1 {O(n)}
t₁₄: X₁ {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₀ {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₀+X₁ {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₂: X₁ {O(n)}
t₇, X₃: 2⋅X₁ {O(n)}
t₈, X₀: X₀+X₁ {O(n)}
t₈, X₁: 2⋅X₁ {O(n)}
t₈, X₂: 2⋅X₁ {O(n)}
t₈, X₃: X₃ {O(n)}
t₉, X₀: X₀+X₁ {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: X₁ {O(n)}
t₉, X₃: 2⋅X₁ {O(n)}
t₁₀, X₀: X₀+X₁ {O(n)}
t₁₀, X₁: X₁ {O(n)}
t₁₀, X₂: X₁ {O(n)}
t₁₀, X₃: 0 {O(1)}
t₁₁, X₀: X₀+X₁ {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₁, X₂: X₁ {O(n)}
t₁₁, X₃: 2⋅X₁ {O(n)}
t₁₂, X₀: X₁ {O(n)}
t₁₂, X₁: X₁ {O(n)}
t₁₂, X₂: X₁ {O(n)}
t₁₂, X₃: 0 {O(1)}
t₁₃, X₀: X₁ {O(n)}
t₁₃, X₁: X₁ {O(n)}
t₁₃, X₂: X₁ {O(n)}
t₁₃, X₃: 0 {O(1)}
t₁₄, X₀: X₁ {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₄, X₂: X₁ {O(n)}
t₁₄, X₃: 0 {O(1)}
t₁₅, X₀: X₀+X₁ {O(n)}
t₁₅, X₁: 2⋅X₁ {O(n)}
t₁₅, X₂: 2⋅X₁ {O(n)}
t₁₅, X₃: X₃ {O(n)}