Initial Problem

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

Preprocessing

Cut unreachable locations [l2] from the program graph

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

Found invariant 2 ≤ X₀ for location l1

Problem after Preprocessing

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

Analysing control-flow refined program

Found invariant 2 ≤ X₀ for location l1

Found invariant 3 ≤ 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₁₅: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
t₁₈: inf {Infinity}
t₁₉: 1 {O(1)}

Costbounds

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

Sizebounds