Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, 3⋅X₁+2⋅X₂, -5⋅X₁-3⋅X₂, (X₀)²+X₃) :|: 0 < X₀
Eliminate variables {X₁,X₂,X₃} that do not contribute to the problem
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀) → l1(X₀)
t₅: l1(X₀) → l1(X₀-1) :|: 0 < X₀
new bound:
X₀ {O(n)}
Overall timebound:X₀+1 {O(n)}
t₄: 1 {O(1)}
t₅: X₀ {O(n)}
Overall costbound: X₀+1 {O(n)}
t₄: 1 {O(1)}
t₅: X₀ {O(n)}
t₄, X₀: X₀ {O(n)}
t₅, X₀: X₀ {O(n)}