Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f4 : A'=free, [], cost: 1
      1: f4 -> f4 : A'=1+A, [ 3>=A && A>=1 ], cost: 1
      2: f4 -> f4 : A'=1, [ 0>=A && 3>=A ], cost: 1
      3: f4 -> f12 : [ A>=4 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f4 : A'=free, [], cost: 1
      1: f4 -> f4 : A'=1+A, [ 3>=A && A>=1 ], cost: 1
      2: f4 -> f4 : A'=1, [ 0>=A ], cost: 1

Eliminating 2 self-loops for location f4
  Self-Loop 1 has the metering function: 4-A, resulting in the new transition 4.
  Removing the self-loops: 1 2.
Adding an epsilon transition (to model nonexecution of the loops): 6.

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


Applied chaining over branches and pruning:
  Start location: f0
      7: f0 -> [3] : A'=4, [ 3>=free && free>=1 ], cost: 5-free


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      7: f0 -> [3] : A'=4, [ 3>=free && free>=1 ], cost: 5-free


Computing complexity for remaining 1 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),?)