Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₀+X₁ ∧ X₁+1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ 2⋅X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀+1 ≤ X₁
t₃: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₁+1 ≤ X₀
Cut unsatisfiable transition t₃: l1→l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₀+X₁ ∧ X₁+1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ 2⋅X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀+1 ≤ X₁
new bound:
2⋅X₀ {O(n)}
MPRF:
l1 [2⋅X₀ ]
new bound:
2⋅X₀ {O(n)}
MPRF:
l1 [2⋅X₀ ]
new bound:
2⋅X₁ {O(n)}
MPRF:
l1 [2⋅X₁ ]
Overall timebound:2⋅X₁+4⋅X₀+1 {O(n)}
t₄: 1 {O(1)}
t₀: 2⋅X₀ {O(n)}
t₁: 2⋅X₀ {O(n)}
t₂: 2⋅X₁ {O(n)}
Overall costbound: 2⋅X₁+4⋅X₀+1 {O(n)}
t₄: 1 {O(1)}
t₀: 2⋅X₀ {O(n)}
t₁: 2⋅X₀ {O(n)}
t₂: 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₀: 3⋅X₀ {O(n)}
t₁, X₁: 3⋅X₁ {O(n)}
t₂, X₀: 3⋅X₀ {O(n)}
t₂, X₁: 3⋅X₁ {O(n)}