/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


KILLED
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 116 ms]
(2) BOUNDS(1, INF)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
l0(A, B, C, D, E, F) -> Com_1(l1(A, B, C, D, E, F)) :|: TRUE
l1(A, B, C, D, E, F) -> Com_1(l1(A + B, B + C, C + D, D + E, E + F, F - 1)) :|: A >= 1

The start-symbols are:[l0_6]


----------------------------------------

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: l0

      0: l0 -> l1 : [], cost: 1

      1: l1 -> l1 : A'=A+B, B'=C+B, C'=C+D, D'=D+E, E'=F+E, F'=-1+F, [ A>=1 ], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

      0: l0 -> l1 : [], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 1.

   Accelerating the following rules:

      1: l1 -> l1 : A'=A+B, B'=C+B, C'=C+D, D'=D+E, E'=F+E, F'=-1+F, [ A>=1 ], cost: 1



   Found no metering function for rule 1.

   Removing the simple loops:.



Accelerated all simple loops using metering functions (where possible):

   Start location: l0

      0: l0 -> l1 : [], cost: 1

      1: l1 -> l1 : A'=A+B, B'=C+B, C'=C+D, D'=D+E, E'=F+E, F'=-1+F, [ A>=1 ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: l0

      0: l0 -> l1 : [], cost: 1

      2: l0 -> l1 : A'=A+B, B'=C+B, C'=C+D, D'=D+E, E'=F+E, F'=-1+F, [ A>=1 ], cost: 2



Removed unreachable locations (and leaf rules with constant cost):

   Start location: l0

     <empty>



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: l0

     <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:  []



WORST_CASE(Omega(1),?)


----------------------------------------

(2)
BOUNDS(1, INF)