Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2, l3
Transitions:
t₄: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₃: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₁ ≤ 20
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 21 ≤ X₁
t₁: l3(X₀, X₁, X₂) → l1(X₀, X₁-1, X₂) :|: X₀ ≤ 30
t₀: l3(X₀, X₁, X₂) → l3(X₀-1, X₁, X₂) :|: 31 ≤ X₀

Preprocessing

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

Found invariant X₁ ≤ 20 for location l2

Found invariant 21 ≤ X₁ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₁: l0(X₀, X₁) → l1(X₀, X₁)
t₁₃: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 20
t₁₂: l1(X₀, X₁) → l3(X₀, X₁) :|: 21 ≤ X₁
t₁₅: l3(X₀, X₁) → l1(X₀, X₁-1) :|: X₀ ≤ 30 ∧ 21 ≤ X₁
t₁₄: l3(X₀, X₁) → l3(X₀-1, X₁) :|: 31 ≤ X₀ ∧ 21 ≤ X₁

Analysing control-flow refined program

Found invariant X₁ ≤ 20 for location l2

Found invariant 21 ≤ X₁ for location n_l3___4

Found invariant 20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 for location n_l1___3

Found invariant 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀ for location n_l3___2

Found invariant 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30 for location n_l3___1

Found invariant X₁ ≤ 20 for location l2

Found invariant 21 ≤ X₁ for location n_l3___4

Found invariant 20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 for location n_l1___3

Found invariant 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀ for location n_l3___2

Found invariant 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30 for location n_l3___1

Time-Bound by TWN-Loops:

TWN-Loops: t₉₇ 4⋅X₀+7 {O(n)}

TWN-Loops:

entry: t₉₉: n_l3___4(X₀, X₁) → n_l3___2(X₀-1, X₁) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 31 ≤ X₀ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁
results in twn-loop: twn:Inv: [21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀] , (X₀,X₁) -> (X₀-1,X₁) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ 31 ≤ X₀ ∧ 21 ≤ X₁
order: [X₀; X₁]
closed-form:
X₀: X₀ + [[n != 0]] * -1 * n^1
X₁: X₁

Termination: true
Formula:

21 < X₁ ∧ 1 < 0
∨ 21 < X₁ ∧ 1 < 0 ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 < X₁ ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30
∨ 21 < X₁ ∧ 31 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ 21 < X₁ ∧ 31 < X₀ ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 < X₁ ∧ 31 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30
∨ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 1 < 0
∨ 21 < X₁ ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 < X₁ ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0 ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 31 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 31 < X₀ ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 31 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 1 < 0
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 30 < X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 31 ≤ X₀ ∧ X₀ ≤ 31 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 30 ≤ X₀ ∧ X₀ ≤ 30

Stabilization-Threshold for: 31 ≤ X₀
alphas_abs: X₀
M: 0
N: 1
Bound: 2⋅X₀+2 {O(n)}
Stabilization-Threshold for: 30 ≤ X₀
alphas_abs: X₀
M: 0
N: 1
Bound: 2⋅X₀+2 {O(n)}

relevant size-bounds w.r.t. t₉₉:
X₀: X₀ {O(n)}
Runtime-bound of t₉₉: 1 {O(1)}
Results in: 4⋅X₀+7 {O(n)}

4⋅X₀+7 {O(n)}

Found invariant X₁ ≤ 20 for location l2

Found invariant 21 ≤ X₁ for location n_l3___4

Found invariant 20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 for location n_l1___3

Found invariant 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀ for location n_l3___2

Found invariant 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30 for location n_l3___1

Found invariant X₁ ≤ 20 for location l2

Found invariant 21 ≤ X₁ for location n_l3___4

Found invariant 20 ≤ X₁ ∧ 50 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 ∧ 30 ≤ X₀ for location n_l1___3

Found invariant 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀ for location n_l3___2

Found invariant 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30 ∧ 30 ≤ X₀ for location n_l3___1

Time-Bound by TWN-Loops:

TWN-Loops: t₉₃ 12⋅X₁+96 {O(n)}

TWN-Loops:

entry: t₉₈: n_l3___4(X₀, X₁) → n_l1___3(X₀, X₁-1) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁
results in twn-loop: twn:Inv: [20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30] , (X₀,X₁) -> (X₀,X₁-1) :|: X₀ ≤ 30 ∧ 20 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 30
entry: t₉₆: n_l3___2(X₀, X₁) → n_l1___3(X₀, X₁-1) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀
results in twn-loop: twn:Inv: [20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30] , (X₀,X₁) -> (X₀,X₁-1) :|: X₀ ≤ 30 ∧ 20 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 30
order: [X₀; X₁]
closed-form:
X₀: X₀
X₁: X₁ + [[n != 0]] * -1 * n^1

Termination: true
Formula:

X₀ < 30 ∧ 1 < 0
∨ X₀ < 30 ∧ 1 < 0 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ < 30 ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ X₀ < 30 ∧ 21 < X₁ ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ < 30 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0
∨ X₀ < 30 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20

Stabilization-Threshold for: 21 ≤ X₁
alphas_abs: X₁
M: 0
N: 1
Bound: 2⋅X₁+2 {O(n)}
Stabilization-Threshold for: 20 ≤ X₁
alphas_abs: X₁
M: 0
N: 1
Bound: 2⋅X₁+2 {O(n)}

relevant size-bounds w.r.t. t₉₈:
X₁: X₁ {O(n)}
Runtime-bound of t₉₈: 1 {O(1)}
Results in: 4⋅X₁+7 {O(n)}

order: [X₀; X₁]
closed-form:
X₀: X₀
X₁: X₁ + [[n != 0]] * -1 * n^1

Termination: true
Formula:

X₀ < 30 ∧ 1 < 0
∨ X₀ < 30 ∧ 1 < 0 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ < 30 ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ X₀ < 30 ∧ 21 < X₁ ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ < 30 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0
∨ X₀ < 30 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ < 30 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 < 0 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 < 0
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 20 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1
∨ X₀ ≤ 30 ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ X₁ ≤ 21 ∧ 1 ≤ 0 ∧ 0 ≤ 1 ∧ 20 ≤ X₁ ∧ X₁ ≤ 20

Stabilization-Threshold for: 21 ≤ X₁
alphas_abs: 21+X₁
M: 0
N: 1
Bound: 2⋅X₁+44 {O(n)}
Stabilization-Threshold for: 20 ≤ X₁
alphas_abs: 20+X₁
M: 0
N: 1
Bound: 2⋅X₁+42 {O(n)}

relevant size-bounds w.r.t. t₉₆:
X₁: 2⋅X₁ {O(n)}
Runtime-bound of t₉₆: 1 {O(1)}
Results in: 8⋅X₁+89 {O(n)}

12⋅X₁+96 {O(n)}

Time-Bound by TWN-Loops:

TWN-Loops: t₉₅ 12⋅X₁+96 {O(n)}

relevant size-bounds w.r.t. t₉₈:
X₁: X₁ {O(n)}
Runtime-bound of t₉₈: 1 {O(1)}
Results in: 4⋅X₁+7 {O(n)}

relevant size-bounds w.r.t. t₉₆:
X₁: 2⋅X₁ {O(n)}
Runtime-bound of t₉₆: 1 {O(1)}
Results in: 8⋅X₁+89 {O(n)}

12⋅X₁+96 {O(n)}

CFR: Improvement to new bound with the following program:

new bound:

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

cfr-program:

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, n_l1___3, n_l3___1, n_l3___2, n_l3___4
Transitions:
t₁₁: l0(X₀, X₁) → l1(X₀, X₁)
t₁₃: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 20
t₉₄: l1(X₀, X₁) → n_l3___4(X₀, X₁) :|: 21 ≤ X₁
t₁₀₆: n_l1___3(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 20 ∧ 20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30
t₉₃: n_l1___3(X₀, X₁) → n_l3___1(X₀, X₁) :|: X₀ ≤ 30 ∧ 20 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 20 ≤ X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 30
t₉₅: n_l3___1(X₀, X₁) → n_l1___3(X₀, X₁-1) :|: X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 30
t₉₆: n_l3___2(X₀, X₁) → n_l1___3(X₀, X₁-1) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀
t₉₇: n_l3___2(X₀, X₁) → n_l3___2(X₀-1, X₁) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 30 ≤ X₀ ∧ 21 ≤ X₁ ∧ 31 ≤ X₀ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 51 ≤ X₀+X₁ ∧ 30 ≤ X₀
t₉₈: n_l3___4(X₀, X₁) → n_l1___3(X₀, X₁-1) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ X₀ ≤ 30 ∧ 21 ≤ X₁
t₉₉: n_l3___4(X₀, X₁) → n_l3___2(X₀-1, X₁) :|: 21 ≤ X₁ ∧ 21 ≤ X₁ ∧ 31 ≤ X₀ ∧ 21 ≤ X₁ ∧ 21 ≤ X₁

All Bounds

Timebounds

Overall timebound:24⋅X₁+4⋅X₀+206 {O(n)}
t₁₁: 1 {O(1)}
t₁₃: 1 {O(1)}
t₉₄: 1 {O(1)}
t₉₃: 12⋅X₁+96 {O(n)}
t₁₀₆: 1 {O(1)}
t₉₅: 12⋅X₁+96 {O(n)}
t₉₆: 1 {O(1)}
t₉₇: 4⋅X₀+7 {O(n)}
t₉₈: 1 {O(1)}
t₉₉: 1 {O(1)}

Costbounds

Overall costbound: 24⋅X₁+4⋅X₀+206 {O(n)}
t₁₁: 1 {O(1)}
t₁₃: 1 {O(1)}
t₉₄: 1 {O(1)}
t₉₃: 12⋅X₁+96 {O(n)}
t₁₀₆: 1 {O(1)}
t₉₅: 12⋅X₁+96 {O(n)}
t₉₆: 1 {O(1)}
t₉₇: 4⋅X₀+7 {O(n)}
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₁ {O(n)}
t₉₃, X₀: X₀+30 {O(n)}
t₉₃, X₁: 3⋅X₁ {O(n)}
t₁₀₆, X₀: 2⋅X₀+60 {O(n)}
t₁₀₆, X₁: 20 {O(1)}
t₉₅, X₀: X₀+30 {O(n)}
t₉₅, X₁: 3⋅X₁ {O(n)}
t₉₆, X₀: 30 {O(1)}
t₉₆, X₁: 2⋅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)}