Initial Problem

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

Preprocessing

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

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

Found invariant X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ for location l4

Problem after Preprocessing

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

Analysing control-flow refined program

Found invariant X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ for location n_l6___6

Found invariant X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄ for location l2

Found invariant X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location n_l6___2

Found invariant X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ for location n_l4___5

Found invariant X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location n_l4___1

Found invariant X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ for location n_l5___7

Found invariant X₄+X₆ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ X₂+X₄ ≤ 0 ∧ X₀+X₄ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location n_l2___4

Found invariant X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location n_l5___3

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₆₀: n_l2___4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l5___3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 0 < X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ X₂+X₄ ≤ 0 ∧ X₀+X₄ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₆₄: n_l5___3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l6___2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 0 < X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₆₆: n_l6___2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l4___1(X₀, X₁, Arg2_P, NoDet0, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁+Arg2_P ≤ 0 ∧ 1 ≤ X₀ ∧ X₂ ≤ Arg2_P ∧ Arg2_P ≤ X₂ ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₆₂: n_l4___1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l2___4(X₁, X₃, X₁, X₃, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀

CFR: Improvement to new bound with the following program:

new bound:

4 {O(1)}

cfr-program:

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: Arg2_P, NoDet0
Locations: l0, l1, l2, l3, l7, n_l2___4, n_l4___1, n_l4___5, n_l5___3, n_l5___7, n_l6___2, n_l6___6
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₂+X₁ ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄
t₆₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l5___7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₆ ≤ X₁ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ 0 < X₀ ∧ X₁+X₂ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄
t₉: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₁: l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₅, X₆, X₄, X₃, X₄, X₅, X₆)
t₇₄: n_l2___4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ X₂+X₄ ≤ 0 ∧ X₀+X₄ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₇₅: n_l2___4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₂+X₁ ∧ X₄+X₆ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ X₂+X₄ ≤ 0 ∧ X₀+X₄ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₆₀: n_l2___4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l5___3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 0 < X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ X₂+X₄ ≤ 0 ∧ X₀+X₄ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂
t₆₂: n_l4___1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l2___4(X₁, X₃, X₁, X₃, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀
t₆₃: n_l4___5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l2___4(X₁, X₃, X₁, X₃, X₄, X₅, X₆) :|: X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₆ ≤ X₁ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀
t₆₄: n_l5___3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l6___2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 0 < X₀ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀
t₆₅: n_l5___7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l6___6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁+X₂ ≤ 0 ∧ 0 < X₀ ∧ X₁ ≤ X₆ ∧ X₆ ≤ X₁ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ 1 ≤ X₀ ∧ X₁+X₂ ≤ 0 ∧ X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀
t₆₆: n_l6___2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l4___1(X₀, X₁, Arg2_P, NoDet0, X₄, X₅, X₆) :|: X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀ ∧ X₁+Arg2_P ≤ 0 ∧ 1 ≤ X₀ ∧ X₂ ≤ Arg2_P ∧ Arg2_P ≤ X₂ ∧ X₄+X₆ ≤ 0 ∧ 1 ≤ X₆ ∧ 2 ≤ X₅+X₆ ∧ 2+X₄ ≤ X₆ ∧ 2+X₃ ≤ X₆ ∧ 2 ≤ X₂+X₆ ∧ X₂ ≤ X₆ ∧ 2+X₁ ≤ X₆ ∧ 2 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ 1 ≤ X₅ ∧ 2+X₄ ≤ X₅ ∧ 2+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ 2+X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ 1+X₄ ≤ 0 ∧ 2+X₃+X₄ ≤ 0 ∧ 2+X₄ ≤ X₂ ∧ X₂+X₄ ≤ 0 ∧ 2+X₁+X₄ ≤ 0 ∧ 2+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 0 ∧ 1+X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₃ ≤ X₀ ∧ X₀+X₃ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 1 ≤ X₀
t₆₇: n_l6___6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l4___5(X₀, X₁, Arg2_P, NoDet0, X₄, X₅, X₆) :|: X₁+X₂ ≤ 0 ∧ 1 ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₆ ≤ X₁ ∧ X₂ ≤ X₄ ∧ X₄ ≤ X₂ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁+Arg2_P ≤ 0 ∧ 1 ≤ X₀ ∧ X₂ ≤ Arg2_P ∧ Arg2_P ≤ X₂ ∧ X₄+X₆ ≤ 0 ∧ X₂+X₆ ≤ 0 ∧ X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₁+X₄ ≤ 0 ∧ X₂ ≤ X₄ ∧ X₁+X₂ ≤ 0 ∧ 1 ≤ X₀

All Bounds

Timebounds

Overall timebound:15 {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₇₅: 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)}

Costbounds

Overall costbound: 15 {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₇₅: 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)}

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₂: 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₁: 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₄: 6⋅X₄ {O(n)}
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₄: 2⋅X₄ {O(n)}
t₇₄, X₅: 2⋅X₅ {O(n)}
t₇₄, X₆: 2⋅X₆ {O(n)}
t₇₅, X₄: 2⋅X₄ {O(n)}
t₇₅, X₅: 2⋅X₅ {O(n)}
t₇₅, X₆: 2⋅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₆: 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₀: 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)}