Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₅, X₀, X₃, X₄, X₅, X₆) :|: X₅ ≤ X₀ ∧ 0 < X₅
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < X₅
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₅ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₁, X₂, X₃, X₄, X₅, X₆)
t₇: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ ≤ 0 ∧ 0 ≤ X₁
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ < 0
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₁
t₁₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₁₂: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₂, X₁, X₂, X₃, X₄, X₅, X₆)
t₈: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₁
t₉: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ ≤ 0
t₁₀: l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁-1, X₂-1, X₃, X₄, X₅, X₆)
t₁₁: l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁+1, X₂+1, X₃, X₄, X₅, X₆)
Preprocessing
Eliminate variables {X₃,X₆} that do not contribute to the problem
Found invariant X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l6
Found invariant X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l7
Found invariant X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l5
Found invariant 1 ≤ 0 for location l8
Found invariant X₀ ≤ X₄ for location l1
Found invariant X₀ ≤ X₄ for location l4
Found invariant X₀ ≤ X₄ for location l9
Found invariant X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3
Cut unsatisfiable transition t₃₄: l3→l6
Cut unsatisfiable transition t₄₀: l6→l8
Cut unsatisfiable transition t₄₂: l8→l3
Cut unreachable locations [l8] from the program graph
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l9
Transitions:
t₂₉: l0(X₀, X₁, X₂, X₄, X₅) → l2(X₀, X₁, X₂, X₄, X₅)
t₃₀: l1(X₀, X₁, X₂, X₄, X₅) → l3(X₀, X₅, X₀, X₄, X₅) :|: X₅ ≤ X₀ ∧ 0 < X₅ ∧ X₀ ≤ X₄
t₃₁: l1(X₀, X₁, X₂, X₄, X₅) → l4(X₀, X₁, X₂, X₄, X₅) :|: X₀ < X₅ ∧ X₀ ≤ X₄
t₃₂: l1(X₀, X₁, X₂, X₄, X₅) → l4(X₀, X₁, X₂, X₄, X₅) :|: X₅ ≤ 0 ∧ X₀ ≤ X₄
t₃₃: l2(X₀, X₁, X₂, X₄, X₅) → l1(X₄, X₁, X₂, X₄, X₅)
t₃₆: l3(X₀, X₁, X₂, X₄, X₅) → l5(X₀, X₁, X₂, X₄, X₅) :|: X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₃₅: l3(X₀, X₁, X₂, X₄, X₅) → l6(X₀, X₁, X₂, X₄, X₅) :|: 0 < X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₃₇: l4(X₀, X₁, X₂, X₄, X₅) → l9(X₀, X₁, X₂, X₄, X₅) :|: X₀ ≤ X₄
t₃₈: l5(X₀, X₁, X₂, X₄, X₅) → l1(X₂, X₁, X₂, X₄, X₅) :|: X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₃₉: l6(X₀, X₁, X₂, X₄, X₅) → l7(X₀, X₁, X₂, X₄, X₅) :|: 0 < X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄₁: l7(X₀, X₁, X₂, X₄, X₅) → l3(X₀, X₁-1, X₂-1, X₄, X₅) :|: X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
MPRF for transition t₃₀: l1(X₀, X₁, X₂, X₄, X₅) → l3(X₀, X₅, X₀, X₄, X₅) :|: X₅ ≤ X₀ ∧ 0 < X₅ ∧ X₀ ≤ X₄ of depth 1:
new bound:
X₄+X₅+1 {O(n)}
MPRF:
l5 [X₂+1-X₅ ]
l1 [X₀+1-X₅ ]
l6 [X₂-X₁ ]
l7 [X₂-X₁ ]
l3 [X₂-X₁ ]
MPRF for transition t₃₅: l3(X₀, X₁, X₂, X₄, X₅) → l6(X₀, X₁, X₂, X₄, X₅) :|: 0 < X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
X₄+1 {O(n)}
MPRF:
l5 [X₂+1 ]
l1 [X₀+1 ]
l6 [X₂ ]
l7 [X₂ ]
l3 [X₂+1 ]
MPRF for transition t₃₆: l3(X₀, X₁, X₂, X₄, X₅) → l5(X₀, X₁, X₂, X₄, X₅) :|: X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
X₄+X₅+1 {O(n)}
MPRF:
l5 [X₂ ]
l1 [X₀+1-X₅ ]
l6 [X₂+1-X₁ ]
l7 [X₂+1-X₁ ]
l3 [X₂+1-X₁ ]
MPRF for transition t₃₈: l5(X₀, X₁, X₂, X₄, X₅) → l1(X₂, X₁, X₂, X₄, X₅) :|: X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₂+X₅ ∧ 1 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
2⋅X₄+X₅ {O(n)}
MPRF:
l5 [X₂+X₄+1-X₅ ]
l1 [X₀+X₄-X₅ ]
l6 [X₂+X₄-X₁ ]
l7 [X₂+X₄-X₁ ]
l3 [X₂+X₄-X₁ ]
MPRF for transition t₃₉: l6(X₀, X₁, X₂, X₄, X₅) → l7(X₀, X₁, X₂, X₄, X₅) :|: 0 < X₁ ∧ X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
X₄ {O(n)}
MPRF:
l5 [X₂ ]
l1 [X₀ ]
l6 [X₂ ]
l7 [X₂-1 ]
l3 [X₂ ]
MPRF for transition t₄₁: l7(X₀, X₁, X₂, X₄, X₅) → l3(X₀, X₁-1, X₂-1, X₄, X₅) :|: X₅ ≤ X₄ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
X₄ {O(n)}
MPRF:
l5 [X₂ ]
l1 [X₀ ]
l6 [X₂ ]
l7 [X₂ ]
l3 [X₂ ]
All Bounds
Timebounds
Overall timebound:3⋅X₅+7⋅X₄+8 {O(n)}
t₂₉: 1 {O(1)}
t₃₀: X₄+X₅+1 {O(n)}
t₃₁: 1 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: 1 {O(1)}
t₃₅: X₄+1 {O(n)}
t₃₆: X₄+X₅+1 {O(n)}
t₃₇: 1 {O(1)}
t₃₈: 2⋅X₄+X₅ {O(n)}
t₃₉: X₄ {O(n)}
t₄₁: X₄ {O(n)}
Costbounds
Overall costbound: 3⋅X₅+7⋅X₄+8 {O(n)}
t₂₉: 1 {O(1)}
t₃₀: X₄+X₅+1 {O(n)}
t₃₁: 1 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: 1 {O(1)}
t₃₅: X₄+1 {O(n)}
t₃₆: X₄+X₅+1 {O(n)}
t₃₇: 1 {O(1)}
t₃₈: 2⋅X₄+X₅ {O(n)}
t₃₉: X₄ {O(n)}
t₄₁: X₄ {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₁: 2⋅X₅ {O(n)}
t₃₀, X₂: 2⋅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₂: 2⋅X₄+X₂ {O(n)}
t₃₁, X₄: 2⋅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₄: 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₁: 2⋅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₂: 2⋅X₄ {O(n)}
t₃₆, X₄: X₄ {O(n)}
t₃₆, X₅: X₅ {O(n)}
t₃₇, X₀: 3⋅X₄ {O(n)}
t₃₇, X₁: 2⋅X₁ {O(n)}
t₃₇, X₂: 2⋅X₂+2⋅X₄ {O(n)}
t₃₇, X₄: 3⋅X₄ {O(n)}
t₃₇, X₅: 3⋅X₅ {O(n)}
t₃₈, X₀: X₄ {O(n)}
t₃₈, X₁: 0 {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₁: 2⋅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₁: 2⋅X₅ {O(n)}
t₄₁, X₂: 2⋅X₄ {O(n)}
t₄₁, X₄: X₄ {O(n)}
t₄₁, X₅: X₅ {O(n)}