Initial Problem

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

Preprocessing

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

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l2

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

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3

Problem after Preprocessing

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

Chain transitions t₃₁: l3→l1 and t₂₉: l1→l5 to t₁₆₀: l3→l5

Chain transitions t₃₁: l3→l1 and t₂₈: l1→l4 to t₁₆₁: l3→l4

Chain transitions t₃₁: l3→l1 and t₂₇: l1→l4 to t₁₆₂: l3→l4

Chain transitions t₃₄: l6→l2 and t₃₀: l2→l3 to t₁₆₃: l6→l3

Chain transitions t₁₆₃: l6→l3 and t₁₆₀: l3→l5 to t₁₆₄: l6→l5

Chain transitions t₁₆₃: l6→l3 and t₁₆₂: l3→l4 to t₁₆₅: l6→l4

Chain transitions t₁₆₃: l6→l3 and t₁₆₁: l3→l4 to t₁₆₆: l6→l4

Chain transitions t₁₆₃: l6→l3 and t₃₁: l3→l1 to t₁₆₇: l6→l1

Chain transitions t₁₆₆: l6→l4 and t₃₂: l4→l6 to t₁₆₈: l6→l6

Chain transitions t₁₆₅: l6→l4 and t₃₂: l4→l6 to t₁₆₉: l6→l6

Chain transitions t₁₆₄: l6→l5 and t₃₃: l5→l6 to t₁₇₀: l6→l6

Analysing control-flow refined program

Eliminate variables {Temp_Int₇₈₅,X₂} that do not contribute to the problem

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l2

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l5

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

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

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

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

Found invariant X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l6

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

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 n_l1___11

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

Found invariant 1 ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___4

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

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ 3 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 1+X₀ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l4___9

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

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ 3 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___2

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₁ ≤ 1+X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l6___14

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

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

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

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 n_l3___12

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

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

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 n_l2___13

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

CFR did not improve the program. Rolling back

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₃₅: 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₃₅: 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₃ {O(n)}
t₂₇, X₄: X₄ {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)}
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₂: 0 {O(1)}
t₃₃, X₃: X₃ {O(n)}
t₃₃, X₄: X₄ {O(n)}
t₃₄, X₃: X₃ {O(n)}
t₃₄, X₄: X₄ {O(n)}
t₃₅, X₃: 3⋅X₃ {O(n)}
t₃₅, X₄: 3⋅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₃: 4⋅X₃ {O(n)}
t₃₈, X₄: 4⋅X₄ {O(n)}