Start: l0
Program_Vars: X₀
Temp_Vars: B, C
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(B) :|: 2 ≤ B
t₁: l1(X₀) → l1(B) :|: B ≤ 1 ∧ 0 ≤ 1+B ∧ 2 ≤ C
Eliminate variables {X₀} that do not contribute to the problem
Start: l0
Program_Vars:
Temp_Vars: B, C
Locations: l0, l1
Transitions:
t₄: l0 → l1 :|: 2 ≤ B
t₅: l1 → l1 :|: B ≤ 1 ∧ 0 ≤ 1+B ∧ 2 ≤ C
Overall timebound:inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
Overall costbound: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}