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₃) → l6(X₀, X₁, X₂, X₃)
t₇: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃+X₀)
t₈: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃-X₀)
t₃: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₁
t₄: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+1 ≤ X₃
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂
t₆: l4(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₉: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₁: l6(X₀, X₁, X₂, X₃) → l3(1, X₂, X₀, X₁) :|: 1 ≤ X₀
t₂: l6(X₀, X₁, X₂, X₃) → l3(-1, X₂, X₀, X₁) :|: X₀ ≤ 0
Preprocessing
Found invariant X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ X₀+X₂ ≤ 1 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l2
Found invariant 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l7
Found invariant 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l5
Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l1
Found invariant X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l4
Found invariant X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l3
Problem after Preprocessing
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₃) → l6(X₀, X₁, X₂, X₃)
t₇: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃+X₀) :|: X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₈: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃-X₀) :|: X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ X₀+X₂ ≤ 1 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₃: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₄: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+1 ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₆: l4(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₉: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₁: l6(X₀, X₁, X₂, X₃) → l3(1, X₂, X₀, X₁) :|: 1 ≤ X₀
t₂: l6(X₀, X₁, X₂, X₃) → l3(-1, X₂, X₀, X₁) :|: X₀ ≤ 0
Analysing control-flow refined program
Found invariant X₃ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l3___4
Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l4___6
Found invariant X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l4___3
Found invariant X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l2___2
Found invariant 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l7
Found invariant 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l5
Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l1___5
Found invariant X₃ ≤ 1+X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l3___1
Found invariant X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l3
MPRF for transition t₂₇₈: n_l2___2(X₀, X₁, X₂, X₃) → n_l3___1(X₀, X₁, X₂, X₃-X₀) :|: X₂ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₀+1 ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
X₁+X₂+1 {O(n)}
MPRF:
n_l3___1 [X₁-X₀-X₃ ]
n_l4___3 [X₁+1-X₃ ]
n_l2___2 [X₁+1-X₃ ]
MPRF for transition t₂₇₉: n_l3___1(X₀, X₁, X₂, X₃) → n_l4___3(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₀+X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₃ ≤ 1+X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
X₁+X₂ {O(n)}
MPRF:
n_l3___1 [X₁+1-X₃ ]
n_l4___3 [X₁-X₃ ]
n_l2___2 [X₀+X₁+1-X₃ ]
MPRF for transition t₂₈₃: n_l4___3(X₀, X₁, X₂, X₃) → n_l2___2(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₀+1 ≤ 0 ∧ 0 ≤ 1+X₀ ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ of depth 1:
new bound:
X₁+X₂+1 {O(n)}
MPRF:
n_l3___1 [X₁-X₀-X₃ ]
n_l4___3 [X₁+1-X₃ ]
n_l2___2 [X₁-X₃ ]
MPRF for transition t₂₇₇: n_l1___5(X₀, X₁, X₂, X₃) → n_l3___4(X₀, X₁, X₂, X₀+X₃) :|: 1 ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ of depth 1:
new bound:
X₁+X₂+1 {O(n)}
MPRF:
n_l3___4 [X₀+X₁-X₃ ]
n_l4___6 [X₁+1-X₃ ]
n_l1___5 [X₁+1-X₃ ]
MPRF for transition t₂₈₀: n_l3___4(X₀, X₁, X₂, X₃) → n_l4___6(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₃ ≤ X₀+X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ of depth 1:
new bound:
X₁+X₂+1 {O(n)}
MPRF:
n_l3___4 [X₁+2-X₃ ]
n_l4___6 [X₁+1-X₃ ]
n_l1___5 [X₁+2-X₀-X₃ ]
MPRF for transition t₂₈₄: n_l4___6(X₀, X₁, X₂, X₃) → n_l1___5(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ of depth 1:
new bound:
X₁+X₂+1 {O(n)}
MPRF:
n_l3___4 [X₀+X₁-X₃ ]
n_l4___6 [X₁+1-X₃ ]
n_l1___5 [X₁-X₃ ]
CFR: Improvement to new bound with the following program:
new bound:
6⋅X₁+6⋅X₂+5 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l3, l5, l6, l7, n_l1___5, n_l2___2, n_l3___1, n_l3___4, n_l4___3, n_l4___6
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+1 ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₂₈₁: l3(X₀, X₁, X₂, X₃) → n_l4___3(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₂₈₂: l3(X₀, X₁, X₂, X₃) → n_l4___6(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₉: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀
t₁: l6(X₀, X₁, X₂, X₃) → l3(1, X₂, X₀, X₁) :|: 1 ≤ X₀
t₂: l6(X₀, X₁, X₂, X₃) → l3(-1, X₂, X₀, X₁) :|: X₀ ≤ 0
t₂₇₇: n_l1___5(X₀, X₁, X₂, X₃) → n_l3___4(X₀, X₁, X₂, X₀+X₃) :|: 1 ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₂₇₈: n_l2___2(X₀, X₁, X₂, X₃) → n_l3___1(X₀, X₁, X₂, X₃-X₀) :|: X₂ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₀+1 ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₂₉₃: n_l3___1(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+1 ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ 1+X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₂₇₉: n_l3___1(X₀, X₁, X₂, X₃) → n_l4___3(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ 1+X₀ ∧ X₀+X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₃ ≤ 1+X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₂₉₄: n_l3___4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁+1 ≤ X₃ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₂₈₀: n_l3___4(X₀, X₁, X₂, X₃) → n_l4___6(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ X₃ ≤ X₀+X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₂₈₃: n_l4___3(X₀, X₁, X₂, X₃) → n_l2___2(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₀+1 ≤ 0 ∧ 0 ≤ 1+X₀ ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ X₂ ≤ 0 ∧ X₂ ≤ 1+X₀ ∧ 1+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀
t₂₈₄: n_l4___6(X₀, X₁, X₂, X₃) → n_l1___5(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 0 ≤ 1+X₀ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ X₀ ≤ 1 ∧ X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
All Bounds
Timebounds
Overall timebound:6⋅X₁+6⋅X₂+14 {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)}
t₂₇₇: X₁+X₂+1 {O(n)}
t₂₇₈: X₁+X₂+1 {O(n)}
t₂₇₉: X₁+X₂ {O(n)}
t₂₉₃: 1 {O(1)}
t₂₈₀: X₁+X₂+1 {O(n)}
t₂₉₄: 1 {O(1)}
t₂₈₃: X₁+X₂+1 {O(n)}
t₂₈₄: X₁+X₂+1 {O(n)}
Costbounds
Overall costbound: 6⋅X₁+6⋅X₂+14 {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)}
t₂₇₇: X₁+X₂+1 {O(n)}
t₂₇₈: X₁+X₂+1 {O(n)}
t₂₇₉: X₁+X₂ {O(n)}
t₂₉₃: 1 {O(1)}
t₂₈₀: X₁+X₂+1 {O(n)}
t₂₉₄: 1 {O(1)}
t₂₈₃: X₁+X₂+1 {O(n)}
t₂₈₄: X₁+X₂+1 {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₀: 1 {O(1)}
t₄, X₁: 2⋅X₂ {O(n)}
t₄, X₂: 2⋅X₀ {O(n)}
t₄, X₃: 2⋅X₁ {O(n)}
t₂₈₁, X₀: 1 {O(1)}
t₂₈₁, X₁: X₂ {O(n)}
t₂₈₁, X₂: X₀ {O(n)}
t₂₈₁, X₃: X₁ {O(n)}
t₂₈₂, X₀: 1 {O(1)}
t₂₈₂, X₁: X₂ {O(n)}
t₂₈₂, X₂: X₀ {O(n)}
t₂₈₂, X₃: X₁ {O(n)}
t₉, X₀: 1 {O(1)}
t₉, X₁: 4⋅X₂ {O(n)}
t₉, X₂: 4⋅X₀ {O(n)}
t₉, X₃: 2⋅X₂+6⋅X₁+2 {O(n)}
t₁, X₀: 1 {O(1)}
t₁, X₁: X₂ {O(n)}
t₁, X₂: X₀ {O(n)}
t₁, X₃: X₁ {O(n)}
t₂, X₀: 1 {O(1)}
t₂, X₁: X₂ {O(n)}
t₂, X₂: X₀ {O(n)}
t₂, X₃: X₁ {O(n)}
t₂₇₇, X₀: 1 {O(1)}
t₂₇₇, X₁: X₂ {O(n)}
t₂₇₇, X₂: X₀ {O(n)}
t₂₇₇, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₇₈, X₀: 1 {O(1)}
t₂₇₈, X₁: X₂ {O(n)}
t₂₇₈, X₂: X₀ {O(n)}
t₂₇₈, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₇₉, X₀: 1 {O(1)}
t₂₇₉, X₁: X₂ {O(n)}
t₂₇₉, X₂: X₀ {O(n)}
t₂₇₉, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₉₃, X₀: 1 {O(1)}
t₂₉₃, X₁: X₂ {O(n)}
t₂₉₃, X₂: X₀ {O(n)}
t₂₉₃, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₈₀, X₀: 1 {O(1)}
t₂₈₀, X₁: X₂ {O(n)}
t₂₈₀, X₂: X₀ {O(n)}
t₂₈₀, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₉₄, X₀: 1 {O(1)}
t₂₉₄, X₁: X₂ {O(n)}
t₂₉₄, X₂: X₀ {O(n)}
t₂₉₄, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₈₃, X₀: 1 {O(1)}
t₂₈₃, X₁: X₂ {O(n)}
t₂₈₃, X₂: X₀ {O(n)}
t₂₈₃, X₃: 2⋅X₁+X₂+1 {O(n)}
t₂₈₄, X₀: 1 {O(1)}
t₂₈₄, X₁: X₂ {O(n)}
t₂₈₄, X₂: X₀ {O(n)}
t₂₈₄, X₃: 2⋅X₁+X₂+1 {O(n)}