Initial Problem

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

Preprocessing

Cut unsatisfiable transition t₆: l3→l1

Cut unsatisfiable transition t₇: l3→l1

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

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

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

Problem after Preprocessing

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₃) :|: X₀ < X₁
t₂₄: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₁ < X₀
t₂₅: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₂₆: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₂₇: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁+X₃, X₂, X₃) :|: X₁ < X₀ ∧ X₁ < X₀
t₂₈: l3(X₀, X₁, X₂, X₃) → l1(X₀+X₂, X₁, X₂, X₃) :|: X₀ ≤ X₁ ∧ X₀ ≤ X₁
t₂₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₀ ≤ 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→l3 to t₁₀₃: l3→l3

Chain transitions t₂₈: l3→l1 and t₂₄: l1→l3 to t₁₀₄: l3→l3

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→l3 to t₁₀₇: l2→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

Analysing control-flow refined program

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

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

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

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

Found invariant X₃ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ for location n_l3___5

Found invariant 1+X₃ ≤ X₀ ∧ X₂ ≤ X₀ for location n_l1___3

Found invariant X₃ ≤ X₁ ∧ 1+X₂ ≤ X₃ ∧ X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l3___8

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

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

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

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

Found invariant 1+X₃ ≤ X₀ ∧ X₂ ≤ X₀ ∧ 1+X₁ ≤ X₀ for location n_l3___1

Found invariant 1+X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 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₂₄: inf {Infinity}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: inf {Infinity}
t₂₈: inf {Infinity}
t₂₉: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: inf {Infinity}
t₂₄: inf {Infinity}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
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₃: 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₂: 3⋅X₂ {O(n)}
t₂₅, X₃: 3⋅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₂: 3⋅X₂ {O(n)}
t₂₉, X₃: 3⋅X₃ {O(n)}