Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I
Locations: f0, f14, f24, f26, f29
Transitions:
t₅: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f14(1+2⋅I, H, 0, X₃, H, 1+2⋅I, I) :|: 1 ≤ H ∧ 0 ≤ I
t₀: f14(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f14(X₀-1, X₁-1, 1+X₂, H, X₄, X₅, X₆) :|: 1 ≤ H ∧ 1 ≤ X₀
t₁: f14(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f14(X₀-1, X₁, X₂, H, X₄, X₅, X₆) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ H ≤ 0
t₄: f14(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f24(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0
t₂: f24(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f24(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₃: f26(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f29(X₀, X₁, X₂, X₃, X₄, X₅, X₆)

Preprocessing

Cut unreachable locations [f26; f29] from the program graph

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

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

Found invariant 0 ≤ X₀ for location f14

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: H, I
Locations: f0, f14, f24
Transitions:
t₁₂: f0(X₀, X₁) → f14(1+2⋅I, H) :|: 1 ≤ H ∧ 0 ≤ I
t₁₃: f14(X₀, X₁) → f14(X₀-1, X₁-1) :|: 1 ≤ H ∧ 1 ≤ X₀ ∧ 0 ≤ X₀
t₁₄: f14(X₀, X₁) → f14(X₀-1, X₁) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ H ≤ 0 ∧ 0 ≤ X₀
t₁₅: f14(X₀, X₁) → f24(X₀, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₆: f24(X₀, X₁) → f24(X₀, X₁) :|: 0 ≤ X₀ ∧ X₀ ≤ 0

Cut unsatisfiable transition [t₁₅: f14→f24; t₃₂: f14→f24]

Found invariant 0 ≤ X₀ for location f14_v2

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

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f14

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

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

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

Found invariant 0 ≤ X₀ for location f14

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

t₁₅, X₀: 0 {O(1)}
t₁₆, X₀: 0 {O(1)}