Initial Problem

Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀) → l1(3)
t₂: l1(X₀) → l1(3)
t₀: l2(X₀) → l2(2)

Preprocessing

Cut unreachable locations [l2] from the program graph

Eliminate variables {X₀} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars:
Temp_Vars:
Locations: l0, l1
Transitions:
t₅: l0 → l1
t₆: l1 → l1

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}

Sizebounds