Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f5 : A'=free, B'=0, C'=0, [], cost: 1
      1: f5 -> f5 : B'=1+B, C'=1+C, D'=1, [ 15>=C ], cost: 1
      2: f5 -> f5 : C'=1+C, D'=0, [ 15>=C ], cost: 1
      3: f5 -> f27 : E'=B, F'=B, G'=free_1, H'=free_2, Q'=free_2, J'=free_2, [ C>=16 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f5 : A'=free, B'=0, C'=0, [], cost: 1
      1: f5 -> f5 : B'=1+B, C'=1+C, D'=1, [ 15>=C ], cost: 1
      2: f5 -> f5 : C'=1+C, D'=0, [ 15>=C ], cost: 1

Eliminating 2 self-loops for location f5
  Self-Loop 1 has the metering function: 16-C, resulting in the new transition 4.
  Self-Loop 2 has the metering function: 16-C, resulting in the new transition 5.
  Removing the self-loops: 1 2.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f5 : A'=free, B'=0, C'=0, [], cost: 1
      4: f5 -> [3] : B'=16+B-C, C'=16, D'=1, [ 15>=C ], cost: 16-C
      5: f5 -> [3] : C'=16, D'=0, [ 15>=C ], cost: 16-C


Applied chaining over branches and pruning:
  Start location: f0
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)