Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇
Temp_Vars: S, T, U, V
Locations: l0, l1, l2, l3, l4, l5, l6
Transitions:
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l1(X₀, 1, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₀ ≤ 0
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l1(X₀, 1, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 2 ≤ X₀
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l3(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₀ ≤ 1 ∧ 1 ≤ X₀
t₁₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₀ ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l4(X₀, X₁, X₁+1, S, T, 1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₁ ≤ X₀
t₅: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l2(X₀, X₁, X₂, X₃, X₄, X₅+1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₅ ≤ X₁
t₁₀: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l3(X₀, X₁, X₀, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₁ ≤ X₅ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀
t₁₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l6(X₀, X₁, X₂, X₃, X₄, 1, S, T, U, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₂+1 ≤ X₀ ∧ 1+X₁ ≤ X₅
t₁₂: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l6(X₀, X₁, X₂, X₃, X₄, 1, S, T, U, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₅
t₁₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l2(X₀, X₁, X₂, X₃, X₄, 1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₄+1 ≤ 0 ∧ 1+X₁ ≤ X₅
t₁₄: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l2(X₀, X₁, X₂, X₃, X₄, 1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1 ≤ X₄ ∧ 1+X₁ ≤ X₅
t₁₅: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l2(X₀, X₁, X₂, X₃, 0, 1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₁ ≤ X₅ ∧ X₄ ≤ 0 ∧ 0 ≤ X₄
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l4(X₀, X₁, X₂, S, T, X₅+1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₅ ≤ X₁
t₈: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l1(X₀, X₁+1, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₉ ≤ X₅
t₇: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l5(X₀, X₁, X₂, X₃, X₄, X₅+1, X₆, X₇, X₈, X₉, X₁₀-1, S, T, U, V, X₁₀, X₁₆, X₁₇) :|: X₅ ≤ X₉
t₉: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l5(X₀, X₁, X₂, X₃, X₄, 1, X₆, X₇, X₈, S, X₁, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, T, U) :|: 1+X₁ ≤ X₅
t₆: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) → l6(X₀, X₁, X₂, X₃, X₄, X₅+1, S, T, U, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: X₅ ≤ X₁

Preprocessing

Eliminate variables {U,V,X₃,X₆,X₇,X₈,X₁₀,X₁₁,X₁₂,X₁₃,X₁₄,X₁₅,X₁₆,X₁₇} that do not contribute to the problem

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁ for location l2

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁ for location l6

Found invariant 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁ for location l5

Found invariant 1 ≤ X₁ for location l1

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁ for location l4

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₄, X₅, X₉
Temp_Vars: S, T
Locations: l0, l1, l2, l3, l4, l5, l6
Transitions:
t₃₅: l0(X₀, X₁, X₂, X₄, X₅, X₉) → l1(X₀, 1, X₂, X₄, X₅, X₉) :|: X₀ ≤ 0
t₃₆: l0(X₀, X₁, X₂, X₄, X₅, X₉) → l1(X₀, 1, X₂, X₄, X₅, X₉) :|: 2 ≤ X₀
t₃₄: l0(X₀, X₁, X₂, X₄, X₅, X₉) → l3(1, X₁, X₂, X₄, X₅, X₉) :|: X₀ ≤ 1 ∧ 1 ≤ X₀
t₃₈: l1(X₀, X₁, X₂, X₄, X₅, X₉) → l3(X₀, X₁, X₂, X₄, X₅, X₉) :|: 1+X₀ ≤ X₁ ∧ 1 ≤ X₁
t₃₇: l1(X₀, X₁, X₂, X₄, X₅, X₉) → l4(X₀, X₁, X₁+1, T, 1, X₉) :|: X₁ ≤ X₀ ∧ 1 ≤ X₁
t₃₉: l2(X₀, X₁, X₂, X₄, X₅, X₉) → l2(X₀, X₁, X₂, X₄, X₅+1, X₉) :|: X₅ ≤ X₁ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₀: l2(X₀, X₁, X₂, X₄, X₅, X₉) → l3(X₀, X₁, X₀, X₄, X₅, X₉) :|: 1+X₁ ≤ X₅ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₁: l2(X₀, X₁, X₂, X₄, X₅, X₉) → l6(X₀, X₁, X₂, X₄, 1, X₉) :|: X₂+1 ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₂: l2(X₀, X₁, X₂, X₄, X₅, X₉) → l6(X₀, X₁, X₂, X₄, 1, X₉) :|: 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₄: l4(X₀, X₁, X₂, X₄, X₅, X₉) → l2(X₀, X₁, X₂, X₄, 1, X₉) :|: X₄+1 ≤ 0 ∧ 1+X₁ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₅: l4(X₀, X₁, X₂, X₄, X₅, X₉) → l2(X₀, X₁, X₂, X₄, 1, X₉) :|: 1 ≤ X₄ ∧ 1+X₁ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₆: l4(X₀, X₁, X₂, X₄, X₅, X₉) → l2(X₀, X₁, X₂, 0, 1, X₉) :|: 1+X₁ ≤ X₅ ∧ X₄ ≤ 0 ∧ 0 ≤ X₄ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₃: l4(X₀, X₁, X₂, X₄, X₅, X₉) → l4(X₀, X₁, X₂, T, X₅+1, X₉) :|: X₅ ≤ X₁ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₈: l5(X₀, X₁, X₂, X₄, X₅, X₉) → l1(X₀, X₁+1, X₂, X₄, X₅, X₉) :|: 1+X₉ ≤ X₅ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₇: l5(X₀, X₁, X₂, X₄, X₅, X₉) → l5(X₀, X₁, X₂, X₄, X₅+1, X₉) :|: X₅ ≤ X₉ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₅₀: l6(X₀, X₁, X₂, X₄, X₅, X₉) → l5(X₀, X₁, X₂, X₄, 1, S) :|: 1+X₁ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁
t₄₉: l6(X₀, X₁, X₂, X₄, X₅, X₉) → l6(X₀, X₁, X₂, X₄, X₅+1, X₉) :|: X₅ ≤ X₁ ∧ X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₂ ≤ 1+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₁

Analysing control-flow refined program

Cut unsatisfiable transition t₁₄₉₆: n_l2___10→l3

Cut unsatisfiable transition t₁₄₉₈: n_l2___8→l3

Cut unsatisfiable transition t₁₄₉₉: n_l2___9→l3

Found invariant X₅ ≤ 1 ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 2+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 4 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l6___6

Found invariant 1 ≤ X₉ ∧ 3 ≤ X₅+X₉ ∧ X₅ ≤ 1+X₉ ∧ 3 ≤ X₂+X₉ ∧ 2 ≤ X₁+X₉ ∧ 4 ≤ X₀+X₉ ∧ 2 ≤ X₅ ∧ 4 ≤ X₂+X₅ ∧ 3 ≤ X₁+X₅ ∧ 5 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l5___1

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₂+X₅ ∧ 3 ≤ X₁+X₅ ∧ 4 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l2___7

Found invariant 1 ≤ 0 for location n_l6___5

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ 1+X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₂+X₅ ∧ 3 ≤ X₁+X₅ ∧ 5 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l6___4

Found invariant X₅ ≤ 1 ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l4___12

Found invariant 1+X₉ ≤ X₅ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 3 ≤ X₁+X₅ ∧ 4 ≤ X₀+X₅ ∧ X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l1___2

Found invariant X₅ ≤ 1 ∧ X₅ ≤ X₄ ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ 1 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 2 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l2___9

Found invariant X₁ ≤ 1 ∧ 1 ≤ X₁ for location l1

Found invariant X₅ ≤ 1 ∧ X₄+X₅ ≤ 0 ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 3+X₄ ≤ X₂ ∧ 2+X₄ ≤ X₁ ∧ 3+X₄ ≤ X₀ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l2___10

Found invariant X₅ ≤ 1 ∧ X₅ ≤ 1+X₄ ∧ X₄+X₅ ≤ 1 ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 1 ≤ X₄+X₅ ∧ 1+X₄ ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 2+X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ 1 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l2___8

Found invariant X₅ ≤ X₂ ∧ X₅ ≤ 1+X₁ ∧ X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₂+X₅ ∧ 3 ≤ X₁+X₅ ∧ 4 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l4___11

Found invariant X₅ ≤ 1 ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 2+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 2 ≤ X₁+X₅ ∧ 4 ≤ X₀+X₅ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l5___3

Cut unsatisfiable transition t₁₄₉₅: n_l1___2→l3

Cut unsatisfiable transition t₁₄₄₂: n_l2___7→n_l6___5

Cut unsatisfiable transition t₁₄₅₇: n_l6___5→n_l6___4

Cut unreachable locations [n_l6___5] from the program graph

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₃₈: 1 {O(1)}
t₃₉: inf {Infinity}
t₄₀: 1 {O(1)}
t₄₁: inf {Infinity}
t₄₂: inf {Infinity}
t₄₃: inf {Infinity}
t₄₄: inf {Infinity}
t₄₅: inf {Infinity}
t₄₆: inf {Infinity}
t₄₇: inf {Infinity}
t₄₈: inf {Infinity}
t₄₉: inf {Infinity}
t₅₀: inf {Infinity}

Costbounds

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

Sizebounds

t₃₄, X₀: 1 {O(1)}
t₃₄, X₁: X₁ {O(n)}
t₃₄, X₂: X₂ {O(n)}
t₃₄, X₄: X₄ {O(n)}
t₃₄, X₅: X₅ {O(n)}
t₃₄, X₉: X₉ {O(n)}
t₃₅, X₀: X₀ {O(n)}
t₃₅, X₁: 1 {O(1)}
t₃₅, X₂: X₂ {O(n)}
t₃₅, X₄: X₄ {O(n)}
t₃₅, X₅: X₅ {O(n)}
t₃₅, X₉: X₉ {O(n)}
t₃₆, X₀: X₀ {O(n)}
t₃₆, X₁: 1 {O(1)}
t₃₆, X₂: X₂ {O(n)}
t₃₆, X₄: X₄ {O(n)}
t₃₆, X₅: X₅ {O(n)}
t₃₆, X₉: X₉ {O(n)}
t₃₇, X₀: X₀ {O(n)}
t₃₇, X₅: 1 {O(1)}
t₃₈, X₀: 2⋅X₀ {O(n)}
t₃₉, X₀: X₀ {O(n)}
t₄₀, X₀: X₀ {O(n)}
t₄₀, X₂: X₀ {O(n)}
t₄₁, X₀: X₀ {O(n)}
t₄₁, X₅: 1 {O(1)}
t₄₂, X₀: X₀ {O(n)}
t₄₂, X₅: 1 {O(1)}
t₄₃, X₀: X₀ {O(n)}
t₄₄, X₀: X₀ {O(n)}
t₄₄, X₅: 1 {O(1)}
t₄₅, X₀: X₀ {O(n)}
t₄₅, X₅: 1 {O(1)}
t₄₆, X₀: X₀ {O(n)}
t₄₆, X₄: 0 {O(1)}
t₄₆, X₅: 1 {O(1)}
t₄₇, X₀: X₀ {O(n)}
t₄₈, X₀: X₀ {O(n)}
t₄₉, X₀: X₀ {O(n)}
t₅₀, X₀: X₀ {O(n)}
t₅₀, X₅: 1 {O(1)}