Initial Problem

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

Preprocessing

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l5

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l4

Problem after Preprocessing

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

MPRF for transition t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₀ < X₁ of depth 1:

new bound:

X₁+X₂ {O(n)}

MPRF:

l3 [X₁-X₀-1 ]
l1 [X₁-X₀ ]

MPRF for transition t₆: l3(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂) :|: X₀ ≤ X₁ of depth 1:

new bound:

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

MPRF:

l3 [X₁+1-X₀ ]
l1 [X₁+1-X₀ ]

Found invariant 1 ≤ 0 for location l5

Found invariant 1 ≤ 0 for location l1

Found invariant 1 ≤ 0 for location l4

Found invariant 1 ≤ 0 for location l3

Found invariant X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l5

Found invariant X₀ ≤ X₂ for location l1

Found invariant X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l4

Found invariant X₀ ≤ X₂ for location l3

MPRF for transition t₃: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₁ < X₀ of depth 1:

new bound:

2⋅X₁⋅X₁+2⋅X₂⋅X₂+4⋅X₁⋅X₂+6⋅X₁+6⋅X₂+5 {O(n^2)}

MPRF:

l3 [X₀+1-X₁ ]
l1 [X₀+2-X₁ ]

MPRF for transition t₅: l3(X₀, X₁, X₂) → l1(X₀-1, X₁, X₂) :|: X₁ < X₀ of depth 1:

new bound:

2⋅X₁⋅X₁+2⋅X₂⋅X₂+4⋅X₁⋅X₂+5⋅X₁+5⋅X₂+3 {O(n^2)}

MPRF:

l3 [X₀+1-X₁ ]
l1 [X₀+1-X₁ ]

Analysing control-flow refined program

Cut unsatisfiable transition t₉₃: n_l1___2→n_l3___4

Cut unsatisfiable transition t₉₄: n_l1___5→n_l3___3

Cut unreachable locations [n_l3___3] from the program graph

Found invariant 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ for location n_l3___4

Found invariant X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l3___6

Found invariant 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___2

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l5

Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₁ for location n_l1___5

Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l4

Found invariant 2+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l3___1

Found invariant 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l3___7

MPRF for transition t₉₂: n_l1___2(X₀, X₁, X₂) → n_l3___1(X₀, X₁, X₂) :|: X₁ < X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ of depth 1:

new bound:

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

MPRF:

n_l3___1 [X₀-X₁ ]
n_l1___2 [X₀+1-X₁ ]

MPRF for transition t₉₈: n_l3___1(X₀, X₁, X₂) → n_l1___2(X₀-1, X₁, X₂) :|: X₁ < X₀ ∧ X₁ < X₀ ∧ 2+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀ of depth 1:

new bound:

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

MPRF:

n_l3___1 [X₀-X₁ ]
n_l1___2 [X₀-X₁ ]

MPRF for transition t₉₅: n_l1___5(X₀, X₁, X₂) → n_l3___4(X₀, X₁, X₂) :|: X₀ ≤ 1+X₁ ∧ X₀ < X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₁ of depth 1:

new bound:

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

MPRF:

n_l3___4 [X₁-X₀ ]
n_l1___5 [X₁+1-X₀ ]

MPRF for transition t₁₀₀: n_l3___4(X₀, X₁, X₂) → n_l1___5(X₀+1, X₁, X₂) :|: X₀ < X₁ ∧ X₀ ≤ X₁ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ of depth 1:

new bound:

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

MPRF:

n_l3___4 [X₁+1-X₀ ]
n_l1___5 [X₁+1-X₀ ]

CFR: Improvement to new bound with the following program:

new bound:

4⋅X₁+4⋅X₂+7 {O(n)}

cfr-program:

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l4, l5, n_l1___2, n_l1___5, n_l3___1, n_l3___4, n_l3___6, n_l3___7
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₄: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₉₆: l1(X₀, X₁, X₂) → n_l3___6(X₀, X₁, X₂) :|: X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ < X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₉₇: l1(X₀, X₁, X₂) → n_l3___7(X₀, X₁, X₂) :|: X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₀ < X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₇: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁₁₃: n_l1___2(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀
t₉₂: n_l1___2(X₀, X₁, X₂) → n_l3___1(X₀, X₁, X₂) :|: X₁ < X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀
t₁₁₄: n_l1___5(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₁
t₉₅: n_l1___5(X₀, X₁, X₂) → n_l3___4(X₀, X₁, X₂) :|: X₀ ≤ 1+X₁ ∧ X₀ < X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₁
t₉₈: n_l3___1(X₀, X₁, X₂) → n_l1___2(X₀-1, X₁, X₂) :|: X₁ < X₀ ∧ X₁ < X₀ ∧ 2+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀
t₁₀₀: n_l3___4(X₀, X₁, X₂) → n_l1___5(X₀+1, X₁, X₂) :|: X₀ < X₁ ∧ X₀ ≤ X₁ ∧ 2+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁
t₁₀₁: n_l3___6(X₀, X₁, X₂) → n_l1___2(X₀-1, X₁, X₂) :|: X₁ < X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ < X₀ ∧ X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀
t₁₀₂: n_l3___7(X₀, X₁, X₂) → n_l1___5(X₀+1, X₁, X₂) :|: X₀ < X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁

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