WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l4
      0: l0 -> l1 : Result_4^0'=Result_4^post_1, ___cil_tmp4_8^0'=___cil_tmp4_8^post_1, ___retres3_7^0'=___retres3_7^post_1, i_5^0'=i_5^post_1, x_6^0'=x_6^post_1, [ 10-x_6^0<=0 && ___retres3_7^post_1==0 && ___cil_tmp4_8^post_1==___retres3_7^post_1 && Result_4^post_1==___cil_tmp4_8^post_1 && i_5^0==i_5^post_1 && x_6^0==x_6^post_1 ], cost: 1
      1: l0 -> l1 : Result_4^0'=Result_4^post_2, ___cil_tmp4_8^0'=___cil_tmp4_8^post_2, ___retres3_7^0'=___retres3_7^post_2, i_5^0'=i_5^post_2, x_6^0'=x_6^post_2, [ 0<=9-x_6^0 && -100+i_5^0<=0 && ___retres3_7^post_2==0 && ___cil_tmp4_8^post_2==___retres3_7^post_2 && Result_4^post_2==___cil_tmp4_8^post_2 && i_5^0==i_5^post_2 && x_6^0==x_6^post_2 ], cost: 1
      2: l0 -> l2 : Result_4^0'=Result_4^post_3, ___cil_tmp4_8^0'=___cil_tmp4_8^post_3, ___retres3_7^0'=___retres3_7^post_3, i_5^0'=i_5^post_3, x_6^0'=x_6^post_3, [ 0<=9-x_6^0 && 0<=-101+i_5^0 && i_5^post_3==-1+i_5^0 && Result_4^0==Result_4^post_3 && ___cil_tmp4_8^0==___cil_tmp4_8^post_3 && ___retres3_7^0==___retres3_7^post_3 && x_6^0==x_6^post_3 ], cost: 1
      3: l2 -> l0 : Result_4^0'=Result_4^post_4, ___cil_tmp4_8^0'=___cil_tmp4_8^post_4, ___retres3_7^0'=___retres3_7^post_4, i_5^0'=i_5^post_4, x_6^0'=x_6^post_4, [ Result_4^0==Result_4^post_4 && ___cil_tmp4_8^0==___cil_tmp4_8^post_4 && ___retres3_7^0==___retres3_7^post_4 && i_5^0==i_5^post_4 && x_6^0==x_6^post_4 ], cost: 1
      4: l3 -> l0 : Result_4^0'=Result_4^post_5, ___cil_tmp4_8^0'=___cil_tmp4_8^post_5, ___retres3_7^0'=___retres3_7^post_5, i_5^0'=i_5^post_5, x_6^0'=x_6^post_5, [ i_5^post_5==1000 && Result_4^0==Result_4^post_5 && ___cil_tmp4_8^0==___cil_tmp4_8^post_5 && ___retres3_7^0==___retres3_7^post_5 && x_6^0==x_6^post_5 ], cost: 1
      5: l4 -> l3 : Result_4^0'=Result_4^post_6, ___cil_tmp4_8^0'=___cil_tmp4_8^post_6, ___retres3_7^0'=___retres3_7^post_6, i_5^0'=i_5^post_6, x_6^0'=x_6^post_6, [ Result_4^0==Result_4^post_6 && ___cil_tmp4_8^0==___cil_tmp4_8^post_6 && ___retres3_7^0==___retres3_7^post_6 && i_5^0==i_5^post_6 && x_6^0==x_6^post_6 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: l4 -> l3 : Result_4^0'=Result_4^post_6, ___cil_tmp4_8^0'=___cil_tmp4_8^post_6, ___retres3_7^0'=___retres3_7^post_6, i_5^0'=i_5^post_6, x_6^0'=x_6^post_6, [ Result_4^0==Result_4^post_6 && ___cil_tmp4_8^0==___cil_tmp4_8^post_6 && ___retres3_7^0==___retres3_7^post_6 && i_5^0==i_5^post_6 && x_6^0==x_6^post_6 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l4
      2: l0 -> l2 : Result_4^0'=Result_4^post_3, ___cil_tmp4_8^0'=___cil_tmp4_8^post_3, ___retres3_7^0'=___retres3_7^post_3, i_5^0'=i_5^post_3, x_6^0'=x_6^post_3, [ 0<=9-x_6^0 && 0<=-101+i_5^0 && i_5^post_3==-1+i_5^0 && Result_4^0==Result_4^post_3 && ___cil_tmp4_8^0==___cil_tmp4_8^post_3 && ___retres3_7^0==___retres3_7^post_3 && x_6^0==x_6^post_3 ], cost: 1
      3: l2 -> l0 : Result_4^0'=Result_4^post_4, ___cil_tmp4_8^0'=___cil_tmp4_8^post_4, ___retres3_7^0'=___retres3_7^post_4, i_5^0'=i_5^post_4, x_6^0'=x_6^post_4, [ Result_4^0==Result_4^post_4 && ___cil_tmp4_8^0==___cil_tmp4_8^post_4 && ___retres3_7^0==___retres3_7^post_4 && i_5^0==i_5^post_4 && x_6^0==x_6^post_4 ], cost: 1
      4: l3 -> l0 : Result_4^0'=Result_4^post_5, ___cil_tmp4_8^0'=___cil_tmp4_8^post_5, ___retres3_7^0'=___retres3_7^post_5, i_5^0'=i_5^post_5, x_6^0'=x_6^post_5, [ i_5^post_5==1000 && Result_4^0==Result_4^post_5 && ___cil_tmp4_8^0==___cil_tmp4_8^post_5 && ___retres3_7^0==___retres3_7^post_5 && x_6^0==x_6^post_5 ], cost: 1
      5: l4 -> l3 : Result_4^0'=Result_4^post_6, ___cil_tmp4_8^0'=___cil_tmp4_8^post_6, ___retres3_7^0'=___retres3_7^post_6, i_5^0'=i_5^post_6, x_6^0'=x_6^post_6, [ Result_4^0==Result_4^post_6 && ___cil_tmp4_8^0==___cil_tmp4_8^post_6 && ___retres3_7^0==___retres3_7^post_6 && i_5^0==i_5^post_6 && x_6^0==x_6^post_6 ], cost: 1

Simplified all rules, resulting in:
   Start location: l4
      2: l0 -> l2 : i_5^0'=-1+i_5^0, [ 0<=9-x_6^0 && 0<=-101+i_5^0 ], cost: 1
      3: l2 -> l0 : [], cost: 1
      4: l3 -> l0 : i_5^0'=1000, [], cost: 1
      5: l4 -> l3 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l4
      7: l0 -> l0 : i_5^0'=-1+i_5^0, [ 0<=9-x_6^0 && 0<=-101+i_5^0 ], cost: 2
      6: l4 -> l0 : i_5^0'=1000, [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
      7: l0 -> l0 : i_5^0'=-1+i_5^0, [ 0<=9-x_6^0 && 0<=-101+i_5^0 ], cost: 2

   Accelerated rule 7 with backward acceleration, yielding the new rule 8.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 7.

Accelerated all simple loops using metering functions (where possible):
   Start location: l4
      8: l0 -> l0 : i_5^0'=100, [ 0<=9-x_6^0 && -100+i_5^0>=0 ], cost: -200+2*i_5^0
      6: l4 -> l0 : i_5^0'=1000, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l4
      6: l4 -> l0 : i_5^0'=1000, [], cost: 2
      9: l4 -> l0 : i_5^0'=100, [ 0<=9-x_6^0 ], cost: 1802

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l4
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l4
     <empty>

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:  [ Result_4^0==Result_4^post_6 && ___cil_tmp4_8^0==___cil_tmp4_8^post_6 && ___retres3_7^0==___retres3_7^post_6 && i_5^0==i_5^post_6 && x_6^0==x_6^post_6 ]

WORST_CASE(Omega(1),?)