KoAT2 Proof Output

Initial Problem

Preprocessing

Found invariant 0 ≤ X₃ ∧ X₀ ≤ X₂ for location eval_t15_bb1_in

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

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

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

Problem after Preprocessing

Start: eval_t15_start
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: eval_t15_bb0_in, eval_t15_bb1_in, eval_t15_bb2_in, eval_t15_bb3_in, eval_t15_bb4_in, eval_t15_bb5_in, eval_t15_start, eval_t15_stop
Transitions:
t₂: eval_t15_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb1_in(X₂, X₁, X₂, X₃, X₄) :|: 0 ≤ X₃
t₁: eval_t15_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb5_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₃ ≤ 0
t₃: eval_t15_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₃ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃
t₄: eval_t15_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb5_in(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃
t₅: eval_t15_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb3_in(X₀, X₀-1-X₃, X₂, X₃, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₃ ∧ 1+X₃ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₃
t₇: eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb1_in(X₁, X₁, X₂, X₃, X₄) :|: X₄ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+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₄ ∧ 1+X₄ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₄
t₆: eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb4_in(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ X₄ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+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₄ ∧ 1+X₄ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₄
t₈: eval_t15_bb4_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄-1) :|: 1 ≤ X₀+X₁ ∧ 1+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₀ ∧ 2 ≤ X₂ ∧ 2 ≤ X₃+X₄ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂+X₄ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ X₄ ≤ X₃
t₉: eval_t15_bb5_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_stop(X₀, X₁, X₂, X₃, X₄)
t₀: eval_t15_start(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb0_in(X₀, X₁, X₂, X₃, X₄)

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

new bound:

X₂+X₃ {O(n)}

MPRF:

• eval_t15_bb1_in: [X₀-X₃]
• eval_t15_bb2_in: [X₀-1-X₃]
• eval_t15_bb3_in: [X₁]
• eval_t15_bb4_in: [X₁]

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

new bound:

X₂+X₃ {O(n)}

MPRF:

• eval_t15_bb1_in: [X₀-X₃]
• eval_t15_bb2_in: [X₀-X₃]
• eval_t15_bb3_in: [X₁]
• eval_t15_bb4_in: [X₁]

MPRF for transition t₆: eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb4_in(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ X₄ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+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₄ ∧ 1+X₄ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₄ of depth 1:

new bound:

X₂+X₃ {O(n)}

MPRF:

• eval_t15_bb1_in: [X₀+X₃]
• eval_t15_bb2_in: [X₀+X₃]
• eval_t15_bb3_in: [1+X₁+X₃+X₄]
• eval_t15_bb4_in: [X₁+X₃+X₄]

MPRF for transition t₇: eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb1_in(X₁, X₁, X₂, X₃, X₄) :|: X₄ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₃ ∧ 1+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₄ ∧ 1+X₄ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₄ of depth 1:

new bound:

X₂ {O(n)}

MPRF:

• eval_t15_bb1_in: [X₀]
• eval_t15_bb2_in: [X₀]
• eval_t15_bb3_in: [X₀]
• eval_t15_bb4_in: [X₀]

MPRF for transition t₈: eval_t15_bb4_in(X₀, X₁, X₂, X₃, X₄) → eval_t15_bb3_in(X₀, X₁, X₂, X₃, X₄-1) :|: 1 ≤ X₀+X₁ ∧ 1+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₀ ∧ 2 ≤ X₂ ∧ 2 ≤ X₃+X₄ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₂+X₄ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁+X₃ ∧ X₄ ≤ X₃ of depth 1:

new bound:

X₂+X₃+1 {O(n)}

MPRF:

• eval_t15_bb1_in: [X₀+X₃-1]
• eval_t15_bb2_in: [X₀+X₃-1]
• eval_t15_bb3_in: [X₁+X₃+X₄]
• eval_t15_bb4_in: [X₁+X₃+X₄]

All Bounds

Timebounds

Overall timebound:4⋅X₃+5⋅X₂+6 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
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₂ {O(n)}
t₈: X₂+X₃+1 {O(n)}
t₉: 1 {O(1)}

Costbounds

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