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₃) → l3(X₀, X₁, X₂, X₃) :|: 100 < X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 100
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₁, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃)
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₀+X₃+50, X₂, X₃)
t₆: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: 0 ≤ X₁
t₇: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: X₁ < 0
t₈: l6(X₀, X₁, X₂, X₃) → l5(X₀, X₁-1, X₂, X₃)
t₉: l7(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃)
Found invariant 0 ≤ 150+X₃ ∧ 0 ≤ 150+X₁+X₃ ∧ X₁ ≤ 150+X₃ ∧ X₀ ≤ 250+X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 for location l6
Found invariant X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ X₀+X₁ ≤ 99 ∧ X₀ ≤ 100 for location l7
Found invariant X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 100 for location l5
Found invariant X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ X₀+X₁ ≤ 99 ∧ X₀ ≤ 100 for location l8
Found invariant X₀ ≤ X₂ for location l1
Found invariant X₀ ≤ X₂ ∧ X₀ ≤ 100 for location l4
Found invariant 101 ≤ X₂ ∧ 202 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 101 ≤ X₀ for location l3
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₃) → l3(X₀, X₁, X₂, X₃) :|: 100 < X₀ ∧ X₀ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 100 ∧ X₀ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₁, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 101 ≤ X₂ ∧ 202 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 101 ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₀+X₃+50, X₂, X₃) :|: X₀ ≤ X₂ ∧ X₀ ≤ 100
t₆: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: 0 ≤ X₁ ∧ X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 100
t₇: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: X₁ < 0 ∧ X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 100
t₈: l6(X₀, X₁, X₂, X₃) → l5(X₀, X₁-1, X₂, X₃) :|: 0 ≤ 150+X₃ ∧ 0 ≤ 150+X₁+X₃ ∧ X₁ ≤ 150+X₃ ∧ X₀ ≤ 250+X₃ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100
t₉: l7(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃) :|: X₁ ≤ 150+X₃ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ X₀+X₁ ≤ 99 ∧ X₀ ≤ 100
new bound:
X₂+100 {O(n)}
MPRF:
l3 [X₀-101 ]
l1 [X₀-100 ]
new bound:
X₂+100 {O(n)}
MPRF:
l3 [X₀-100 ]
l1 [X₀-100 ]
new bound:
2⋅X₂+2⋅X₃+51 {O(n)}
MPRF:
l6 [X₁ ]
l5 [X₁+1 ]
new bound:
2⋅X₂+2⋅X₃+51 {O(n)}
MPRF:
l6 [X₁+1 ]
l5 [X₁+1 ]
Overall timebound:4⋅X₃+6⋅X₂+308 {O(n)}
t₀: 1 {O(1)}
t₂: X₂+100 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: X₂+100 {O(n)}
t₅: 1 {O(1)}
t₆: 2⋅X₂+2⋅X₃+51 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₂+2⋅X₃+51 {O(n)}
t₉: 1 {O(1)}
Overall costbound: 4⋅X₃+6⋅X₂+308 {O(n)}
t₀: 1 {O(1)}
t₂: X₂+100 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: X₂+100 {O(n)}
t₅: 1 {O(1)}
t₆: 2⋅X₂+2⋅X₃+51 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₂+2⋅X₃+51 {O(n)}
t₉: 1 {O(1)}
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₂ {O(n)}
t₃, X₁: 2⋅X₁ {O(n)}
t₃, X₂: 2⋅X₂ {O(n)}
t₃, X₃: 2⋅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₂ {O(n)}
t₅, X₁: 2⋅X₂+2⋅X₃+50 {O(n)}
t₅, X₂: 2⋅X₂ {O(n)}
t₅, X₃: 2⋅X₃ {O(n)}
t₆, X₀: 2⋅X₂ {O(n)}
t₆, X₁: 2⋅X₂+2⋅X₃+51 {O(n)}
t₆, X₂: 2⋅X₂ {O(n)}
t₆, X₃: 2⋅X₃ {O(n)}
t₇, X₀: 4⋅X₂ {O(n)}
t₇, X₁: 4⋅X₂+4⋅X₃+101 {O(n)}
t₇, X₂: 4⋅X₂ {O(n)}
t₇, X₃: 4⋅X₃ {O(n)}
t₈, X₀: 2⋅X₂ {O(n)}
t₈, X₁: 2⋅X₂+2⋅X₃+51 {O(n)}
t₈, X₂: 2⋅X₂ {O(n)}
t₈, X₃: 2⋅X₃ {O(n)}
t₉, X₀: 4⋅X₂ {O(n)}
t₉, X₁: 4⋅X₂+4⋅X₃+101 {O(n)}
t₉, X₂: 4⋅X₂ {O(n)}
t₉, X₃: 4⋅X₃ {O(n)}