Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f5 : B'=0, [ A>=128 ], cost: 1
      1: f0 -> f7 : B'=0, C'=free, [ 127>=A ], cost: 1
      3: f7 -> f5 : [ B>=36 ], cost: 1
      2: f7 -> f7 : B'=1+B, C'=1+C, [ 35>=B ], cost: 1


Simplified the transitions:
  Start location: f0
      1: f0 -> f7 : B'=0, C'=free, [ 127>=A ], cost: 1
      2: f7 -> f7 : B'=1+B, C'=1+C, [ 35>=B ], cost: 1

Eliminating 1 self-loops for location f7
  Self-Loop 2 has the metering function: 36-B, resulting in the new transition 4.
  Removing the self-loops: 2.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      1: f0 -> f7 : B'=0, C'=free, [ 127>=A ], cost: 1
      4: f7 -> [3] : B'=36, C'=36-B+C, [ 35>=B ], cost: 36-B


Applied simple chaining:
  Start location: f0
      1: f0 -> [3] : B'=36, C'=36+free, [ 127>=A && 35>=0 ], cost: 37


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      1: f0 -> [3] : B'=36, C'=36+free, [ 127>=A && 35>=0 ], cost: 37


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


The final runtime is determined by this resulting transition:
  Final Guard: 127>=A && 35>=0
  Final Cost:  37

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

WORST_CASE(Omega(1),?)