Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f8 : A'=0, [], cost: 1
      1: f8 -> f8 : A'=1+A, [ 3>=A ], cost: 1
      2: f8 -> f8 : A'=1+A, B'=A, C'=1+A, D'=free, [ 3>=A ], cost: 1
      3: f8 -> f23 : [ A>=4 && 0>=1+free_1 ], cost: 1
      4: f8 -> f23 : [ A>=4 ], cost: 1


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

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

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


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