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₁ ≤ 99
t₃: l1(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: 100 ≤ X₁
t₄: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₀+1 ≤ X₂
t₅: l2(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₂ ≤ X₀
t₆: l3(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂)
t₇: l4(X₀, X₁, X₂) → l1(X₀, X₁+1, X₂)
t₈: l5(X₀, X₁, X₂) → l7(X₀, X₁, X₂)
t₁: l6(X₀, X₁, X₂) → l1(0, 0, X₂)

Preprocessing

Found invariant X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l7

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

Found invariant 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l1

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

Found invariant 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ 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₁ ≤ 99 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: 100 ≤ X₁ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₄: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₀+1 ≤ X₂ ∧ X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₅: l2(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₆: l3(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂) :|: 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₇: l4(X₀, X₁, X₂) → l1(X₀, X₁+1, X₂) :|: X₂ ≤ X₀ ∧ X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₈: l5(X₀, X₁, X₂) → l7(X₀, X₁, X₂) :|: 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁: l6(X₀, X₁, X₂) → l1(0, 0, X₂)

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

new bound:

X₂ {O(n)}

MPRF for transition t₅: l2(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₂ ≤ X₀ ∧ X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:

new bound:

100 {O(1)}

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

new bound:

X₂ {O(n)}

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

new bound:

100 {O(1)}

knowledge_propagation leads to new time bound X₂+101 {O(n)} for transition t₂: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁ ≤ 99 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀

All Bounds

Timebounds

Overall timebound:3⋅X₂+305 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+101 {O(n)}
t₃: 1 {O(1)}
t₄: X₂ {O(n)}
t₅: 100 {O(1)}
t₆: X₂ {O(n)}
t₇: 100 {O(1)}
t₈: 1 {O(1)}

Costbounds

Overall costbound: 3⋅X₂+305 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+101 {O(n)}
t₃: 1 {O(1)}
t₄: X₂ {O(n)}
t₅: 100 {O(1)}
t₆: X₂ {O(n)}
t₇: 100 {O(1)}
t₈: 1 {O(1)}

Sizebounds

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₁: 99 {O(1)}
t₂, X₂: X₂ {O(n)}
t₃, X₀: 2⋅X₂ {O(n)}
t₃, X₁: 199 {O(1)}
t₃, X₂: 2⋅X₂ {O(n)}
t₄, X₀: X₂ {O(n)}
t₄, X₁: 99 {O(1)}
t₄, X₂: X₂ {O(n)}
t₅, X₀: X₂ {O(n)}
t₅, X₁: 99 {O(1)}
t₅, X₂: X₂ {O(n)}
t₆, X₀: X₂ {O(n)}
t₆, X₁: 99 {O(1)}
t₆, X₂: X₂ {O(n)}
t₇, X₀: X₂ {O(n)}
t₇, X₁: 100 {O(1)}
t₇, X₂: X₂ {O(n)}
t₈, X₀: 2⋅X₂ {O(n)}
t₈, X₁: 199 {O(1)}
t₈, X₂: 2⋅X₂ {O(n)}