Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₄
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₁, X₃, X₄, X₅, X₆) :|: X₄ ≤ 0
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₀-1, X₄, X₅, X₆)
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, nondef.0, X₅, X₆)
t₉: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, X₁+1, X₂, X₃, X₄, X₅, X₆)
t₁₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, X₂, X₂, X₃, X₄, X₅, X₆) :|: X₂ ≤ 0
t₁₀: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₂
t₂: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(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₆) → l6(X₅, X₆, X₂, X₃, X₄, X₅, X₆)
t₁₃: l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l10(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₁₂: l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂-1, X₃, X₄, X₅, X₆)

Preprocessing

Found invariant 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₀ for location l2

Found invariant X₀ ≤ X₅ for location l6

Found invariant 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₀ for location l5

Found invariant X₀ ≤ X₅ ∧ X₀ ≤ 0 for location l8

Found invariant 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ for location l1

Found invariant X₀ ≤ X₅ ∧ X₀ ≤ 0 for location l10

Found invariant 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ for location l4

Found invariant 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l9

Found invariant 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₄ ∧ 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₁, X₃, X₄, X₅, X₆) :|: X₄ ≤ 0 ∧ 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₀-1, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, nondef.0, X₅, X₆) :|: 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀
t₉: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, X₁+1, X₂, X₃, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀
t₁₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, X₂, X₂, X₃, X₄, X₅, X₆) :|: X₂ ≤ 0 ∧ 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₀
t₁₀: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₂ ∧ 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₀
t₂: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₀ ∧ X₀ ≤ X₅
t₃: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0 ∧ X₀ ≤ X₅
t₁: l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₅, X₆, X₂, X₃, X₄, X₅, X₆)
t₁₃: l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l10(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ X₅ ∧ X₀ ≤ 0
t₁₂: l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂-1, X₃, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

MPRF for transition t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₄ ∧ 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₀ ]
l1 [X₀ ]
l4 [X₀-1 ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₀ ]
l5 [X₀ ]

MPRF for transition t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₁, X₃, X₄, X₅, X₆) :|: X₄ ≤ 0 ∧ 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₀ ]
l1 [X₀ ]
l4 [X₃ ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₀-1 ]
l5 [X₀-1 ]

MPRF for transition t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₀-1, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₀-1 ]
l1 [X₃ ]
l4 [X₃ ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₃ ]
l5 [X₃ ]

MPRF for transition t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, nondef.0, X₅, X₆) :|: 1 ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₃+1 ]
l1 [X₃ ]
l4 [X₃ ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₀-1 ]
l5 [X₀-1 ]

MPRF for transition t₉: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, X₁+1, X₂, X₃, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₃+1 ]
l1 [X₃+1 ]
l4 [X₃+1 ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₀ ]
l5 [X₀ ]

MPRF for transition t₁₀: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₂ ∧ 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅+X₆+1 {O(n)}

MPRF:

l3 [2⋅X₀+X₁-X₃ ]
l1 [2⋅X₀+X₁-X₃ ]
l4 [2⋅X₀+X₁-X₃ ]
l6 [X₀+X₁+1 ]
l2 [X₀+X₁+1 ]
l9 [X₀+X₂-1 ]
l5 [X₀+X₂ ]

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

new bound:

X₅ {O(n)}

MPRF:

l3 [X₀ ]
l1 [X₀ ]
l4 [X₀ ]
l6 [X₀ ]
l2 [X₀ ]
l9 [X₃+1 ]
l5 [X₃+1 ]

MPRF for transition t₂: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₀ ∧ X₀ ≤ X₅ of depth 1:

new bound:

X₅ {O(n)}

MPRF:

l3 [X₀-1 ]
l1 [X₀-1 ]
l4 [X₃ ]
l6 [X₀ ]
l2 [X₀-1 ]
l9 [X₀-1 ]
l5 [X₀-1 ]

MPRF for transition t₁₂: l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂-1, X₃, X₄, X₅, X₆) :|: 1 ≤ X₅ ∧ 1+X₄ ≤ X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₅+X₆+1 {O(n)}

MPRF:

l3 [X₁+X₃ ]
l1 [X₁+X₃ ]
l4 [X₁+X₃ ]
l6 [X₀+X₁-1 ]
l2 [X₀+X₁-1 ]
l9 [X₀+X₂-1 ]
l5 [X₀+X₂-1 ]

All Bounds

Timebounds

Overall timebound:2⋅X₆+9⋅X₅+6 {O(n)}
t₀: 1 {O(1)}
t₇: X₅ {O(n)}
t₈: X₅ {O(n)}
t₄: X₅ {O(n)}
t₆: X₅ {O(n)}
t₉: X₅ {O(n)}
t₁₀: X₅+X₆+1 {O(n)}
t₁₁: X₅ {O(n)}
t₂: X₅ {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₂: X₅+X₆+1 {O(n)}

Costbounds

Overall costbound: 2⋅X₆+9⋅X₅+6 {O(n)}
t₀: 1 {O(1)}
t₇: X₅ {O(n)}
t₈: X₅ {O(n)}
t₄: X₅ {O(n)}
t₆: X₅ {O(n)}
t₉: X₅ {O(n)}
t₁₀: X₅+X₆+1 {O(n)}
t₁₁: X₅ {O(n)}
t₂: X₅ {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₁₃: 1 {O(1)}
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₄: 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₂: 2⋅X₅+2⋅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₅+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₂: 2⋅X₅+2⋅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₂: 2⋅X₅+2⋅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₂: 2⋅X₅+2⋅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₅+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₂: 2⋅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₅+X₆ {O(n)}
t₂, X₂: 2⋅X₅+2⋅X₆+X₂ {O(n)}
t₂, X₃: 3⋅X₅+X₃ {O(n)}
t₂, X₅: X₅ {O(n)}
t₂, X₆: X₆ {O(n)}
t₃, X₀: 3⋅X₅ {O(n)}
t₃, X₁: 2⋅X₅+3⋅X₆ {O(n)}
t₃, X₂: 2⋅X₂+4⋅X₅+4⋅X₆ {O(n)}
t₃, X₃: 3⋅X₅+X₃ {O(n)}
t₃, X₅: 3⋅X₅ {O(n)}
t₃, X₆: 3⋅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₀: 3⋅X₅ {O(n)}
t₁₃, X₁: 2⋅X₅+3⋅X₆ {O(n)}
t₁₃, X₂: 2⋅X₂+4⋅X₅+4⋅X₆ {O(n)}
t₁₃, X₃: 3⋅X₅+X₃ {O(n)}
t₁₃, X₅: 3⋅X₅ {O(n)}
t₁₃, X₆: 3⋅X₆ {O(n)}
t₁₂, X₀: X₅ {O(n)}
t₁₂, X₁: X₅+X₆ {O(n)}
t₁₂, X₂: X₅+X₆ {O(n)}
t₁₂, X₃: X₅ {O(n)}
t₁₂, X₅: X₅ {O(n)}
t₁₂, X₆: X₆ {O(n)}