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