Start: f3
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: f2, f3, f300
Transitions:
t₀: f2(X₀, X₁, X₂) → f2(X₀+X₁, X₁, X₂) :|: 0 ≤ X₀+X₁
t₂: f2(X₀, X₁, X₂) → f300(X₀+X₁, X₁, D) :|: 1+X₀+X₁ ≤ 0
t₁: f3(X₀, X₁, X₂) → f2(X₀, X₁, X₂)
Eliminate variables [D; X₂] that do not contribute to the problem
Start: f3
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f2, f3, f300
Transitions:
t₅: f2(X₀, X₁) → f2(X₀+X₁, X₁) :|: 0 ≤ X₀+X₁
t₆: f2(X₀, X₁) → f300(X₀+X₁, X₁) :|: 1+X₀+X₁ ≤ 0
t₇: f3(X₀, X₁) → f2(X₀, X₁)
Overall timebound:inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
Overall costbound: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₅, X₁: X₁ {O(n)}
t₆, X₁: 2⋅X₁ {O(n)}
t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}