Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G
Locations: l0, l1, l2
Transitions:
t₃: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(5000, X₁, G, X₃, X₄, X₅) :|: 1 ≤ G
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀-1, X₂, X₂-1, X₀, X₄, X₅) :|: 1 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(5000, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 0 ∧ 1 ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀-1, X₁, X₂-1, X₃, X₂, X₀) :|: 1 ≤ X₀ ∧ 1 ≤ X₂
Cut unreachable locations [l2] from the program graph
Eliminate variables {X₁,X₃,X₄,X₅} that do not contribute to the problem
Found invariant 0 ≤ 4999+X₁ ∧ 0 ≤ 4999+X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 5000 ∧ 0 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: G
Locations: l0, l1
Transitions:
t₇: l0(X₀, X₁) → l1(5000, G) :|: 1 ≤ G
t₈: l1(X₀, X₁) → l1(X₀-1, X₁-1) :|: 1 ≤ X₀ ∧ 0 ≤ 4999+X₁ ∧ 0 ≤ 4999+X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 5000 ∧ 0 ≤ X₀
t₉: l1(X₀, X₁) → l1(5000, X₁) :|: X₀ ≤ 0 ∧ 1 ≤ X₁ ∧ 0 ≤ 4999+X₁ ∧ 0 ≤ 4999+X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 5000 ∧ 0 ≤ X₀
Found invariant 0 ≤ X₁ ∧ 4999 ≤ X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 4999 ∧ 4999 ≤ X₀ for location n_l1___2
Found invariant 1 ≤ X₁ ∧ 5001 ≤ X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 5000 ∧ 5000 ≤ X₀ for location l1
Found invariant 0 ≤ 4999+X₁ ∧ 0 ≤ 4999+X₀+X₁ ∧ X₀ ≤ 4999+X₁ ∧ X₀ ≤ 4998 ∧ 0 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
t₉: inf {Infinity}
Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
t₉: inf {Infinity}
t₇, X₀: 5000 {O(1)}
t₈, X₀: 10000 {O(1)}
t₉, X₀: 5000 {O(1)}