Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄)
t₉: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₃ ≤ X₁
t₈: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₁+1 ≤ X₃
t₁₀: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: F+1 ≤ 0
t₁₁: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ F
t₁₂: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄)
t₁₃: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃+1, X₄)
t₁₄: l4(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₀-1, X₃)
t₅: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₂, X₄) :|: F+1 ≤ 0
t₆: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₂, X₄) :|: 1 ≤ F
t₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₀, X₂)
t₁₅: l6(X₀, X₁, X₂, X₃, X₄) → l7(X₃, X₁, X₄-1, X₃, X₄)
t₂: l7(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: 0 ≤ X₀ ∧ 0 ≤ X₂
t₃: l7(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄) :|: X₀+1 ≤ 0
t₄: l7(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄) :|: X₂+1 ≤ 0
t₁₆: l8(X₀, X₁, X₂, X₃, X₄) → l10(X₀, X₁, X₂, X₃, X₄)
t₁: l9(X₀, X₁, X₂, X₃, X₄) → l7(X₁, X₁, 0, X₃, X₄)

Preprocessing

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

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

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

Found invariant 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l5

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

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1

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

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l4

Found invariant X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄)
t₉: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₈: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₁+1 ≤ X₃ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₀: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: F+1 ≤ 0 ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₁: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ F ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₂: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₃: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃+1, X₄) :|: X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₄: l4(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₀-1, X₃) :|: 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₅: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₂, X₄) :|: F+1 ≤ 0 ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₆: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₂, X₄) :|: 1 ≤ F ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₀, X₂) :|: 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₅: l6(X₀, X₁, X₂, X₃, X₄) → l7(X₃, X₁, X₄-1, X₃, X₄) :|: 0 ≤ X₄ ∧ 0 ≤ 1+X₃+X₄ ∧ 0 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 0 ≤ 1+X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₂: l7(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: 0 ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ 1+X₂ ∧ X₀ ≤ X₁
t₃: l7(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄) :|: X₀+1 ≤ 0 ∧ 0 ≤ 1+X₂ ∧ X₀ ≤ X₁
t₄: l7(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄) :|: X₂+1 ≤ 0 ∧ 0 ≤ 1+X₂ ∧ X₀ ≤ X₁
t₁₆: l8(X₀, X₁, X₂, X₃, X₄) → l10(X₀, X₁, X₂, X₃, X₄) :|: 0 ≤ 1+X₂ ∧ X₀ ≤ X₁
t₁: l9(X₀, X₁, X₂, X₃, X₄) → l7(X₁, X₁, 0, X₃, X₄)

Analysing control-flow refined program

Cut unsatisfiable transition t₄: l7→l8

Cut unsatisfiable transition t₁₃₉₉: n_l7___4→l8

Cut unsatisfiable transition t₁₄₀₃: n_l7___7→l8

Found invariant X₄ ≤ 1+X₁ ∧ 1 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 0 ≤ 1+X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l6___3

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

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

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___18

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___15

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___9

Found invariant X₄ ≤ 0 ∧ X₄ ≤ X₃ ∧ X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ 0 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ 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 n_l6___17

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___16

Found invariant X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___13

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___12

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___14

Found invariant X₄ ≤ 1+X₂ ∧ X₄ ≤ 1+X₁ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l5___6

Found invariant X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l7

Found invariant X₂ ≤ 0 ∧ 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 n_l5___19

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

Found invariant X₄ ≤ X₁ ∧ 1 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 0 ≤ 1+X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l6___8

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

Found invariant X₄ ≤ 1+X₂ ∧ X₄ ≤ X₁ ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₃+X₄ ∧ 0 ≤ 1+X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 0 ≤ 1+X₀+X₄ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 0 ≤ 2+X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 0 ≤ 2+X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 2+X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ 1+X₀ for location n_l7___1

Found invariant X₄ ≤ 1+X₂ ∧ X₄ ≤ 1+X₁ ∧ 1 ≤ X₄ ∧ 0 ≤ X₃+X₄ ∧ 1 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 0 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 0 ≤ 1+X₂+X₃ ∧ 0 ≤ 1+X₁+X₃ ∧ 0 ≤ 2+X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ 1+X₀ for location n_l7___7

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___10

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

Found invariant X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___11

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₁₀: 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}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁: 1 {O(1)}

Costbounds

Overall costbound: 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}
t₁₅: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}
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₁+1 {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₁+1 {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: X₁+1 {O(n)}
t₁₀, X₁: X₁ {O(n)}
t₁₁, X₀: X₁+1 {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₂, X₀: X₁+1 {O(n)}
t₁₂, X₁: X₁ {O(n)}
t₁₃, X₀: X₁+1 {O(n)}
t₁₃, X₁: X₁ {O(n)}
t₁₄, X₀: X₁+1 {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₄, X₃: 2⋅X₁+4 {O(n)}
t₅, X₀: X₁+1 {O(n)}
t₅, X₁: X₁ {O(n)}
t₆, X₀: X₁+1 {O(n)}
t₆, X₁: X₁ {O(n)}
t₇, X₀: X₁+1 {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₃: X₁+1 {O(n)}
t₁₅, X₀: X₁+1 {O(n)}
t₁₅, X₁: X₁ {O(n)}
t₁₅, X₃: 3⋅X₁+5 {O(n)}
t₂, X₀: X₁+1 {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₃: 3⋅X₁+X₃+5 {O(n)}
t₃, X₀: 2⋅X₁+1 {O(n)}
t₃, X₁: 2⋅X₁ {O(n)}
t₃, X₃: 3⋅X₁+X₃+5 {O(n)}
t₄, X₀: X₁+1 {O(n)}
t₄, X₁: X₁ {O(n)}
t₄, X₂: 1 {O(1)}
t₄, X₃: 3⋅X₁+5 {O(n)}
t₁₆, X₀: 3⋅X₁+2 {O(n)}
t₁₆, X₁: 3⋅X₁ {O(n)}
t₁₆, X₃: 6⋅X₁+X₃+10 {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: 0 {O(1)}
t₁, X₃: X₃ {O(n)}
t₁, X₄: X₄ {O(n)}