Initial Problem

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

Preprocessing

Eliminate variables {X₀,X₁,X₄} that do not contribute to the problem

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

Found invariant 0 ≤ X₃ for location l1

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

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

Problem after Preprocessing

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

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

Found invariant 0 ≤ X₃ for location l1

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

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

Analysing control-flow refined program

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

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

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

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

Found invariant X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₂ for location n_l1___1

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

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

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

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

Found invariant X₃ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₂ for location n_l1___1

CFR did not improve the program. Rolling back

Analysing control-flow refined program

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

Found invariant 0 ≤ X₃ for location l1

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

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

CFR did not improve the program. Rolling back

Analysing control-flow refined program

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

Found invariant 0 ≤ X₃ for location l1

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

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

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

Sizebounds

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