Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃)
t₁: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₂: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₆: l4(X₀, X₁, X₂, X₃) → l5(X₂, X₃, X₂, X₃) :|: 0 ≤ X₂ ∧ 0 ≤ X₃
t₄: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₂ < 0
t₅: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₃ < 0
t₉: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₁+2 ∧ X₁ ≤ X₀+2
t₇: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₁ < X₀
t₈: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₀ < X₁
t₁₄: l6(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃)
t₁₀: l7(X₀, X₁, X₂, X₃) → l5(X₀+1, X₁, X₂, X₃) :|: X₀ < X₁ ∧ X₀ < X₁
t₁₁: l7(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₀ < X₁ ∧ X₁ ≤ X₀
t₁₂: l7(X₀, X₁, X₂, X₃) → l5(X₀+1, X₁+1, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₀ < X₁
t₁₃: l7(X₀, X₁, X₂, X₃) → l5(X₀, X₁+1, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₁ ≤ X₀

Preprocessing

Cut unsatisfiable transition t₁₁: l7→l5

Cut unsatisfiable transition t₁₂: l7→l5

Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l7

Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l5

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃)
t₁: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₂: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₆: l4(X₀, X₁, X₂, X₃) → l5(X₂, X₃, X₂, X₃) :|: 0 ≤ X₂ ∧ 0 ≤ X₃
t₄: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₂ < 0
t₅: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₃ < 0
t₉: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₁+2 ∧ X₁ ≤ X₀+2 ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₇: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₁ < X₀ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₈: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₀ < X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₄: l6(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃)
t₁₀: l7(X₀, X₁, X₂, X₃) → l5(X₀+1, X₁, X₂, X₃) :|: X₀ < X₁ ∧ X₀ < X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₃: l7(X₀, X₁, X₂, X₃) → l5(X₀, X₁+1, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀

MPRF for transition t₇: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₁ < X₀ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₈: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 2+X₀ < X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

MPRF for transition t₁₀: l7(X₀, X₁, X₂, X₃) → l5(X₀+1, X₁, X₂, X₃) :|: X₀ < X₁ ∧ X₀ < X₁ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

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

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

new bound:

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

All Bounds

Timebounds

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

Costbounds

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