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