Initial Problem

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

Preprocessing

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

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

Found invariant X₂ ≤ 1 ∧ 0 ≤ X₂ for location l4

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

Cut unsatisfiable transition t₄: l4→l2

Problem after Preprocessing

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

Analysing control-flow refined program

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

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

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

Found invariant X₂ ≤ 0 ∧ 1+X₁+X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ 1+X₁ ≤ X₂ ∧ 1+X₁ ≤ 0 for location n_l1___2

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

Found invariant X₂ ≤ 1 ∧ 0 ≤ X₂ for location l4

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

Sizebounds

t₉, X₁: X₁ {O(n)}
t₉, X₂: 0 {O(1)}
t₀, X₂: 0 {O(1)}
t₁, X₂: 0 {O(1)}
t₂, X₀: 0 {O(1)}
t₂, X₂: 0 {O(1)}
t₆, X₁: 0 {O(1)}
t₆, X₂: 1 {O(1)}
t₇, X₂: 0 {O(1)}
t₈, X₂: 0 {O(1)}
t₃, X₀: 0 {O(1)}
t₃, X₂: 0 {O(1)}
t₅, X₁: 0 {O(1)}
t₅, X₂: 0 {O(1)}