Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f4 : A'=0, [], cost: 1
      3: f4 -> f4 : A'=1+A, D'=A, E'=A, [ 99>=A ], cost: 1
      4: f4 -> f24 : B'=100, [ A>=100 ], cost: 1
      1: f24 -> f24 : B'=1+B, C'=B, [ 199>=B ], cost: 1
      2: f24 -> f37 : [ B>=200 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f4 : A'=0, [], cost: 1
      3: f4 -> f4 : A'=1+A, D'=A, E'=A, [ 99>=A ], cost: 1
      4: f4 -> f24 : B'=100, [ A>=100 ], cost: 1
      1: f24 -> f24 : B'=1+B, C'=B, [ 199>=B ], cost: 1

Eliminating 1 self-loops for location f4
  Self-Loop 3 has the metering function: 100-A, resulting in the new transition 5.
  Removing the self-loops: 3.
Eliminating 1 self-loops for location f24
  Self-Loop 1 has the metering function: 200-B, resulting in the new transition 6.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f4 : A'=0, [], cost: 1
      5: f4 -> [4] : A'=100, D'=99, E'=99, [ 99>=A ], cost: 100-A
      6: f24 -> [5] : B'=200, C'=199, [ 199>=B ], cost: 200-B
      4: [4] -> f24 : B'=100, [ A>=100 ], cost: 1


Applied simple chaining:
  Start location: f0
      0: f0 -> [5] : A'=100, B'=200, C'=199, D'=99, E'=99, [ 99>=0 && 100>=100 && 199>=100 ], cost: 202


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      0: f0 -> [5] : A'=100, B'=200, C'=199, D'=99, E'=99, [ 99>=0 && 100>=100 && 199>=100 ], cost: 202


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


The final runtime is determined by this resulting transition:
  Final Guard: 99>=0 && 100>=100 && 199>=100
  Final Cost:  202

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

WORST_CASE(Omega(1),?)