

MaxCore parameters: [sabu=yes,dropoutputvars=yes]

Selected extra parameters: [cost_model=termination,enable_sabu=yes,output_vars_crs_file=no]

Generated TS from C program in 412 ms

Transition system stored in /tmp/costabs/ts.ts
Collected parameters: [send_tree_count,send_tree_max_code,send_tree_max_count,send_tree_min_count,send_tree_n,unknown4,unknown5,unknown6,v_r7]
SCCs from Transition System: [(non_recursive,[24]),(recursive,[2,9]),(non_recursive,[0])]
Processing final SCC [24] with GenCalls = calls
Processing SCC [2,9] with GenCalls = calls
Processing non-final SCC [9] with GenCalls = no_calls
Processing non-final SCC [0] with GenCalls = calls
RBR generated

Rule based representation stored in /tmp/costabs/rbr.rbr

RBR properties stored in /tmp/costabs/rbr.properties

Abstract compilation performed in 4 ms.

Size analysis performed in 28 ms.

Cost relation system stored in /tmp/costabs/crs.crs
@@@ crs_time = 0.453
Warning: the following predicates are never called:[and_op/2,eq/2,geq/2,gt/2,leq/2,lt/2,maxNorm/2,neg/1,neq/2,or/2]

### Maximum cost of p0(A,B,C,D,E,F,G,H,I,J): nat(C+1)+max([nat(C+1),nat(C+3*D)*3+nat(C+1)*7+nat(C)*3])+3 
Asymptotic class: n 
@@@ cofloco_time = 1.5250000000000001
@@@ cofloco_ub = n^1
