Initial Problem

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

Preprocessing

Cut unreachable locations [l3] from the program graph

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

Found invariant 0 ≤ X₀ for location l1

Found invariant X₂ ≤ 0 for location l4

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₂
Temp_Vars: H, I
Locations: l0, l1, l2, l4
Transitions:
t₁₂: l0(X₀, X₂) → l2(H, I)
t₁₄: l1(X₀, X₂) → l1(X₀-1, X₂-1) :|: 1 ≤ X₀ ∧ 0 ≤ X₀
t₁₃: l1(X₀, X₂) → l2(X₀, X₂) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₆: l2(X₀, X₂) → l1(H, X₂) :|: 1 ≤ H ∧ 1 ≤ X₂
t₁₅: l2(X₀, X₂) → l4(X₀, X₂) :|: X₂ ≤ 0

Analysing control-flow refined program

Found invariant 0 ≤ X₀ for location n_l1___2

Found invariant 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₀ for location n_l1___3

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

Found invariant X₂ ≤ 0 for location l4

CFR did not improve the program. Rolling back

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