Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, 3, X₂, X₃, X₄) :|: X₀ < 10
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: 10 ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l1(0, X₁, X₂, X₃, X₄)
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: 12 ≤ X₁
t₄: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: X₁ < 12
t₈: l4(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄)
t₇: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀+1, X₁, X₂, X₃, X₄)
t₆: l6(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁+1, X₂, X₃, X₄)

Preprocessing

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

Found invariant X₁ ≤ 11 ∧ X₁ ≤ 11+X₀ ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l6

Found invariant 10 ≤ X₀ for location l7

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

Found invariant 0 ≤ X₀ for location l1

Found invariant 10 ≤ X₀ for location l4

Found invariant 3 ≤ X₁ ∧ 3 ≤ 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, l6, l7
Transitions:
t₁₈: l0(X₀, X₁) → l2(X₀, X₁)
t₁₉: l1(X₀, X₁) → l3(X₀, 3) :|: X₀ < 10 ∧ 0 ≤ X₀
t₂₀: l1(X₀, X₁) → l4(X₀, X₁) :|: 10 ≤ X₀ ∧ 0 ≤ X₀
t₂₁: l2(X₀, X₁) → l1(0, X₁)
t₂₃: l3(X₀, X₁) → l5(X₀, X₁) :|: 12 ≤ X₁ ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₂: l3(X₀, X₁) → l6(X₀, X₁) :|: X₁ < 12 ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₄: l4(X₀, X₁) → l7(X₀, X₁) :|: 10 ≤ X₀
t₂₅: l5(X₀, X₁) → l1(X₀+1, X₁) :|: 12 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₆: l6(X₀, X₁) → l3(X₀, X₁+1) :|: X₁ ≤ 11 ∧ X₁ ≤ 11+X₀ ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 0 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₂₀: l1→l4

Found invariant X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 3 ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 3+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l6___9

Found invariant X₁ ≤ 3 ∧ X₁ ≤ 2+X₀ ∧ X₀+X₁ ≤ 12 ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ 6+X₁ ∧ X₀ ≤ 9 ∧ 1 ≤ X₀ for location n_l6___1

Found invariant X₁ ≤ 11 ∧ X₁ ≤ 11+X₀ ∧ 4 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l6___4

Found invariant X₁ ≤ 12 ∧ X₁ ≤ 12+X₀ ∧ 12 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l5___5

Found invariant X₁ ≤ 12 ∧ X₁ ≤ 12+X₀ ∧ 4 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l3___6

Found invariant X₁ ≤ 12 ∧ X₁ ≤ 11+X₀ ∧ 12 ≤ X₁ ∧ 13 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___3

Found invariant X₁ ≤ 12 ∧ X₁ ≤ 2+X₀ ∧ 12 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 10 ≤ X₀ for location l7

Found invariant X₁ ≤ 4 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 4 ∧ 4 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___8

Found invariant X₁ ≤ 3 ∧ X₁ ≤ 2+X₀ ∧ X₀+X₁ ≤ 12 ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ 6+X₁ ∧ X₀ ≤ 9 ∧ 1 ≤ X₀ for location n_l3___2

Found invariant X₁ ≤ 4 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 4 ∧ 4 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l6___7

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

Found invariant X₁ ≤ 12 ∧ X₁ ≤ 2+X₀ ∧ 12 ≤ X₁ ∧ 22 ≤ X₀+X₁ ∧ 10 ≤ X₀ for location l4

Found invariant X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 3 ∧ 3 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 3+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___10

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

Costbounds

Overall costbound: inf {Infinity}
t₁₈: 1 {O(1)}
t₁₉: inf {Infinity}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: inf {Infinity}
t₂₄: 1 {O(1)}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}

Sizebounds

t₁₈, X₀: X₀ {O(n)}
t₁₈, X₁: X₁ {O(n)}
t₁₉, X₀: 9 {O(1)}
t₁₉, X₁: 3 {O(1)}
t₂₀, X₀: 10 {O(1)}
t₂₀, X₁: 12 {O(1)}
t₂₁, X₀: 0 {O(1)}
t₂₁, X₁: X₁ {O(n)}
t₂₂, X₀: 9 {O(1)}
t₂₂, X₁: 11 {O(1)}
t₂₃, X₀: 9 {O(1)}
t₂₃, X₁: 12 {O(1)}
t₂₄, X₀: 10 {O(1)}
t₂₄, X₁: 12 {O(1)}
t₂₅, X₀: 10 {O(1)}
t₂₅, X₁: 12 {O(1)}
t₂₆, X₀: 9 {O(1)}
t₂₆, X₁: 12 {O(1)}