Initial Problem

Start: f1
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I, J, K
Locations: f0, f1, f2
Transitions:
t₁: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f0(H, X₁, X₂, I, 0, X₅, X₆) :|: 1+X₀ ≤ X₁
t₂: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f0(H, X₁, X₂, I, J, K, X₆) :|: 1+J ≤ 0 ∧ 1+X₀ ≤ X₁
t₃: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f0(H, X₁, X₂, I, J, K, X₆) :|: 1 ≤ J ∧ 1+X₀ ≤ X₁
t₀: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f2(H, X₁, I, X₃, X₄, X₅, X₆) :|: X₁ ≤ X₀
t₄: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f0(X₀, X₁, X₂, X₃, X₄, X₅, H)

Preprocessing

Eliminate variables [I; K; X₂; X₃; X₄; X₅; X₆] that do not contribute to the problem

Problem after Preprocessing

Start: f1
Program_Vars: X₀, X₁
Temp_Vars: H, J
Locations: f0, f1, f2
Transitions:
t₉: f0(X₀, X₁) → f0(H, X₁) :|: 1+X₀ ≤ X₁
t₁₀: f0(X₀, X₁) → f0(H, X₁) :|: 1+J ≤ 0 ∧ 1+X₀ ≤ X₁
t₁₁: f0(X₀, X₁) → f0(H, X₁) :|: 1 ≤ J ∧ 1+X₀ ≤ X₁
t₁₂: f0(X₀, X₁) → f2(H, X₁) :|: X₁ ≤ X₀
t₁₃: f1(X₀, X₁) → f0(X₀, X₁)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}

Sizebounds

t₉, X₁: X₁ {O(n)}
t₁₀, X₁: X₁ {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₂, X₁: 4⋅X₁ {O(n)}
t₁₃, X₀: X₀ {O(n)}
t₁₃, X₁: X₁ {O(n)}