Initial Problem

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

Preprocessing

Found invariant 0 ≤ 1+X₆ ∧ 0 ≤ 1+X₄+X₆ ∧ 0 ≤ 1+X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 0 ≤ 1+X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₀ for location l2

Found invariant 0 ≤ 1+X₆ ∧ 0 ≤ 2+X₄+X₆ ∧ 0 ≤ 1+X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 0 ≤ 1+X₁+X₆ ∧ 0 ≤ 1+X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 0 ≤ 1+X₄ ∧ 0 ≤ 1+X₃+X₄ ∧ X₃ ≤ 1+X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ 0 ≤ 1+X₀+X₄ ∧ X₀ ≤ 1+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₂ for location l4

Found invariant X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l3

Problem after Preprocessing

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

Analysing control-flow refined program

Cut unsatisfiable transition t₂₀₈: n_l1___2→l3

Cut unsatisfiable transition t₂₀₉: n_l1___3→l3

Cut unsatisfiable transition t₂₁₀: n_l1___5→l3

Cut unsatisfiable transition t₂₀₅: n_l2___1→l3

Cut unsatisfiable transition t₂₁₂: n_l2___1→l3

Found invariant 0 ≤ 1+X₆ ∧ 0 ≤ 1+X₄+X₆ ∧ 0 ≤ 1+X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 0 ≤ 1+X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀ for location l2

Found invariant 1+X₆ ≤ X₄ ∧ 1+X₆ ≤ X₁ ∧ 0 ≤ X₆ ∧ 1 ≤ X₄+X₆ ∧ X₄ ≤ 1+X₆ ∧ 1 ≤ X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 1 ≤ X₁+X₆ ∧ X₁ ≤ 2+X₆ ∧ 1 ≤ X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ X₄ ≤ X₁ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ 1+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l2___6

Found invariant X₆ ≤ X₄ ∧ 1+X₆ ≤ X₁ ∧ 0 ≤ X₆ ∧ 0 ≤ X₄+X₆ ∧ X₄ ≤ X₆ ∧ 1 ≤ X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 1 ≤ X₁+X₆ ∧ X₁ ≤ 1+X₆ ∧ 1 ≤ X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 1+X₄ ≤ X₁ ∧ 0 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ X₃ ≤ 1+X₄ ∧ 1 ≤ X₁+X₄ ∧ X₁ ≤ 1+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 1+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___7

Found invariant X₆ ≤ X₄ ∧ 1+X₆ ≤ X₁ ∧ 2 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ X₄ ≤ X₆ ∧ 4 ≤ X₃+X₆ ∧ X₃ ≤ X₆ ∧ 5 ≤ X₁+X₆ ∧ X₁ ≤ 1+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1+X₄ ≤ X₁ ∧ 2 ≤ X₄ ∧ 4 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ X₁ ≤ 1+X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 2 ≤ X₃ ∧ 5 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l1___2

Found invariant X₆ ≤ X₄ ∧ 3 ≤ X₆ ∧ 6 ≤ X₄+X₆ ∧ X₄ ≤ X₆ ∧ 5 ≤ X₃+X₆ ∧ 1+X₃ ≤ X₆ ∧ 5 ≤ X₁+X₆ ∧ 1+X₁ ≤ X₆ ∧ 5 ≤ X₀+X₆ ∧ 1+X₀ ≤ X₆ ∧ 3 ≤ X₄ ∧ 5 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 5 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 2 ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l1___3

Found invariant 1+X₆ ≤ X₄ ∧ 2 ≤ X₆ ∧ 5 ≤ X₄+X₆ ∧ X₄ ≤ 1+X₆ ∧ 4 ≤ X₃+X₆ ∧ X₃ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ X₁ ≤ X₆ ∧ 4 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 3 ≤ X₄ ∧ 5 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 5 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 2 ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___1

Found invariant X₆ ≤ X₄ ∧ X₆ ≤ X₁ ∧ 1 ≤ X₆ ∧ 2 ≤ X₄+X₆ ∧ X₄ ≤ X₆ ∧ 2 ≤ X₃+X₆ ∧ X₃ ≤ X₆ ∧ 2 ≤ X₁+X₆ ∧ X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ X₄ ≤ X₁ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ X₃ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___5

Found invariant 0 ≤ 1+X₆ ∧ 0 ≤ 2+X₄+X₆ ∧ 0 ≤ 1+X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 0 ≤ 1+X₁+X₆ ∧ 0 ≤ 1+X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 0 ≤ 1+X₄ ∧ 0 ≤ 1+X₃+X₄ ∧ X₃ ≤ 1+X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ 0 ≤ 1+X₀+X₄ ∧ X₀ ≤ 1+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₂ for location l4

Found invariant X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l3

Found invariant 2+X₆ ≤ X₄ ∧ 0 ≤ X₆ ∧ 2 ≤ X₄+X₆ ∧ 1 ≤ X₃+X₆ ∧ X₃ ≤ 1+X₆ ∧ 1 ≤ X₀+X₆ ∧ X₀ ≤ 1+X₆ ∧ 2 ≤ X₄ ∧ 3 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location n_l2___4

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

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₆: X₇ {O(n)}
t₉, X₇: X₇ {O(n)}
t₆, X₀: 5⋅X₀ {O(n)}
t₆, X₁: 40⋅X₀+20 {O(n)}
t₆, X₂: 5⋅X₂ {O(n)}
t₆, X₃: 5⋅X₀ {O(n)}
t₆, X₄: 10⋅X₀+6 {O(n)}
t₆, X₅: 5⋅X₅ {O(n)}
t₆, X₆: 20⋅X₀+12 {O(n)}
t₆, X₇: 5⋅X₇ {O(n)}
t₇, X₀: 4⋅X₀ {O(n)}
t₇, X₁: 120⋅X₀+64 {O(n)}
t₇, X₂: 4⋅X₂ {O(n)}
t₇, X₃: 4⋅X₀ {O(n)}
t₇, X₄: 8⋅X₀+4 {O(n)}
t₇, X₅: 4⋅X₅ {O(n)}
t₇, X₆: 38⋅X₀+20 {O(n)}
t₇, X₇: 4⋅X₇ {O(n)}
t₈, X₀: 4⋅X₀ {O(n)}
t₈, X₁: 38⋅X₀+20 {O(n)}
t₈, X₂: 4⋅X₂ {O(n)}
t₈, X₃: 4⋅X₀ {O(n)}
t₈, X₄: 8⋅X₀+4 {O(n)}
t₈, X₅: 4⋅X₅ {O(n)}
t₈, X₆: 18⋅X₀+10 {O(n)}
t₈, X₇: 4⋅X₇ {O(n)}
t₃, X₀: 9⋅X₀ {O(n)}
t₃, X₁: 2⋅X₂+240⋅X₀+128 {O(n)}
t₃, X₂: 9⋅X₂ {O(n)}
t₃, X₃: 9⋅X₀ {O(n)}
t₃, X₄: 18⋅X₀+8 {O(n)}
t₃, X₅: 9⋅X₅ {O(n)}
t₃, X₆: 80⋅X₀+44 {O(n)}
t₃, X₇: 9⋅X₇ {O(n)}
t₄, X₀: 4⋅X₀ {O(n)}
t₄, X₁: 120⋅X₀+X₂+64 {O(n)}
t₄, X₂: 4⋅X₂ {O(n)}
t₄, X₃: 4⋅X₀ {O(n)}
t₄, X₄: 8⋅X₀+4 {O(n)}
t₄, X₅: 4⋅X₅ {O(n)}
t₄, X₆: 40⋅X₀+22 {O(n)}
t₄, X₇: 4⋅X₇ {O(n)}
t₅, X₀: 4⋅X₀ {O(n)}
t₅, X₁: 80⋅X₀+44 {O(n)}
t₅, X₂: 4⋅X₂ {O(n)}
t₅, X₃: 4⋅X₀ {O(n)}
t₅, X₄: 8⋅X₀+4 {O(n)}
t₅, X₅: 4⋅X₅ {O(n)}
t₅, X₆: 18⋅X₀+8 {O(n)}
t₅, X₇: 4⋅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₅: 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₃: X₀ {O(n)}
t₁, X₄: 2⋅X₀ {O(n)}
t₁, X₅: X₅ {O(n)}
t₁, X₆: 2⋅X₀+2 {O(n)}
t₁, X₇: X₇ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: 2⋅X₀ {O(n)}
t₂, X₂: X₂ {O(n)}
t₂, X₃: X₀ {O(n)}
t₂, X₄: 2⋅X₀+2 {O(n)}
t₂, X₅: X₅ {O(n)}
t₂, X₆: 2⋅X₀+2 {O(n)}
t₂, X₇: X₇ {O(n)}