Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M, N, O, P, Q, R
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(X₀, L, M, N, O, O, X₆, X₇, P, Q, R) :|: 1 ≤ X₇
t₃: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, L, M, X₃, N, P, O, X₇, Q, N, R) :|: X₇ ≤ 0
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(X₀, L, M, N, X₅, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 2 ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, L, M, X₃, X₄, X₅, N, X₇, X₈, X₉, X₁₀) :|: X₀ ≤ 1

Preprocessing

Eliminate variables {L,M,N,O,P,Q,R,X₁,X₂,X₃,X₄,X₅,X₆,X₈,X₉,X₁₀} that do not contribute to the problem

Found invariant 1 ≤ X₁ for location l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₁
t₉: l0(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
t₁₀: l1(X₀, X₁) → l1(X₀, X₁) :|: 2 ≤ X₀ ∧ 1 ≤ X₁
t₁₁: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 1 ∧ 1 ≤ X₁

Analysing control-flow refined program

Found invariant 1 ≤ X₁ for location l1

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

CFR did not improve the program. Rolling back

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₁₁: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
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)}