Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: f0, f14, f22, f24, f27, f9
Transitions:
t₆: f0(X₀, X₁, X₂, X₃) → f9(E, 0, X₂, 0)
t₁: f14(X₀, X₁, X₂, X₃) → f14(X₀, X₁, X₂-1, X₃) :|: 1 ≤ X₂
t₄: f14(X₀, X₁, X₂, X₃) → f9(E, X₁, X₂, 0) :|: X₂ ≤ 0
t₂: f22(X₀, X₁, X₂, X₃) → f22(X₀, X₁, X₂, X₃)
t₃: f24(X₀, X₁, X₂, X₃) → f27(X₀, X₁, X₂, X₃)
t₀: f9(X₀, X₁, X₂, X₃) → f14(X₀, 0, E, X₃) :|: X₀ ≤ 0
t₅: f9(X₀, X₁, X₂, X₃) → f22(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀

Preprocessing

Cut unreachable locations [f24; f27] from the program graph

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

Found invariant X₀ ≤ 0 for location f14

Found invariant 1 ≤ X₀ for location f22

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: E
Locations: f0, f14, f22, f9
Transitions:
t₁₂: f0(X₀, X₁) → f9(E, X₁)
t₁₃: f14(X₀, X₁) → f14(X₀, X₁-1) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₁₄: f14(X₀, X₁) → f9(E, X₁) :|: X₁ ≤ 0 ∧ X₀ ≤ 0
t₁₅: f22(X₀, X₁) → f22(X₀, X₁) :|: 1 ≤ X₀
t₁₆: f9(X₀, X₁) → f14(X₀, E) :|: X₀ ≤ 0
t₁₇: f9(X₀, X₁) → f22(X₀, X₁) :|: 1 ≤ X₀

Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 for location f14_v2

Found invariant X₀ ≤ 0 for location f14_v1

Found invariant X₁ ≤ 0 for location f9_v1

Found invariant 1 ≤ X₀ for location f22

Found invariant X₀ ≤ 0 for location f14

Found invariant 1 ≤ X₀ for location f22

Found invariant 1 ≤ X₀ for location f22_v1

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}

Sizebounds

t₁₂, X₁: X₁ {O(n)}