Initial Problem

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

Preprocessing

Cut unsatisfiable transition t₅: l3→l1

Cut unsatisfiable transition t₆: l3→l1

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

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ for location l1

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

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location l3

Problem after Preprocessing

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

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

new bound:

X₁ {O(n)}

MPRF:

l3 [X₁-X₂ ]
l1 [X₁-X₂ ]

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

new bound:

X₀⋅X₁+X₀ {O(n^2)}

MPRF:

l3 [X₀-X₃ ]
l1 [X₀-X₃ ]

knowledge_propagation leads to new time bound X₀⋅X₁+X₀+X₁+1 {O(n^2)} for transition t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₂ < X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂

Analysing control-flow refined program

Cut unsatisfiable transition t₇₄: n_l1___6→l4

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

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

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

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

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

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

Found invariant X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ for location l1

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

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

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

Cut unsatisfiable transition t₆₀: n_l3___2→n_l1___5

MPRF for transition t₅₆: n_l1___5(X₀, X₁, X₂, X₃) → n_l3___1(X₀, X₁, X₂, X₃) :|: 0 ≤ X₃ ∧ 0 ≤ X₂ ∧ X₀ ≤ X₃ ∧ X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 1 ≤ X₂ ∧ X₂ ≤ X₁ ∧ X₂ < X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₃ ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ X₀+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 of depth 1:

new bound:

X₁+2 {O(n)}

MPRF:

n_l3___1 [X₁-X₂ ]
n_l1___5 [X₁+1-X₂ ]

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

new bound:

X₁+1 {O(n)}

MPRF:

n_l3___1 [X₁-X₂ ]
n_l1___5 [X₁-X₂ ]

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

new bound:

X₁ {O(n)}

MPRF:

n_l3___2 [X₁-X₂ ]
n_l1___3 [X₁+1-X₂ ]
n_l3___4 [X₁-X₂ ]
n_l1___6 [X₁-X₂ ]

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

new bound:

X₁+1 {O(n)}

MPRF:

n_l3___2 [X₁-X₂ ]
n_l1___3 [X₁-X₂ ]
n_l3___4 [X₁-X₂-1 ]
n_l1___6 [X₁-X₂-1 ]

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

new bound:

X₁ {O(n)}

MPRF:

n_l3___2 [X₁-X₂ ]
n_l1___3 [X₁-X₂ ]
n_l3___4 [X₁-X₂ ]
n_l1___6 [X₁-X₂ ]

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

new bound:

X₀⋅X₁+X₀+2 {O(n^2)}

MPRF:

n_l1___3 [X₀ ]
n_l3___2 [X₀ ]
n_l3___4 [X₀-X₃ ]
n_l1___6 [X₀+1-X₃ ]

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

new bound:

X₀⋅X₁+X₀+2 {O(n^2)}

MPRF:

n_l1___3 [X₀ ]
n_l3___2 [X₀ ]
n_l3___4 [X₀+1-X₃ ]
n_l1___6 [X₀+1-X₃ ]

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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