Initial Problem

Start: f10
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: f10, f4, f6, f7, f9
Transitions:
t₀: f10(X₀, X₁, X₂, X₃, X₄, X₅) → f4(4, 0, 0, X₃, X₄, X₅)
t₃: f4(X₀, X₁, X₂, X₃, X₄, X₅) → f4(X₀, 1+X₁, G, H, X₄, G)
t₁: f4(X₀, X₁, X₂, X₃, X₄, X₅) → f9(X₀, X₁, X₂, X₂, X₂, X₅)
t₄: f6(X₀, X₁, X₂, X₃, X₄, X₅) → f4(X₀, 1+X₁, G, H, X₄, G)
t₂: f7(X₀, X₁, X₂, X₃, X₄, X₅) → f4(X₀, 1+X₁, G, H, X₄, G)

Preprocessing

Cut unreachable locations [f6; f7] from the program graph

Eliminate variables [G; H; X₀; X₁; X₂; X₃; X₄; X₅] that do not contribute to the problem

Problem after Preprocessing

Start: f10
Program_Vars:
Temp_Vars:
Locations: f10, f4, f9
Transitions:
t₈: f10 → f4
t₉: f4 → f4
t₁₀: f4 → f9

All Bounds

Timebounds

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

Costbounds

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

Sizebounds