KoAT2 Proof Output

Initial Problem

Start: eval_foo_start
Program_Vars: X₀, 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₅, X₆) → eval_foo_bb1_in(X₄, X₅, X₂, X₃, X₄, X₅, X₆)
t₂: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb2_in(X₀, X₁, X₁, X₃, X₄, X₅, X₆) :|: 1+X₆ ≤ X₀
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ X₆
t₄: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 1+X₆ ≤ X₂
t₅: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₂ ≤ X₆
t₆: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb2_in(X₀, X₁, X₂-1, X₃, X₄, X₅, X₆)
t₇: eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb1_in(X₀-1, X₂, X₂, X₃, X₄, X₅, X₆)
t₈: eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_stop(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₀: eval_foo_start(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆)

Preprocessing

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

Found invariant X₀ ≤ X₅ ∧ X₁ ≤ X₄ ∧ X₀ ≤ X₃ for location eval_foo_bb5_in

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

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

Found invariant X₀ ≤ X₅ ∧ X₁ ≤ X₄ ∧ X₀ ≤ X₃ for location eval_foo_stop

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

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

Problem after Preprocessing

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(X₃, X₄, X₂, X₃, X₄, X₅)
t₁₈: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, X₁, X₁, X₃, X₄, X₅) :|: 1+X₅ ≤ X₀ ∧ X₀ ≤ X₃ ∧ 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₅ ∧ 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₅) :|: 1+X₅ ≤ X₂ ∧ 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₃ ∧ 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₅) :|: X₂ ≤ X₅ ∧ 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄
t₂₂: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, X₁, X₂-1, X₃, X₄, X₅) :|: 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₁ ∧ 1+X₅ ≤ X₂ ∧ 1+X₅ ≤ X₃ ∧ 1+X₅ ≤ X₄ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄
t₂₃: eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(X₀-1, X₂, X₂, X₃, X₄, X₅) :|: 1+X₂ ≤ X₀ ∧ 1+X₅ ≤ X₀ ∧ 1+X₂ ≤ X₃ ∧ 1+X₅ ≤ X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 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₅) :|: 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₅)

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

new bound:

X₃+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₃, X₄, X₅) → eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+X₅ ≤ X₂ ∧ 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄ of depth 1:

new bound:

X₄+X₅ {O(n)}

MPRF:

• eval_foo_bb1_in: [X₁-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_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₅ ∧ 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄ of depth 1:

new bound:

X₃+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_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, X₁, X₂-1, X₃, X₄, X₅) :|: 1+X₅ ≤ X₀ ∧ 1+X₅ ≤ X₁ ∧ 1+X₅ ≤ X₂ ∧ 1+X₅ ≤ X₃ ∧ 1+X₅ ≤ X₄ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄ of depth 1:

new bound:

X₄+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_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(X₀-1, X₂, X₂, X₃, X₄, X₅) :|: 1+X₂ ≤ X₀ ∧ 1+X₅ ≤ X₀ ∧ 1+X₂ ≤ X₃ ∧ 1+X₅ ≤ X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₄ ∧ X₂ ≤ X₅ of depth 1:

new bound:

X₃+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₅]

All Bounds

Timebounds

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

Costbounds

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