Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: f0, f4, f5
Transitions:
t₁: f0(X₀, X₁, X₂) → f4(D, 1+D, X₁)
t₂: f4(X₀, X₁, X₂) → f4(D, 1+D, X₁)
t₀: f4(X₀, X₁, X₂) → f5(X₀, X₁, X₂) :|: 1+X₁ ≤ X₀

Preprocessing

Cut unsatisfiable transition [t₀: f4→f5]

Cut unreachable locations [f5] from the program graph

Eliminate variables [D; X₀; X₁; X₂] that do not contribute to the problem

Problem after Preprocessing

Start: f0
Program_Vars:
Temp_Vars:
Locations: f0, f4
Transitions:
t₇: f0 → f4
t₈: f4 → f4

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}

Sizebounds