Initial Problem

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

Preprocessing

Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ for location l2

Found invariant X₁ ≤ 0 for location l7

Found invariant X₁ ≤ 0 for location l5

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

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

Problem after Preprocessing

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

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

new bound:

X₀ {O(n)}

MPRF:

l2 [X₁+X₂-X₀-1 ]
l3 [X₁+X₂-X₀ ]
l4 [X₁ ]
l1 [X₁+X₂-X₀ ]

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

new bound:

X₀ {O(n)}

MPRF:

l2 [X₁ ]
l3 [X₁-1 ]
l4 [X₁ ]
l1 [X₁ ]

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

new bound:

X₀ {O(n)}

MPRF:

l2 [X₁ ]
l3 [X₁+X₂-X₀ ]
l4 [X₁ ]
l1 [X₁+X₂-X₀ ]

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

new bound:

X₀ {O(n)}

MPRF:

l2 [X₁ ]
l3 [X₁ ]
l4 [X₁ ]
l1 [X₁ ]

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

new bound:

X₀ {O(n)}

MPRF:

l2 [X₁-1 ]
l3 [X₁-1 ]
l4 [X₁ ]
l1 [X₁-1 ]

All Bounds

Timebounds

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

Costbounds

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