Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₆: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(G, 0, X₂, X₃, 0, G)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, 0, G, G, X₄, X₅) :|: X₀ ≤ 0
t₅: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(G, X₁, X₂, X₃, 0, G) :|: X₃ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₃
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

Cut unreachable locations [l4; l5] from the program graph

Eliminate variables {X₁,X₂,X₄,X₅} that do not contribute to the problem

Found invariant X₀ ≤ 0 for location l2

Found invariant 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: G
Locations: l0, l1, l2, l3
Transitions:
t₁₅: l0(X₀, X₁) → l1(G, X₁)
t₁₆: l1(X₀, X₁) → l2(X₀, G) :|: X₀ ≤ 0
t₁₇: l1(X₀, X₁) → l3(X₀, X₁) :|: 1 ≤ X₀
t₁₈: l2(X₀, X₁) → l1(G, X₁) :|: X₁ ≤ 0 ∧ X₀ ≤ 0
t₁₉: l2(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₂₀: l3(X₀, X₁) → l3(X₀, X₁) :|: 1 ≤ X₀

Chain transitions t₁₈: l2→l1 and t₁₇: l1→l3 to t₄₉: l2→l3

Chain transitions t₁₅: l0→l1 and t₁₇: l1→l3 to t₅₀: l0→l3

Chain transitions t₁₅: l0→l1 and t₁₆: l1→l2 to t₅₁: l0→l2

Chain transitions t₁₈: l2→l1 and t₁₆: l1→l2 to t₅₂: l2→l2

Analysing control-flow refined program

Found invariant X₀ ≤ 0 for location l2

Found invariant 1 ≤ X₀ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant X₁ ≤ 0 for location n_l1___2

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

Found invariant X₀ ≤ 0 for location n_l2___3

Found invariant 1 ≤ X₀ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant X₀ ≤ 0 for location l2

Found invariant 1 ≤ X₀ for location l3

CFR did not improve the program. Rolling back

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)}
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)}