Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(C, X₁) :|: 0 ≤ C ∧ X₀ ≤ 14 ∧ 14 ≤ X₀
t₄: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 15 ≤ X₀ ∧ 1 ≤ X₀
t₅: l1(X₀, X₁) → l1(X₀-1, X₁) :|: X₀ ≤ 13 ∧ 1 ≤ X₀
t₀: l1(X₀, X₁) → l2(C, D) :|: C+1 ≤ 0 ∧ X₀ ≤ 14 ∧ 14 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀-1, C) :|: 15 ≤ X₀ ∧ X₀ ≤ 0
t₃: l1(X₀, X₁) → l2(X₀-1, C) :|: X₀ ≤ 13 ∧ X₀ ≤ 0

Preprocessing

Cut unsatisfiable transition t₂: l1→l2

Eliminate variables {D,X₁} that do not contribute to the problem

Found invariant 1+X₀ ≤ 0 for location l2

Problem after Preprocessing

Start: l0
Program_Vars: X₀
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₂₂: l0(X₀) → l1(X₀)
t₂₃: l1(X₀) → l1(C) :|: 0 ≤ C ∧ X₀ ≤ 14 ∧ 14 ≤ X₀
t₂₄: l1(X₀) → l1(X₀-1) :|: 15 ≤ X₀ ∧ 1 ≤ X₀
t₂₅: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 13 ∧ 1 ≤ X₀
t₂₆: l1(X₀) → l2(C) :|: C+1 ≤ 0 ∧ X₀ ≤ 14 ∧ 14 ≤ X₀
t₂₇: l1(X₀) → l2(X₀-1) :|: X₀ ≤ 13 ∧ X₀ ≤ 0

Analysing control-flow refined program

Cut unsatisfiable transition t₁₂₉: n_l1___2→l2

Cut unsatisfiable transition t₁₃₁: n_l1___1→l2

Cut unsatisfiable transition t₁₃₅: n_l1___2→l2

Found invariant 1+X₀ ≤ 0 for location l2

Found invariant 14 ≤ X₀ for location n_l1___2

Found invariant 0 ≤ X₀ for location n_l1___3

Found invariant X₀ ≤ 12 ∧ 0 ≤ X₀ for location n_l1___1

MPRF for transition t₁₀₄: n_l1___1(X₀) → n_l1___1(X₀-1) :|: X₀ ≤ 13 ∧ 0 ≤ X₀ ∧ 0 ≤ X₀ ∧ X₀ ≤ 12 ∧ 1 ≤ X₀ ∧ X₀ ≤ 13 ∧ X₀ ≤ 12 ∧ 0 ≤ X₀ of depth 1:

new bound:

26 {O(1)}

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₂₆: 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₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}

Sizebounds

t₂₂, X₀: X₀ {O(n)}
t₂₅, X₀: 12 {O(1)}