WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l5
      0: l0 -> l1 : ___len9^0'=___len9^post_1, ___val8^0'=___val8^post_1, tmp10^0'=tmp10^post_1, tmp^0'=tmp^post_1, tmp___0^0'=tmp___0^post_1, tmp___1^0'=tmp___1^post_1, [ ___len9^0==___len9^post_1 && ___val8^0==___val8^post_1 && tmp^0==tmp^post_1 && tmp10^0==tmp10^post_1 && tmp___0^0==tmp___0^post_1 && tmp___1^0==tmp___1^post_1 ], cost: 1
      1: l2 -> l0 : ___len9^0'=___len9^post_2, ___val8^0'=___val8^post_2, tmp10^0'=tmp10^post_2, tmp^0'=tmp^post_2, tmp___0^0'=tmp___0^post_2, tmp___1^0'=tmp___1^post_2, [ tmp___0^post_2==tmp___0^post_2 && ___len9^0==___len9^post_2 && ___val8^0==___val8^post_2 && tmp^0==tmp^post_2 && tmp10^0==tmp10^post_2 && tmp___1^0==tmp___1^post_2 ], cost: 1
      2: l3 -> l0 : ___len9^0'=___len9^post_3, ___val8^0'=___val8^post_3, tmp10^0'=tmp10^post_3, tmp^0'=tmp^post_3, tmp___0^0'=tmp___0^post_3, tmp___1^0'=tmp___1^post_3, [ tmp___1^0<=-1 && -1<=tmp___1^0 && ___val8^post_3==0 && ___len9^post_3==___len9^post_3 && tmp10^post_3==tmp10^post_3 && tmp^0==tmp^post_3 && tmp___0^0==tmp___0^post_3 && tmp___1^0==tmp___1^post_3 ], cost: 1
      3: l3 -> l2 : ___len9^0'=___len9^post_4, ___val8^0'=___val8^post_4, tmp10^0'=tmp10^post_4, tmp^0'=tmp^post_4, tmp___0^0'=tmp___0^post_4, tmp___1^0'=tmp___1^post_4, [ 0<=tmp___1^0 && ___len9^0==___len9^post_4 && ___val8^0==___val8^post_4 && tmp^0==tmp^post_4 && tmp10^0==tmp10^post_4 && tmp___0^0==tmp___0^post_4 && tmp___1^0==tmp___1^post_4 ], cost: 1
      4: l3 -> l2 : ___len9^0'=___len9^post_5, ___val8^0'=___val8^post_5, tmp10^0'=tmp10^post_5, tmp^0'=tmp^post_5, tmp___0^0'=tmp___0^post_5, tmp___1^0'=tmp___1^post_5, [ 1+tmp___1^0<=-1 && ___len9^0==___len9^post_5 && ___val8^0==___val8^post_5 && tmp^0==tmp^post_5 && tmp10^0==tmp10^post_5 && tmp___0^0==tmp___0^post_5 && tmp___1^0==tmp___1^post_5 ], cost: 1
      5: l4 -> l3 : ___len9^0'=___len9^post_6, ___val8^0'=___val8^post_6, tmp10^0'=tmp10^post_6, tmp^0'=tmp^post_6, tmp___0^0'=tmp___0^post_6, tmp___1^0'=tmp___1^post_6, [ tmp^post_6==tmp^post_6 && tmp___1^post_6==tmp___1^post_6 && ___len9^0==___len9^post_6 && ___val8^0==___val8^post_6 && tmp10^0==tmp10^post_6 && tmp___0^0==tmp___0^post_6 ], cost: 1
      6: l5 -> l4 : ___len9^0'=___len9^post_7, ___val8^0'=___val8^post_7, tmp10^0'=tmp10^post_7, tmp^0'=tmp^post_7, tmp___0^0'=tmp___0^post_7, tmp___1^0'=tmp___1^post_7, [ ___len9^0==___len9^post_7 && ___val8^0==___val8^post_7 && tmp^0==tmp^post_7 && tmp10^0==tmp10^post_7 && tmp___0^0==tmp___0^post_7 && tmp___1^0==tmp___1^post_7 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: l5 -> l4 : ___len9^0'=___len9^post_7, ___val8^0'=___val8^post_7, tmp10^0'=tmp10^post_7, tmp^0'=tmp^post_7, tmp___0^0'=tmp___0^post_7, tmp___1^0'=tmp___1^post_7, [ ___len9^0==___len9^post_7 && ___val8^0==___val8^post_7 && tmp^0==tmp^post_7 && tmp10^0==tmp10^post_7 && tmp___0^0==tmp___0^post_7 && tmp___1^0==tmp___1^post_7 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l5
     <empty>

Empty problem, aborting

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ ___len9^0==___len9^post_7 && ___val8^0==___val8^post_7 && tmp^0==tmp^post_7 && tmp10^0==tmp10^post_7 && tmp___0^0==tmp___0^post_7 && tmp___1^0==tmp___1^post_7 ]

WORST_CASE(Omega(1),?)