KoAT2 Proof Output

Initial Problem

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_bb4_in, eval_foo_bb5_in, eval_foo_start, eval_foo_stop
Transitions:
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(0, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₄
t₂: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₄ ≤ 0
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, 0, X₂, X₃, X₄, X₅) :|: 1+X₀ ≤ X₅
t₄: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₀
t₅: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ X₀
t₆: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+X₀ ≤ X₁
t₇: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, X₁+X₄, X₂, X₃, X₄, X₅)
t₈: eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(1+X₀, X₁, X₂, X₃, X₄, X₅)
t₉: eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_stop(X₀, X₁, X₂, X₃, X₄, X₅)
t₀: eval_foo_start(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

Eliminate variables [X₂; X₃] that do not contribute to the problem

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

Found invariant 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location eval_foo_bb1_in

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

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

Problem after Preprocessing

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_bb4_in, eval_foo_bb5_in, eval_foo_start, eval_foo_stop
Transitions:
t₁₉: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(0, X₁, X₂, X₃) :|: 1 ≤ X₂
t₂₀: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb5_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₂₁: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, 0, X₂, X₃) :|: 1+X₀ ≤ X₃ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₂ ∧ 0 ≤ X₀
t₂₂: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb5_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₂ ∧ 0 ≤ X₀
t₂₃: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₁
t₂₄: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb4_in(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ X₁ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₁
t₂₅: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, X₁+X₂, X₂, X₃) :|: 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁
t₂₆: eval_foo_bb4_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(1+X₀, X₁, X₂, X₃) :|: 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₂+X₃ ∧ 0 ≤ X₀
t₂₇: eval_foo_bb5_in(X₀, X₁, X₂, X₃) → eval_foo_stop(X₀, X₁, X₂, X₃)
t₂₈: eval_foo_start(X₀, X₁, X₂, X₃) → eval_foo_bb0_in(X₀, X₁, X₂, X₃)

MPRF for transition t₂₁: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, 0, X₂, X₃) :|: 1+X₀ ≤ X₃ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₂ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₃ {O(n)}

MPRF:

• eval_foo_bb1_in: [X₃-X₀]
• eval_foo_bb2_in: [X₃-1-X₀]
• eval_foo_bb3_in: [X₃-1-X₀]
• eval_foo_bb4_in: [X₃-1-X₀]

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

new bound:

X₃ {O(n)}

MPRF:

• eval_foo_bb1_in: [X₃-X₀]
• eval_foo_bb2_in: [X₃-X₀]
• eval_foo_bb3_in: [X₃-X₀]
• eval_foo_bb4_in: [X₃-1-X₀]

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

new bound:

X₃ {O(n)}

MPRF:

• eval_foo_bb1_in: [X₃-X₀]
• eval_foo_bb2_in: [X₃-X₀]
• eval_foo_bb3_in: [X₃-X₀]
• eval_foo_bb4_in: [X₃-X₀]

MPRF for transition t₂₃: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₁ of depth 1:

new bound:

X₃⋅X₃+X₃ {O(n^2)}

MPRF:

• eval_foo_bb1_in: [X₃]
• eval_foo_bb2_in: [X₃-X₁]
• eval_foo_bb3_in: [X₃-1-X₁]
• eval_foo_bb4_in: [X₃-X₁]

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

new bound:

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

MPRF:

• eval_foo_bb1_in: [1+X₀]
• eval_foo_bb2_in: [1+X₀-X₁]
• eval_foo_bb3_in: [1+X₀-X₁]
• eval_foo_bb4_in: [X₀-X₁]

Cut unsatisfiable transition [t₂₄: eval_foo_bb2_in→eval_foo_bb4_in; t₅₀: eval_foo_bb2_in→eval_foo_bb4_in]

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

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

Found invariant 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location eval_foo_bb1_in

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

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

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

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

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