Initial Problem

Start: f2
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: f0, f1, f2, f3
Transitions:
t₁: f0(X₀, X₁, X₂, X₃) → f0(X₀-1, X₁, X₀, X₃) :|: X₀ ≤ 9
t₀: f0(X₀, X₁, X₂, X₃) → f3(X₀, E, X₂, X₃) :|: 10 ≤ X₀
t₂: f1(X₀, X₁, X₂, X₃) → f0(-1, X₁, X₂, -1) :|: X₀ ≤ 9
t₃: f2(X₀, X₁, X₂, X₃) → f0(0, X₁, X₂, X₃)

Preprocessing

Cut unreachable locations [f1] from the program graph

Cut unsatisfiable transition [t₀: f0→f3]

Cut unreachable locations [f3] from the program graph

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

Found invariant X₀ ≤ 0 for location f0

Problem after Preprocessing

Start: f2
Program_Vars: X₀
Temp_Vars:
Locations: f0, f2
Transitions:
t₇: f0(X₀) → f0(X₀-1) :|: X₀ ≤ 9 ∧ X₀ ≤ 0
t₈: f2(X₀) → f0(0)

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location f0

Found invariant 1+X₀ ≤ 0 for location f0_v1

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

t₈, X₀: 0 {O(1)}