Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁) → l8(X₀, X₁)
t₈: l1(X₀, X₁) → l2(X₀, X₁)
t₉: l2(X₀, X₁) → l3(X₀, X₁+1)
t₄: l3(X₀, X₁) → l4(X₀, X₁) :|: 1+X₁ ≤ X₀
t₅: l3(X₀, X₁) → l5(X₀, X₁) :|: X₀ ≤ X₁
t₆: l4(X₀, X₁) → l1(X₀, X₁) :|: D+1 ≤ C
t₇: l4(X₀, X₁) → l2(X₀, X₁) :|: C ≤ D
t₁₀: l5(X₀, X₁) → l6(X₀-1, X₁)
t₂: l6(X₀, X₁) → l3(X₀, 0) :|: 0 ≤ X₀
t₃: l6(X₀, X₁) → l7(X₀, X₁) :|: X₀+1 ≤ 0
t₁₁: l7(X₀, X₁) → l9(X₀, X₁)
t₁: l8(X₀, X₁) → l6(X₀, X₁)

Preprocessing

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

Found invariant 1+X₀ ≤ 0 for location l7

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

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

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

Found invariant 1+X₀ ≤ 0 for location l9

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

Problem after Preprocessing

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

Analysing control-flow refined program

Cut unsatisfiable transition t₄₅₁: n_l6___1→n_l3___12

Cut unsatisfiable transition t₄₆₇: n_l6___2→l7

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

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

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

Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l4___6

Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___4

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

Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l5___10

Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l2___3

Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l3___12

Found invariant 1+X₀ ≤ 0 for location l7

Found invariant 1+X₀ ≤ 0 for location l9

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

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

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

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₅: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₁₀: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}
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₅: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₁₀: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₁₁: 1 {O(1)}
t₁: 1 {O(1)}

Sizebounds

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