Initial Problem

Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀) → l1(0)
t₁: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 41
t₂: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 41 ∧ B+1 ≤ 0
t₃: l1(X₀) → l2(X₀) :|: 42 ≤ X₀

Preprocessing

Found invariant X₀ ≤ 42 ∧ 42 ≤ X₀ for location l2

Found invariant X₀ ≤ 42 ∧ 0 ≤ X₀ for location l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀) → l1(0)
t₁: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 41 ∧ X₀ ≤ 42 ∧ 0 ≤ X₀
t₂: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 41 ∧ B+1 ≤ 0 ∧ X₀ ≤ 42 ∧ 0 ≤ X₀
t₃: l1(X₀) → l2(X₀) :|: 42 ≤ X₀ ∧ X₀ ≤ 42 ∧ 0 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₃: l1→l2

Cut unsatisfiable transition t₈₁: n_l1___2→l2

Found invariant X₀ ≤ 42 ∧ 42 ≤ X₀ for location l2

Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l1___2

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

Found invariant X₀ ≤ 42 ∧ 2 ≤ X₀ for location n_l1___1

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)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}

Sizebounds

t₀, X₀: 0 {O(1)}
t₁, X₀: 42 {O(1)}
t₂, X₀: 42 {O(1)}
t₃, X₀: 42 {O(1)}