Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f4
      0: f2 -> f2 : A'=1+A, B'=free, C'=free, [ free>=1 && A>=1 ], cost: 1
      1: f2 -> f2 : A'=1+A, B'=free_1, C'=free_1, [ 0>=1+free_1 && A>=1 ], cost: 1
      2: f2 -> f0 : B'=0, C'=0, D'=free_2, [], cost: 1
      3: f3 -> f2 : A'=1+A, B'=free_3, C'=free_3, [ free_3>=1 && A>=1 ], cost: 1
      4: f3 -> f2 : A'=1+A, B'=free_4, C'=free_4, [ 0>=1+free_4 && A>=1 ], cost: 1
      5: f3 -> f0 : B'=0, C'=0, D'=free_5, [], cost: 1
      6: f4 -> f2 : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 ], cost: 1
      7: f4 -> f2 : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 ], cost: 1
      8: f4 -> f0 : A'=free_11, B'=0, C'=0, D'=free_10, E'=free_11, F'=free_11, [], cost: 1


Simplified the transitions:
  Start location: f4
      0: f2 -> f2 : A'=1+A, B'=free, C'=free, [ free>=1 && A>=1 ], cost: 1
      1: f2 -> f2 : A'=1+A, B'=free_1, C'=free_1, [ 0>=1+free_1 && A>=1 ], cost: 1
      6: f4 -> f2 : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 ], cost: 1
      7: f4 -> f2 : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 ], cost: 1

Eliminating 2 self-loops for location f2
  Self-Loop 0 has unbounded runtime, resulting in the new transition 9.
  Self-Loop 1 has unbounded runtime, resulting in the new transition 10.
  Removing the self-loops: 0 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f4
      9: f2 -> [4] : [ free>=1 && A>=1 ], cost: INF
     10: f2 -> [4] : [ 0>=1+free_1 && A>=1 ], cost: INF
      6: f4 -> f2 : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 ], cost: 1
      7: f4 -> f2 : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 ], cost: 1


Applied chaining over branches and pruning:
  Start location: f4
     11: f4 -> [4] : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 && free>=1 && 1+free_6>=1 ], cost: INF
     12: f4 -> [4] : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 && 0>=1+free_1 && 1+free_6>=1 ], cost: INF
     13: f4 -> [4] : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 && free>=1 && 1+free_8>=1 ], cost: INF
     14: f4 -> [4] : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 && 0>=1+free_1 && 1+free_8>=1 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f4
     11: f4 -> [4] : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 && free>=1 && 1+free_6>=1 ], cost: INF
     12: f4 -> [4] : A'=1+free_6, B'=free_7, C'=free_7, E'=free_6, F'=free_6, [ free_7>=1 && free_6>=1 && 0>=1+free_1 && 1+free_6>=1 ], cost: INF
     13: f4 -> [4] : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 && free>=1 && 1+free_8>=1 ], cost: INF
     14: f4 -> [4] : A'=1+free_8, B'=free_9, C'=free_9, E'=free_8, F'=free_8, [ 0>=1+free_9 && free_8>=1 && 0>=1+free_1 && 1+free_8>=1 ], cost: INF


Computing complexity for remaining 4 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: free_7>=1 && free_6>=1 && free>=1 && 1+free_6>=1
  Final Cost:  INF

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

WORST_CASE(INF,?)