Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(2⋅X₀+10) :|: 1 ≤ X₀ ∧ X₀ ≤ 99
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(2⋅X₀+10) :|: 1 ≤ X₀ ∧ X₀ ≤ 99
new bound:
X₀+100 {O(n)}
Overall timebound:X₀+101 {O(n)}
t₀: 1 {O(1)}
t₁: X₀+100 {O(n)}
Overall costbound: X₀+101 {O(n)}
t₀: 1 {O(1)}
t₁: X₀+100 {O(n)}
t₀, X₀: X₀ {O(n)}
t₁, X₀: 208 {O(1)}