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