Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f1
      0: f2 -> f2 : C'=free_3, D'=free, E'=free_1, F'=free_2, [ free_1>=1 && B>=1+A ], cost: 1
      1: f2 -> f2 : C'=free_7, D'=free_4, E'=free_5, F'=free_6, [ 0>=1+free_5 && B>=1+A ], cost: 1
      2: f2 -> f2 : C'=free_9, D'=free_8, E'=0, [ B>=1+A ], cost: 1
      3: f2 -> f300 : C'=free_12, D'=free_10, G'=free_11, [ A>=B ], cost: 1
      4: f1 -> f2 : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [], cost: 1


Simplified the transitions:
  Start location: f1
      0: f2 -> f2 : C'=free_3, D'=free, E'=free_1, F'=free_2, [ free_1>=1 && B>=1+A ], cost: 1
      1: f2 -> f2 : C'=free_7, D'=free_4, E'=free_5, F'=free_6, [ 0>=1+free_5 && B>=1+A ], cost: 1
      2: f2 -> f2 : C'=free_9, D'=free_8, E'=0, [ B>=1+A ], cost: 1
      4: f1 -> f2 : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f1
      5: f2 -> [3] : [ free_1>=1 && B>=1+A ], cost: INF
      6: f2 -> [3] : [ 0>=1+free_5 && B>=1+A ], cost: INF
      7: f2 -> [3] : [ B>=1+A ], cost: INF
      4: f1 -> f2 : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [], cost: 1


Applied chaining over branches and pruning:
  Start location: f1
      8: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ free_1>=1 && B>=1+A ], cost: INF
      9: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ 0>=1+free_5 && B>=1+A ], cost: INF
     10: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ B>=1+A ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f1
      8: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ free_1>=1 && B>=1+A ], cost: INF
      9: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ 0>=1+free_5 && B>=1+A ], cost: INF
     10: f1 -> [3] : H'=free_14, Q'=free_13, J'=free_13, K'=free_14, [ B>=1+A ], cost: INF


Computing complexity for remaining 3 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: free_1>=1 && B>=1+A
  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,?)