Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₆: l0(X₀, X₁, X₂, X₃) → l4(X₁, X₁, X₃, X₃)
t₃: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂+1 ≤ X₀ ∧ X₀ ≤ X₂+2 ∧ X₀ ≤ 9 ∧ 0 ≤ X₂ ∧ X₂ ≤ 9
t₁: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂ ∧ 0 ≤ X₂ ∧ X₂ ≤ 9
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₂+3 ≤ X₀ ∧ 0 ≤ X₂ ∧ X₂ ≤ 9
t₄: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 10 ≤ X₀ ∧ X₂+1 ≤ X₀ ∧ X₀ ≤ X₂+2 ∧ 0 ≤ X₂ ∧ X₂ ≤ 9
t₅: l2(X₀, X₁, X₂, X₃) → l1(E, X₁, X₀, X₃) :|: X₀ ≤ X₂+2 ∧ X₀ ≤ 9 ∧ 0 ≤ X₂ ∧ X₂+1 ≤ X₀
t₀: l4(X₀, X₁, X₂, X₃) → l1(E, X₁, 0, X₃) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂

Preprocessing

Found invariant X₂ ≤ 8 ∧ 1+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 17 ∧ 0 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ X₀ ≤ 9 ∧ 1 ≤ X₀ for location l2

Found invariant X₂ ≤ 9 ∧ 0 ≤ X₂ for location l1

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

Found invariant X₂ ≤ 9 ∧ 0 ≤ X₂ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₆: l0(X₀, X₁, X₂, X₃) → l4(X₁, X₁, X₃, X₃)
t₃: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂+1 ≤ X₀ ∧ X₀ ≤ X₂+2 ∧ X₀ ≤ 9 ∧ 0 ≤ X₂ ∧ X₂ ≤ 9 ∧ X₂ ≤ 9 ∧ 0 ≤ X₂
t₁: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂ ∧ 0 ≤ X₂ ∧ X₂ ≤ 9 ∧ X₂ ≤ 9 ∧ 0 ≤ X₂
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₂+3 ≤ X₀ ∧ 0 ≤ X₂ ∧ X₂ ≤ 9 ∧ X₂ ≤ 9 ∧ 0 ≤ X₂
t₄: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 10 ≤ X₀ ∧ X₂+1 ≤ X₀ ∧ X₀ ≤ X₂+2 ∧ 0 ≤ X₂ ∧ X₂ ≤ 9 ∧ X₂ ≤ 9 ∧ 0 ≤ X₂
t₅: l2(X₀, X₁, X₂, X₃) → l1(E, X₁, X₀, X₃) :|: X₀ ≤ X₂+2 ∧ X₀ ≤ 9 ∧ 0 ≤ X₂ ∧ X₂+1 ≤ X₀ ∧ X₂ ≤ 8 ∧ 1+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 17 ∧ 0 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ X₀ ≤ 9 ∧ 1 ≤ X₀
t₀: l4(X₀, X₁, X₂, X₃) → l1(E, X₁, 0, X₃) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₃ ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁

Analysing control-flow refined program

Cut unsatisfiable transition t₄: l1→l3

Found invariant X₂ ≤ 9 ∧ 1 ≤ X₂ for location n_l1___2

Found invariant X₂ ≤ 8 ∧ 1+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 17 ∧ 1 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ X₀ ≤ 9 ∧ 2 ≤ X₀ for location n_l2___1

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

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

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

Found invariant X₂ ≤ 9 ∧ 0 ≤ X₂ for location l3

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
t₆: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
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₃: X₃ {O(n)}
t₁, X₁: 2⋅X₁ {O(n)}
t₁, X₂: 9 {O(1)}
t₁, X₃: 2⋅X₃ {O(n)}
t₂, X₁: 2⋅X₁ {O(n)}
t₂, X₂: 9 {O(1)}
t₂, X₃: 2⋅X₃ {O(n)}
t₃, X₀: 9 {O(1)}
t₃, X₁: X₁ {O(n)}
t₃, X₂: 8 {O(1)}
t₃, X₃: X₃ {O(n)}
t₄, X₀: 11 {O(1)}
t₄, X₁: X₁ {O(n)}
t₄, X₂: 9 {O(1)}
t₄, X₃: X₃ {O(n)}
t₅, X₁: X₁ {O(n)}
t₅, X₂: 9 {O(1)}
t₅, X₃: X₃ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: 0 {O(1)}
t₀, X₃: X₃ {O(n)}