Initial Problem

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

Preprocessing

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l2

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l6

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l7

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l5

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

Found invariant X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 3 ≤ X₂ for location l1

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

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l4

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

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location l3

Cut unsatisfiable transition t₁₇: l9→l3

Cut unsatisfiable transition t₁₉: l9→l3

Problem after Preprocessing

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

Analysing control-flow refined program

Cut unsatisfiable transition t₄: l1→l11

Found invariant X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l5___17

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

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

Found invariant X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l7___18

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

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

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ X₃ ≤ 0 ∧ 3+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l4___9

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l2___5

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

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

Found invariant X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l2___16

Found invariant X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l6___19

Found invariant X₄ ≤ X₂ ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 5 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l1___13

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l5___6

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

Found invariant X₄ ≤ X₃ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₂ for location n_l3___20

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

Found invariant X₄ ≤ 1 ∧ 2+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ 3 ≤ X₂ for location l1

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

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

Found invariant 1+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 4 ≤ X₂+X₄ ∧ 0 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l3___10

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₁₆: 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}
t₂₀: inf {Infinity}
t₁₁: inf {Infinity}
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₁₆: 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}
t₂₀: inf {Infinity}
t₁₁: inf {Infinity}
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₂: 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₄: 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₂: X₂ {O(n)}
t₆, X₃: 0 {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)}