Initial Problem

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

Preprocessing

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

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

Found invariant X₄ ≤ X₁ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ for location l5

Found invariant X₄ ≤ X₁ ∧ X₂ ≤ X₁ for location l1

Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ 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₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄)
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₂-1, X₁, X₂, X₁, X₄) :|: 1 < X₂ ∧ X₄ ≤ X₁ ∧ X₂ ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₂ ≤ 1 ∧ X₄ ≤ X₁ ∧ X₂ ≤ X₁
t₁₄: l2(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄)
t₂: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₁, X₃, X₁) :|: 1 < X₁
t₁: l3(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ 1
t₆: l4(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: X₃ < X₀ ∧ X₄ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ X₄ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₁₁: l5(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₄ < 0 ∧ X₄ ≤ X₁ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁
t₁₂: l5(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₄ ∧ X₄ ≤ X₁ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁
t₁₃: l5(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ 0 ∧ 0 ≤ X₄ ∧ X₄ ≤ X₁ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁
t₈: l6(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₀, X₃, X₄-X₀) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₄ ≤ X₁ ∧ 2+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₉: l6(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₀, X₃, X₄) :|: X₃ < 0 ∧ X₄ ≤ X₁ ∧ 2+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₁₀: l6(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₀, X₃, X₄) :|: 0 < X₃ ∧ X₄ ≤ X₁ ∧ 2+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₇: l7(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃-X₀, X₄) :|: X₄ ≤ X₁ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ X₂ ≤ 1+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₄: l1→l5

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

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

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

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

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

Found invariant X₄ ≤ X₁ ∧ X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₁ for location l1

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

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

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

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₂: 4⋅X₁ {O(n)}
t₃, X₃: 4⋅X₁ {O(n)}
t₄, X₀: 2⋅X₁ {O(n)}
t₄, X₁: 2⋅X₁ {O(n)}
t₄, X₂: 2⋅X₁ {O(n)}
t₄, X₃: 4⋅X₁ {O(n)}
t₁₄, X₀: 6⋅X₁+X₀ {O(n)}
t₁₄, X₁: 7⋅X₁ {O(n)}
t₁₄, X₂: 6⋅X₁+X₂ {O(n)}
t₁₄, X₃: 12⋅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₁: X₁ {O(n)}
t₅, X₂: 4⋅X₁ {O(n)}
t₅, X₃: 4⋅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)}
t₁₁, X₀: 2⋅X₁ {O(n)}
t₁₁, X₁: 2⋅X₁ {O(n)}
t₁₁, X₂: 2⋅X₁ {O(n)}
t₁₁, X₃: 4⋅X₁ {O(n)}
t₁₂, X₀: 2⋅X₁ {O(n)}
t₁₂, X₁: 2⋅X₁ {O(n)}
t₁₂, X₂: 2⋅X₁ {O(n)}
t₁₂, X₃: 4⋅X₁ {O(n)}
t₁₃, X₀: 2⋅X₁ {O(n)}
t₁₃, X₁: 2⋅X₁ {O(n)}
t₁₃, X₂: 2⋅X₁ {O(n)}
t₁₃, X₃: 4⋅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₃: 0 {O(1)}
t₉, X₀: X₁ {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: X₁ {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₃: 4⋅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)}