Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₄: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀-1, X₀-2, X₂) :|: 1 ≤ X₀ ∧ 1 ≤ X₁+X₀ ∧ 1 ≤ X₁
t₁: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: 1 ≤ X₀ ∧ X₁+X₀ ≤ 0 ∧ 1 ≤ X₁
t₂: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₃: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₁ ≤ 0
Cut unsatisfiable transition t₁: l1→l2
Eliminate variables {D,X₂} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₁₂: l0(X₀, X₁) → l1(X₀, X₁)
t₁₃: l1(X₀, X₁) → l1(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ 1 ≤ X₁+X₀ ∧ 1 ≤ X₁
t₁₄: l1(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₁₅: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
new bound:
X₀ {O(n)}
Overall timebound:X₀+3 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: X₀ {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
Overall costbound: X₀+3 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: X₀ {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
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₀ {O(n)}
t₁₅, X₁: 2⋅X₀+X₁ {O(n)}