KoAT2 Proof Output

Initial Problem

Preprocessing

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb2in

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb4in

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb5in

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb3in

Problem after Preprocessing

Start: evalspeedpldi3start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: evalspeedpldi3bb2in, evalspeedpldi3bb3in, evalspeedpldi3bb4in, evalspeedpldi3bb5in, evalspeedpldi3entryin, evalspeedpldi3returnin, evalspeedpldi3start, evalspeedpldi3stop
Transitions:
t₆: evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb3in(X₀, X₁, X₂, X₃) :|: 1+X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₇: evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb4in(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₈: evalspeedpldi3bb3in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb5in(X₀, X₁, 1+X₂, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2+X₂ ≤ X₁ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₉: evalspeedpldi3bb4in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb5in(X₀, X₁, 0, 1+X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₁+X₂ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃
t₄: evalspeedpldi3bb5in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₅: evalspeedpldi3bb5in(X₀, X₁, X₂, X₃) → evalspeedpldi3returnin(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₃: evalspeedpldi3entryin(X₀, X₁, X₂, X₃) → evalspeedpldi3bb5in(X₀, X₁, 0, 0) :|: 1 ≤ X₀ ∧ 1+X₀ ≤ X₁
t₁: evalspeedpldi3entryin(X₀, X₁, X₂, X₃) → evalspeedpldi3returnin(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₂: evalspeedpldi3entryin(X₀, X₁, X₂, X₃) → evalspeedpldi3returnin(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₁₀: evalspeedpldi3returnin(X₀, X₁, X₂, X₃) → evalspeedpldi3stop(X₀, X₁, X₂, X₃)
t₀: evalspeedpldi3start(X₀, X₁, X₂, X₃) → evalspeedpldi3entryin(X₀, X₁, X₂, X₃)

MPRF for transition t₇: evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb4in(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₁ {O(n)}

MPRF:

• evalspeedpldi3bb2in: [X₁-X₃]
• evalspeedpldi3bb3in: [X₁-X₃]
• evalspeedpldi3bb4in: [X₁-1-X₃]
• evalspeedpldi3bb5in: [X₁-X₃]

MPRF for transition t₉: evalspeedpldi3bb4in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb5in(X₀, X₁, 0, 1+X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₁+X₂ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₁ {O(n)}

MPRF:

• evalspeedpldi3bb2in: [X₁-X₃]
• evalspeedpldi3bb3in: [X₁-X₃]
• evalspeedpldi3bb4in: [X₁-X₃]
• evalspeedpldi3bb5in: [X₁-X₃]

MPRF for transition t₄: evalspeedpldi3bb5in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₀⋅X₁+X₀+X₁+1 {O(n^2)}

MPRF:

• evalspeedpldi3bb2in: [X₀-X₂]
• evalspeedpldi3bb3in: [X₀-X₂]
• evalspeedpldi3bb4in: [X₀-X₂]
• evalspeedpldi3bb5in: [1+X₀-X₂]

MPRF for transition t₆: evalspeedpldi3bb2in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb3in(X₀, X₁, X₂, X₃) :|: 1+X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₀⋅X₁+X₀+X₁+1 {O(n^2)}

MPRF:

• evalspeedpldi3bb2in: [1+X₀-X₂]
• evalspeedpldi3bb3in: [X₀-X₂]
• evalspeedpldi3bb4in: [X₀-X₂]
• evalspeedpldi3bb5in: [1+X₀-X₂]

MPRF for transition t₈: evalspeedpldi3bb3in(X₀, X₁, X₂, X₃) → evalspeedpldi3bb5in(X₀, X₁, 1+X₂, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₂ ∧ 2+X₂ ≤ X₁ ∧ 2 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₁⋅X₁+2⋅X₁+1 {O(n^2)}

MPRF:

• evalspeedpldi3bb2in: [X₁-1-X₂]
• evalspeedpldi3bb3in: [X₁-1-X₂]
• evalspeedpldi3bb4in: [X₁-1-X₂]
• evalspeedpldi3bb5in: [X₁-1-X₂]

Cut unsatisfiable transition [t₅: evalspeedpldi3bb5in→evalspeedpldi3returnin; t₅₇: evalspeedpldi3bb5in→evalspeedpldi3returnin]

Found invariant 1+X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2+X₂ ≤ X₃ ∧ 5 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₂ ≤ 0 ∧ 3+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb3in_v5

Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb4in_v2

Found invariant X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb3in_v1

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

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location evalspeedpldi3bb3in_v2

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

Found invariant X₃ ≤ 1 ∧ X₃ ≤ 1+X₂ ∧ X₂+X₃ ≤ 1 ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₂ ≤ 0 ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb3in_v3

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb2in_v2

Found invariant X₃ ≤ 1 ∧ X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb2in_v4

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

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

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

Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location evalspeedpldi3bb4in_v1

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

Cut unsatisfiable transition [t₅₉: evalspeedpldi3bb2in_v1→evalspeedpldi3bb4in_v1; t₆₇: evalspeedpldi3bb5in_v2→evalspeedpldi3returnin]

All Bounds

Timebounds

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

Costbounds

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

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