Initial Problem

Start: eval_speedpldi3_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_speedpldi3_bb0_in, eval_speedpldi3_bb1_in, eval_speedpldi3_bb2_in, eval_speedpldi3_bb3_in, eval_speedpldi3_start, eval_speedpldi3_stop
Transitions:
t₃: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(0, 0, X₂, X₃) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₃
t₁: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₂: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₂
t₄: eval_speedpldi3_bb1_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ X₃
t₅: eval_speedpldi3_bb1_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₀
t₆: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(X₀, 1+X₁, X₂, X₃) :|: 1+X₁ ≤ X₂
t₇: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(1+X₀, 1+X₁, X₂, X₃) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ X₁
t₈: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(X₀, 0, X₂, X₃) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ X₁
t₉: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(1+X₀, 0, X₂, X₃) :|: X₂ ≤ X₁
t₁₀: eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_stop(X₀, X₁, X₂, X₃)
t₀: eval_speedpldi3_start(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃)

Preprocessing

Cut unsatisfiable transition [t₇: eval_speedpldi3_bb2_in→eval_speedpldi3_bb1_in; t₈: eval_speedpldi3_bb2_in→eval_speedpldi3_bb1_in]

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

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

Problem after Preprocessing

Start: eval_speedpldi3_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_speedpldi3_bb0_in, eval_speedpldi3_bb1_in, eval_speedpldi3_bb2_in, eval_speedpldi3_bb3_in, eval_speedpldi3_start, eval_speedpldi3_stop
Transitions:
t₃: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(0, 0, X₂, X₃) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₃
t₁: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₂: eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₂
t₄: eval_speedpldi3_bb1_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ X₃ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₂
t₅: eval_speedpldi3_bb1_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₂
t₆: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(X₀, 1+X₁, X₂, X₃) :|: 1+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₂
t₉: eval_speedpldi3_bb2_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb1_in(1+X₀, 0, X₂, X₃) :|: X₂ ≤ X₁ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₁ ∧ X₁ ≤ X₂
t₁₀: eval_speedpldi3_bb3_in(X₀, X₁, X₂, X₃) → eval_speedpldi3_stop(X₀, X₁, X₂, X₃)
t₀: eval_speedpldi3_start(X₀, X₁, X₂, X₃) → eval_speedpldi3_bb0_in(X₀, X₁, X₂, X₃)

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

new bound:

X₃ {O(n)}

MPRF:

• eval_speedpldi3_bb1_in: [X₃-X₀]
• eval_speedpldi3_bb2_in: [X₃-X₀]

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

new bound:

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

MPRF:

• eval_speedpldi3_bb1_in: [1+X₂-X₁]
• eval_speedpldi3_bb2_in: [X₂-X₁]

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

new bound:

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

MPRF:

• eval_speedpldi3_bb1_in: [X₃-X₁]
• eval_speedpldi3_bb2_in: [X₃-X₁]

Cut unsatisfiable transition [t₅: eval_speedpldi3_bb1_in→eval_speedpldi3_bb3_in; t₄₉: eval_speedpldi3_bb1_in→eval_speedpldi3_bb3_in]

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

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

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

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

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

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

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

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

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

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

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

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

Cut unsatisfiable transition [t₅₁: eval_speedpldi3_bb2_in_v1→eval_speedpldi3_bb1_in_v1; t₅₆: eval_speedpldi3_bb1_in_v1→eval_speedpldi3_bb3_in]

All Bounds

Timebounds

Overall timebound:X₂⋅X₃+X₃⋅X₃+3⋅X₃+X₂+7 {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₃ {O(n^2)}
t₉: X₃ {O(n)}
t₁₀: 1 {O(1)}

Costbounds

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