Initial Problem

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

Preprocessing

Cut unsatisfiable transition t₅: l3→l1

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

Found invariant 0 ≤ X₁ for location l5

Found invariant 0 ≤ X₁ for location l1

Found invariant 0 ≤ X₁ for location l4

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

Problem after Preprocessing

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

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₃₃: 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₃₂: 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₃₂: l3→l1 and t₂₇: l1→l3 to t₁₂₉: l3→l3

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

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

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

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₃₀: l2→l1 and t₂₇: l1→l3 to t₁₃₅: l2→l3

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

Chain transitions t₃₀: l2→l1 and t₂₉: l1→l4 to t₁₃₇: l2→l4

Analysing control-flow refined program

Cut unsatisfiable transition t₁₂₃: l3→l4

Cut unsatisfiable transition t₁₂₄: l3→l4

Cut unsatisfiable transition t₁₂₅: l3→l4

Cut unsatisfiable transition t₁₂₆: l3→l4

Cut unsatisfiable transition t₁₂₇: l3→l4

Cut unsatisfiable transition t₁₂₈: l3→l4

Cut unsatisfiable transition t₁₃₃: l3→l4

Cut unsatisfiable transition t₁₃₄: l3→l4

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

Found invariant X₁ ≤ 1 ∧ 0 ≤ X₁ for location l1

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

Found invariant X₂ ≤ 10 ∧ X₂ ≤ 10+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 10+X₀ ∧ X₀+X₂ ≤ 20 ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ 10+X₂ ∧ X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 11 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 10 ∧ 0 ≤ 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₁ ≤ 0 ∧ 9+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 9 ∧ 0 ≤ X₁ ∧ 9 ≤ X₀+X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 9 ∧ 9 ≤ X₀ for location n_l1___12

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

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

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

Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 0 ≤ X₀ for location n_l1___10

Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 10 ∧ 3 ≤ X₀ for location n_l1___3

Found invariant X₁ ≤ 0 ∧ 8+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l1___8

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

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

Found invariant X₂ ≤ 10 ∧ X₂ ≤ 10+X₁ ∧ X₁+X₂ ≤ 10 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 20 ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 10 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 10 ∧ 0 ≤ X₀ for location n_l3___13

Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 10 ∧ 3 ≤ X₀ for location n_l3___2

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

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

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

Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 0 ≤ X₀ for location n_l3___1

Found invariant X₁ ≤ 0 ∧ 8+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l3___7

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₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: inf {Infinity}
t₃₄: inf {Infinity}
t₃₅: 1 {O(1)}

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₃₁: inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: inf {Infinity}
t₃₄: inf {Infinity}
t₃₅: 1 {O(1)}

Sizebounds

t₂₆, X₀: X₀ {O(n)}
t₂₆, X₁: X₁ {O(n)}
t₂₆, X₂: X₂ {O(n)}
t₂₇, X₀: 10 {O(1)}
t₂₇, X₁: 1 {O(1)}
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₁: 0 {O(1)}
t₂₉, X₂: X₂ {O(n)}
t₃₀, X₀: X₂ {O(n)}
t₃₀, X₁: 0 {O(1)}
t₃₀, X₂: X₂ {O(n)}
t₃₁, X₀: 9 {O(1)}
t₃₁, X₁: 0 {O(1)}
t₃₁, X₂: X₂ {O(n)}
t₃₂, X₀: 1 {O(1)}
t₃₂, X₁: 1 {O(1)}
t₃₂, X₂: X₂ {O(n)}
t₃₃, X₀: 10 {O(1)}
t₃₃, X₁: 1 {O(1)}
t₃₃, X₂: X₂ {O(n)}
t₃₄, X₀: 8 {O(1)}
t₃₄, X₁: 0 {O(1)}
t₃₄, X₂: X₂ {O(n)}
t₃₅, X₀: 2⋅X₂ {O(n)}
t₃₅, X₁: 0 {O(1)}
t₃₅, X₂: 2⋅X₂ {O(n)}