Initial Problem

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

Preprocessing

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

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

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

Found invariant 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 l5

Found invariant X₀ ≤ X₃ for location l1

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

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

Problem after Preprocessing

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

Analysing control-flow refined program

Cut unsatisfiable transition t₂₁₅: n_l1___1→l4

Cut unsatisfiable transition t₁₉₇: n_l1___6→n_l3___5

Cut unreachable locations [n_l3___5] from the program graph

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

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

Found invariant 2 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l6___2

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

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

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

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

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

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

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

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

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