Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f5 : A'=2, B'=4, [], cost: 1
      1: f5 -> f5 : A'=2+A, B'=4+A, [ 19>=A ], cost: 1
      2: f5 -> f8 : [ A>=20 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f5 : A'=2, B'=4, [], cost: 1
      1: f5 -> f5 : A'=2+A, B'=4+A, [ 19>=A ], cost: 1

Eliminating 1 self-loops for location f5
  Self-Loop 1 has the metering function: meter, resulting in the new transition 3.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f5 : A'=2, B'=4, [], cost: 1
      3: f5 -> [3] : A'=2*meter+A, B'=2+2*meter+A, [ 19>=A && 2*meter==19-A ], cost: meter


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),?)