Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6
Transitions:
t₈: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l2(X₀, X₀, X₃, X₃, X₅, X₅, X₇, X₇)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l5(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₂, X₇) :|: X₂+1 ≤ X₀ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₀: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂ ∧ X₄ ≤ X₅ ∧ X₅ ≤ X₄ ∧ X₆ ≤ X₇ ∧ X₇ ≤ X₆
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, 1, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₆ ≤ X₇ ∧ X₇ ≤ X₆ ∧ X₄ ≤ X₅ ∧ X₅ ≤ X₄ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l4(X₀, X₁, X₂, X₃, X₄-1, X₅, X₆, X₇) :|: X₂+1 ≤ X₄ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₄ ∧ X₂+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₇: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l5(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₆, X₇) :|: X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ 1 ≤ X₄ ∧ X₄+1 ≤ X₆ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₄: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, 1+X₂, X₃, X₄, X₅, X₆, X₇) :|: X₂+1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₆ ≤ X₀+1 ∧ X₀+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₅: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l4(X₀, X₁, X₂, X₃, X₁, X₅, X₆, X₇) :|: X₆ ≤ X₀ ∧ X₆ ≤ X₀+1 ∧ X₂+1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁

Preprocessing

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l2

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l6

Found invariant X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location l5

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l1

Found invariant X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location l4

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6
Transitions:
t₈: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l2(X₀, X₀, X₃, X₃, X₅, X₅, X₇, X₇)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l5(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₂, X₇) :|: X₂+1 ≤ X₀ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₀: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂ ∧ X₄ ≤ X₅ ∧ X₅ ≤ X₄ ∧ X₆ ≤ X₇ ∧ X₇ ≤ X₆ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, 1, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₆ ≤ X₇ ∧ X₇ ≤ X₆ ∧ X₄ ≤ X₅ ∧ X₅ ≤ X₄ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l4(X₀, X₁, X₂, X₃, X₄-1, X₅, X₆, X₇) :|: X₂+1 ≤ X₄ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₄ ∧ X₂+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀
t₇: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l5(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₆, X₇) :|: X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ 1 ≤ X₄ ∧ X₄+1 ≤ X₆ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀
t₄: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, 1+X₂, X₃, X₄, X₅, X₆, X₇) :|: X₂+1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₆ ≤ X₀+1 ∧ X₀+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀
t₅: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l4(X₀, X₁, X₂, X₃, X₁, X₅, X₆, X₇) :|: X₆ ≤ X₀ ∧ X₆ ≤ X₀+1 ∧ X₂+1 ≤ X₀ ∧ 1 ≤ X₂ ∧ X₂+1 ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀

Analysing control-flow refined program

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l2

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l6

Found invariant X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l4___3

Found invariant X₆ ≤ 1+X₂ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l5___5

Found invariant X₆ ≤ X₄ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 4 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l4___4

Found invariant X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 3 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ 2+X₄ ≤ X₆ ∧ 4 ≤ X₂+X₆ ∧ 2+X₂ ≤ X₆ ∧ 5 ≤ X₁+X₆ ∧ 5 ≤ X₀+X₆ ∧ X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l5___2

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l1

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l3

Found invariant X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 3 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ 2+X₄ ≤ X₆ ∧ 5 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 5 ≤ X₁+X₆ ∧ 1+X₁ ≤ X₆ ∧ 5 ≤ X₀+X₆ ∧ 1+X₀ ≤ X₆ ∧ 1+X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ X₂ ≤ 1+X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₄: inf {Infinity}
t₅: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₄: inf {Infinity}
t₅: inf {Infinity}

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₄: 2⋅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₃: 2⋅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₂: 1 {O(1)}
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₅: 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₅: 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₅: 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₅: X₅ {O(n)}
t₅, X₇: X₇ {O(n)}