Initial Problem

Start: start0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars:
Locations: a, b, c, d, halt, start, start0
Transitions:
t₁: a(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → d(X₀, X₁, 1, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇
t₅: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₁, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁
t₄: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → d(X₀, X₁, 1+X₂, X₃, X₄, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₆ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁
t₇: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₆, X₇) :|: 1 ≤ X₄ ∧ 1+X₄ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄
t₆: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₄-1, X₅, X₆, X₇) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₄ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₄
t₂: d(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₂, X₇) :|: 1 ≤ X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁
t₃: d(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → halt(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₀ ≤ X₂
t₀: start(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → a(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇
t₈: start0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → start(X₀, X₀, X₃, X₃, X₅, X₅, X₇, X₇)

Preprocessing

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location halt

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

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location d

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location start

Found invariant X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location b

Found invariant X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location c

Problem after Preprocessing

Start: start0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars:
Locations: a, b, c, d, halt, start, start0
Transitions:
t₁: a(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → d(X₀, X₁, 1, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁
t₅: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₁, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆
t₄: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → d(X₀, X₁, 1+X₂, X₃, X₄, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₆ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₆ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆
t₇: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₆, X₇) :|: 1 ≤ X₄ ∧ 1+X₄ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₆ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂+X₄ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₂+X₆ ∧ 3 ≤ X₄+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ ∧ X₄ ≤ X₁ ∧ X₆ ≤ X₁
t₆: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₄-1, X₅, X₆, X₇) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₄ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂+X₄ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₂+X₆ ∧ 3 ≤ X₄+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ ∧ X₄ ≤ X₁ ∧ X₆ ≤ X₁
t₂: d(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₂, X₇) :|: 1 ≤ X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁
t₃: d(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → halt(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁
t₀: start(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → a(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₇ ≤ X₆ ∧ X₆ ≤ X₇
t₈: start0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → start(X₀, X₀, X₃, X₃, X₅, X₅, X₇, X₇)

MPRF for transition t₂: d(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₂, X₇) :|: 1 ≤ X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁+X₂ ∧ X₂ ≤ X₁ of depth 1:

new bound:

X₀+2 {O(n)}

• b: [X₁-X₂]
• c: [X₀-X₂]
• d: [1+X₁-X₂]

MPRF for transition t₄: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → d(X₀, X₁, 1+X₂, X₃, X₄, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1+X₀ ≤ X₆ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₆ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ of depth 1:

new bound:

X₀+2 {O(n)}

• b: [1+X₀-X₂]
• c: [1+X₀-X₂]
• d: [1+X₀-X₂]

MPRF for transition t₅: b(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₁, X₅, X₆, X₇) :|: X₆ ≤ 1+X₀ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₆ ≤ 1+X₁ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ of depth 1:

new bound:

2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}

• b: [1+X₀-X₆]
• c: [X₀-X₆]
• d: [X₀-X₂]

MPRF for transition t₇: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → b(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₆, X₇) :|: 1 ≤ X₄ ∧ 1+X₄ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₄ ≤ X₂ ∧ X₂ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1+X₂ ≤ X₆ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂+X₄ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₂+X₆ ∧ 3 ≤ X₄+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ ∧ X₄ ≤ X₁ ∧ X₆ ≤ X₁ of depth 1:

new bound:

2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}

• b: [1+X₀-X₆]
• c: [1+X₁-X₆]
• d: [X₀-X₂]

MPRF for transition t₆: c(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → c(X₀, X₁, X₂, X₃, X₄-1, X₅, X₆, X₇) :|: 1 ≤ X₂ ∧ 1+X₂ ≤ X₄ ∧ 1+X₂ ≤ X₆ ∧ X₁ ≤ X₀ ∧ X₄ ≤ X₀ ∧ X₆ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₄ ∧ 1+X₂ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂+X₄ ∧ 2 ≤ X₆ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₄ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₂+X₆ ∧ 3 ≤ X₄+X₆ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₆ ∧ 4 ≤ X₁+X₆ ∧ X₄ ≤ X₁ ∧ X₆ ≤ X₁ of depth 1:

new bound:

2⋅X₀⋅X₀⋅X₀+8⋅X₀⋅X₀+8⋅X₀ {O(n^3)}

• b: [X₀]
• c: [X₄]
• d: [X₀]

Cut unsatisfiable transition [t₄: b→d; t₅₂: b→d]

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

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location d

Found invariant X₆ ≤ 1+X₁ ∧ X₆ ≤ 1+X₀ ∧ 3 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ 2+X₄ ≤ X₆ ∧ 4 ≤ X₂+X₆ ∧ 2+X₂ ≤ X₆ ∧ 5 ≤ X₁+X₆ ∧ 5 ≤ X₀+X₆ ∧ X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location b_v1

Found invariant X₇ ≤ X₆ ∧ X₆ ≤ X₇ ∧ X₅ ≤ X₄ ∧ X₄ ≤ X₅ ∧ X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location start

Found invariant X₆ ≤ 1+X₂ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location b

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location halt

Found invariant X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 3 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ 1+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location c_v2

Found invariant X₆ ≤ X₄ ∧ X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ 2 ≤ X₆ ∧ 4 ≤ X₄+X₆ ∧ 3 ≤ X₂+X₆ ∧ 1+X₂ ≤ X₆ ∧ 4 ≤ X₁+X₆ ∧ 4 ≤ X₀+X₆ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 4 ≤ X₁+X₄ ∧ X₁ ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location c_v1

All Bounds

Timebounds

Overall timebound:2⋅X₀⋅X₀⋅X₀+12⋅X₀⋅X₀+26⋅X₀+22 {O(n^3)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀+2 {O(n)}
t₃: 1 {O(1)}
t₄: X₀+2 {O(n)}
t₅: 2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}
t₆: 2⋅X₀⋅X₀⋅X₀+8⋅X₀⋅X₀+8⋅X₀ {O(n^3)}
t₇: 2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}
t₈: 1 {O(1)}

Costbounds

Overall costbound: 2⋅X₀⋅X₀⋅X₀+12⋅X₀⋅X₀+26⋅X₀+22 {O(n^3)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀+2 {O(n)}
t₃: 1 {O(1)}
t₄: X₀+2 {O(n)}
t₅: 2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}
t₆: 2⋅X₀⋅X₀⋅X₀+8⋅X₀⋅X₀+8⋅X₀ {O(n^3)}
t₇: 2⋅X₀⋅X₀+8⋅X₀+7 {O(n^2)}
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₂: 1 {O(1)}
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₀+3 {O(n)}
t₂, X₃: X₃ {O(n)}
t₂, X₄: 2⋅X₀+X₅ {O(n)}
t₂, X₅: X₅ {O(n)}
t₂, X₆: X₀+6 {O(n)}
t₂, X₇: X₇ {O(n)}
t₃, X₀: 2⋅X₀ {O(n)}
t₃, X₁: 2⋅X₀ {O(n)}
t₃, X₂: X₀+4 {O(n)}
t₃, X₃: 2⋅X₃ {O(n)}
t₃, X₄: 2⋅X₀+X₅ {O(n)}
t₃, X₅: 2⋅X₅ {O(n)}
t₃, X₆: 2⋅X₀⋅X₀+9⋅X₀+X₇+13 {O(n^2)}
t₃, X₇: 2⋅X₇ {O(n)}
t₄, X₀: X₀ {O(n)}
t₄, X₁: X₀ {O(n)}
t₄, X₂: X₀+3 {O(n)}
t₄, X₃: X₃ {O(n)}
t₄, X₄: 2⋅X₀ {O(n)}
t₄, X₅: X₅ {O(n)}
t₄, X₆: 2⋅X₀⋅X₀+9⋅X₀+13 {O(n^2)}
t₄, X₇: X₇ {O(n)}
t₅, X₀: X₀ {O(n)}
t₅, X₁: X₀ {O(n)}
t₅, X₂: X₀+3 {O(n)}
t₅, X₃: X₃ {O(n)}
t₅, X₄: 2⋅X₀ {O(n)}
t₅, X₅: X₅ {O(n)}
t₅, X₆: 2⋅X₀⋅X₀+9⋅X₀+13 {O(n^2)}
t₅, X₇: X₇ {O(n)}
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₀ {O(n)}
t₆, X₂: X₀+3 {O(n)}
t₆, X₃: X₃ {O(n)}
t₆, X₄: 2⋅X₀ {O(n)}
t₆, X₅: X₅ {O(n)}
t₆, X₆: 2⋅X₀⋅X₀+9⋅X₀+13 {O(n^2)}
t₆, X₇: X₇ {O(n)}
t₇, X₀: X₀ {O(n)}
t₇, X₁: X₀ {O(n)}
t₇, X₂: X₀+3 {O(n)}
t₇, X₃: X₃ {O(n)}
t₇, X₄: 2⋅X₀ {O(n)}
t₇, X₅: X₅ {O(n)}
t₇, X₆: 2⋅X₀⋅X₀+9⋅X₀+13 {O(n^2)}
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)}