Initial Problem

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₀
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l1(X₀+5, X₁, X₂)
t₅: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)

Preprocessing

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

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

Found invariant X₁ ≤ X₀ for location l1

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

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

Problem after Preprocessing

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

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

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

Analysing control-flow refined program

Cut unsatisfiable transition t₃₇: l3→l4

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

Found invariant X₁ ≤ X₀ for location l1

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

Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 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₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___3

Found invariant 5+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5 ≤ X₀ for location n_l1___2

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

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

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

Found invariant 5+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 5 ≤ X₀ for location n_l3___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₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
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₁₅: 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₀: X₁ {O(n)}
t₁₆, X₁: X₁ {O(n)}