Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f1
      0: f300 -> f300 : A'=-1+A, [ A>=101 && 9>=B ], cost: 1
      1: f300 -> f2 : C'=0, D'=0, E'=0, [ 100>=A && 9>=B ], cost: 1
      2: f300 -> f2 : C'=0, D'=0, E'=0, [ B>=10 ], cost: 1
      3: f1 -> f300 : A'=1000, [], cost: 1


Simplified the transitions:
  Start location: f1
      0: f300 -> f300 : A'=-1+A, [ A>=101 && 9>=B ], cost: 1
      3: f1 -> f300 : A'=1000, [], cost: 1

Eliminating 1 self-loops for location f300
  Self-Loop 0 has the metering function: -100+A, resulting in the new transition 4.
  Removing the self-loops: 0.

Removed all Self-loops using metering functions (where possible):
  Start location: f1
      4: f300 -> [3] : A'=100, [ A>=101 && 9>=B ], cost: -100+A
      3: f1 -> f300 : A'=1000, [], cost: 1


Applied simple chaining:
  Start location: f1
      3: f1 -> [3] : A'=100, [ 1000>=101 && 9>=B ], cost: 901


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f1
      3: f1 -> [3] : A'=100, [ 1000>=101 && 9>=B ], cost: 901


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


The final runtime is determined by this resulting transition:
  Final Guard: 1000>=101 && 9>=B
  Final Cost:  901

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

WORST_CASE(Omega(1),?)