KoAT2 Proof Output

Initial Problem

Start: eval_start_start
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: eval_start_0, eval_start_1, eval_start_2, eval_start_3, eval_start_4, eval_start_5, eval_start_bb0_in, eval_start_bb1_in, eval_start_bb2_in, eval_start_bb3_in, eval_start_start, eval_start_stop
Transitions:
t₂: eval_start_0(X₀, X₁, X₂, X₃, X₄) → eval_start_1(X₀, X₁, X₂, X₃, X₄)
t₃: eval_start_1(X₀, X₁, X₂, X₃, X₄) → eval_start_2(X₀, X₁, X₂, X₃, X₄)
t₄: eval_start_2(X₀, X₁, X₂, X₃, X₄) → eval_start_3(X₀, X₁, X₂, X₃, X₄)
t₅: eval_start_3(X₀, X₁, X₂, X₃, X₄) → eval_start_4(X₀, X₁, X₂, X₃, X₄)
t₆: eval_start_4(X₀, X₁, X₂, X₃, X₄) → eval_start_5(X₀, X₁, X₂, X₃, X₄)
t₇: eval_start_5(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₃, X₄, X₂, X₃, X₄)
t₁: eval_start_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_start_0(X₀, X₁, X₂, X₃, X₄)
t₈: eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₂
t₉: eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb3_in(X₀, X₁, X₂, X₃, X₄) :|: X₂ ≤ X₀
t₁₀: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(1+X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁
t₁₁: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁₂: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(1+X₀, 1+X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁₃: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₀, 1+X₁, X₂, X₃, X₄) :|: X₁ ≤ X₀
t₁₄: eval_start_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_start_stop(X₀, X₁, X₂, X₃, X₄)
t₀: eval_start_start(X₀, X₁, X₂, X₃, X₄) → eval_start_bb0_in(X₀, X₁, X₂, X₃, X₄)

Preprocessing

Cut unsatisfiable transition [t₁₁: eval_start_bb2_in→eval_start_bb1_in; t₁₂: eval_start_bb2_in→eval_start_bb1_in]

Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₀ for location eval_start_bb1_in

Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₀ for location eval_start_stop

Found invariant X₄ ≤ X₁ ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ 1+X₀ ≤ X₂ for location eval_start_bb2_in

Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₂ ≤ X₀ for location eval_start_bb3_in

Problem after Preprocessing

Start: eval_start_start
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: eval_start_0, eval_start_1, eval_start_2, eval_start_3, eval_start_4, eval_start_5, eval_start_bb0_in, eval_start_bb1_in, eval_start_bb2_in, eval_start_bb3_in, eval_start_start, eval_start_stop
Transitions:
t₂: eval_start_0(X₀, X₁, X₂, X₃, X₄) → eval_start_1(X₀, X₁, X₂, X₃, X₄)
t₃: eval_start_1(X₀, X₁, X₂, X₃, X₄) → eval_start_2(X₀, X₁, X₂, X₃, X₄)
t₄: eval_start_2(X₀, X₁, X₂, X₃, X₄) → eval_start_3(X₀, X₁, X₂, X₃, X₄)
t₅: eval_start_3(X₀, X₁, X₂, X₃, X₄) → eval_start_4(X₀, X₁, X₂, X₃, X₄)
t₆: eval_start_4(X₀, X₁, X₂, X₃, X₄) → eval_start_5(X₀, X₁, X₂, X₃, X₄)
t₇: eval_start_5(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₃, X₄, X₂, X₃, X₄)
t₁: eval_start_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_start_0(X₀, X₁, X₂, X₃, X₄)
t₈: eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁
t₉: eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb3_in(X₀, X₁, X₂, X₃, X₄) :|: X₂ ≤ X₀ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁
t₁₀: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(1+X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁
t₁₃: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₀, 1+X₁, X₂, X₃, X₄) :|: X₁ ≤ X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁
t₁₄: eval_start_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_start_stop(X₀, X₁, X₂, X₃, X₄) :|: X₂ ≤ X₀ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁
t₀: eval_start_start(X₀, X₁, X₂, X₃, X₄) → eval_start_bb0_in(X₀, X₁, X₂, X₃, X₄)

MPRF for transition t₁₀: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(1+X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁ of depth 1:

new bound:

X₂+X₃ {O(n)}

MPRF:

• eval_start_bb1_in: [X₂-X₀]
• eval_start_bb2_in: [X₂-X₀]

MPRF for transition t₁₃: eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb1_in(X₀, 1+X₁, X₂, X₃, X₄) :|: X₁ ≤ X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁ of depth 1:

new bound:

X₂+X₄ {O(n)}

MPRF:

• eval_start_bb1_in: [X₂-X₁]
• eval_start_bb2_in: [X₂-X₁]

knowledge_propagation leads to new time bound 2⋅X₂+X₃+X₄+1 {O(n)} for transition t₈: eval_start_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_start_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₂ ∧ X₃ ≤ X₀ ∧ X₄ ≤ X₁

All Bounds

Timebounds

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

Costbounds

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