Initial Problem

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

Preprocessing

Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ 1 for location l11

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l6

Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ 1 for location l12

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l7

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l8

Found invariant X₂ ≤ X₃ ∧ X₁ ≤ 1 for location l10

Found invariant X₁ ≤ 1 for location l9

Problem after Preprocessing

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

Analysing control-flow refined program

Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ 1 for location l11

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l6

Found invariant X₂ ≤ X₃ ∧ X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ 1 ≤ X₀ for location n_l10___2

Found invariant X₂ ≤ 1+X₃ ∧ X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ 1 ≤ X₀ for location n_l9___4

Found invariant X₄ ≤ X₃ ∧ X₂ ≤ X₃ ∧ X₁ ≤ 1 ∧ X₀+X₁ ≤ 1 ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 0 for location n_l10___1

Found invariant X₄ ≤ X₃ ∧ X₂ ≤ 1+X₃ ∧ X₁ ≤ 1 ∧ X₀+X₁ ≤ 1 ∧ 0 ≤ 1+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 0 for location n_l9___3

Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ 1 for location l12

Found invariant X₄ ≤ X₃ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄ ∧ X₂ ≤ X₃ ∧ X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location n_l10___5

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l7

Found invariant X₁ ≤ 1 ∧ 0 ≤ 1+X₁ for location l8

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

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
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₃: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
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₁: 1 {O(1)}
t₁₂, X₃: 2⋅X₃ {O(n)}
t₁₂, X₄: 2⋅X₄ {O(n)}
t₁₃, X₁: 1 {O(1)}
t₁₃, X₃: 2⋅X₃ {O(n)}
t₁₃, X₄: 2⋅X₄ {O(n)}
t₁₄, X₁: 3 {O(1)}
t₁₄, X₃: 6⋅X₃ {O(n)}
t₁₄, X₄: 6⋅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)}
t₄, X₂: X₂ {O(n)}
t₄, X₃: X₃ {O(n)}
t₄, X₄: X₄ {O(n)}
t₅, X₁: 1 {O(1)}
t₅, X₂: X₂ {O(n)}
t₅, X₃: X₃ {O(n)}
t₅, X₄: X₄ {O(n)}
t₆, X₁: 1 {O(1)}
t₆, X₂: X₂ {O(n)}
t₆, X₃: X₃ {O(n)}
t₆, X₄: X₄ {O(n)}
t₇, X₁: 1 {O(1)}
t₇, X₂: 2⋅X₂ {O(n)}
t₇, X₃: 2⋅X₃ {O(n)}
t₇, X₄: 2⋅X₄ {O(n)}
t₈, X₁: 1 {O(1)}
t₈, X₂: 2⋅X₂ {O(n)}
t₈, X₃: 2⋅X₃ {O(n)}
t₈, X₄: 2⋅X₄ {O(n)}
t₉, X₁: 1 {O(1)}
t₉, X₂: 2⋅X₄ {O(n)}
t₉, X₃: 2⋅X₃ {O(n)}
t₉, X₄: 2⋅X₄ {O(n)}
t₁₀, X₁: 1 {O(1)}
t₁₀, X₃: 2⋅X₃ {O(n)}
t₁₀, X₄: 2⋅X₄ {O(n)}
t₁₁, X₁: 3 {O(1)}
t₁₁, X₃: 6⋅X₃ {O(n)}
t₁₁, X₄: 6⋅X₄ {O(n)}