Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars: I, J, K
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, X₂, X₃, X₄, I, J, I)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, I, J, K, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l2(X₀, I, J, X₃, K, X₅, X₆, X₇) :|: X₀ ≤ 0

Preprocessing

Eliminate variables {I,J,K,X₁,X₂,X₃,X₄,X₅,X₆,X₇} that do not contribute to the problem

Found invariant X₀ ≤ 0 for location l2

Problem after Preprocessing

Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀) → l1(X₀)
t₉: l1(X₀) → l1(X₀) :|: 1 ≤ X₀
t₁₀: l1(X₀) → l2(X₀) :|: X₀ ≤ 0

Found invariant X₀ ≤ 0 for location l2

Analysing control-flow refined program

Found invariant X₀ ≤ 0 for location l2

Found invariant 1 ≤ X₀ for location n_l1___1

Found invariant X₀ ≤ 0 for location l2

Found invariant 1 ≤ X₀ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

t₈, X₀: X₀ {O(n)}
t₉, X₀: X₀ {O(n)}
t₁₀, X₀: X₀ {O(n)}