Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G
Locations: f0, f10, f16, f25, f27, f30
Transitions:
t₆: f0(X₀, X₁, X₂, X₃, X₄, X₅) → f10(G, 0, X₂, X₃, 0, G)
t₀: f10(X₀, X₁, X₂, X₃, X₄, X₅) → f16(X₀, 0, G, G, X₄, X₅) :|: X₀ ≤ 0
t₅: f10(X₀, X₁, X₂, X₃, X₄, X₅) → f25(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀
t₄: f16(X₀, X₁, X₂, X₃, X₄, X₅) → f10(G, X₁, X₂, X₃, 0, G) :|: X₃ ≤ 0
t₁: f16(X₀, X₁, X₂, X₃, X₄, X₅) → f16(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₃
t₂: f25(X₀, X₁, X₂, X₃, X₄, X₅) → f25(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: f27(X₀, X₁, X₂, X₃, X₄, X₅) → f30(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

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

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

Found invariant X₀ ≤ 0 for location f16

Found invariant 1 ≤ X₀ for location f25

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: G
Locations: f0, f10, f16, f25
Transitions:
t₁₅: f0(X₀, X₁) → f10(G, X₁)
t₁₆: f10(X₀, X₁) → f16(X₀, G) :|: X₀ ≤ 0
t₁₇: f10(X₀, X₁) → f25(X₀, X₁) :|: 1 ≤ X₀
t₁₈: f16(X₀, X₁) → f10(G, X₁) :|: X₁ ≤ 0 ∧ X₀ ≤ 0
t₁₉: f16(X₀, X₁) → f16(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₂₀: f25(X₀, X₁) → f25(X₀, X₁) :|: 1 ≤ X₀

Found invariant X₀ ≤ 0 for location f16_v1

Found invariant 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location f16_v2

Found invariant X₁ ≤ 0 for location f10_v1

Found invariant 1 ≤ X₀ for location f25

Found invariant X₀ ≤ 0 for location f16

Found invariant 1 ≤ X₀ for location f25_v1

Found invariant 1 ≤ X₀ for location f25

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

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