details

property	value
status	complete
benchmark	ludcmp.c.i.ludcmp.pl.t2.fixed.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n039.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	39.2995431423 seconds
cpu usage	39.241160242
max memory	8.062976E7

stage attributes

key	value
output-size	273620
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) WARNING: Excluded non-linear constraints:[S=D-Q*R] WARNING: Excluded non-linear constraints:[K=I*J,B>=I*J+1] WARNING: Excluded non-linear constraints:[K=I*J,L=I*J,I*J>=B] WARNING: Excluded non-linear constraints:[J=B-H*I] WARNING: Excluded non-linear constraints:[R>=S*T+1] WARNING: Excluded non-linear constraints:[R*S>=T] Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f9/12] 1. recursive : [f5/12,f9_loop_cont/13] 2. non_recursive : [exit_location/1] 3. recursive : [f30/7] 4. recursive : [f26/10,f30_loop_cont/11] 5. recursive : [f44/16] 6. recursive : [f40/17,f44_loop_cont/18] 7. recursive : [f59/6] 8. recursive : [f74/6] 9. recursive : [f23/18,f26_loop_cont/19,f40_loop_cont/19,f59_loop_cont/19,f69/18,f71/18,f74_loop_cont/19] 10. non_recursive : [f1/12] 11. non_recursive : [f23_loop_cont/13] 12. non_recursive : [f5_loop_cont/13] 13. non_recursive : [f2/12] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f9/12 1. SCC is partially evaluated into f5/12 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f30/7 4. SCC is partially evaluated into f26/10 5. SCC is partially evaluated into f44/16 6. SCC is partially evaluated into f40/17 7. SCC is partially evaluated into f59/6 8. SCC is partially evaluated into f74/6 9. SCC is partially evaluated into f23/18 10. SCC is completely evaluated into other SCCs 11. SCC is partially evaluated into f23_loop_cont/13 12. SCC is partially evaluated into f5_loop_cont/13 13. SCC is partially evaluated into f2/12 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f9/12 * CE 11 is refined into CE [50] * CE 10 is discarded (unfeasible) * CE 13 is refined into CE [51] * CE 12 is refined into CE [52] * CE 9 is refined into CE [53] * CE 8 is refined into CE [54] ### Cost equations --> "Loop" of f9/12 * CEs [53] --> Loop 45 * CEs [54] --> Loop 46 * CEs [50] --> Loop 47 * CEs [51] --> Loop 48 * CEs [52] --> Loop 49 ### Ranking functions of CR f9(A,B,C,D,E,F,N,O,P,Q,R,S) * RF of phase [45,46]: [A-D+1] #### Partial ranking functions of CR f9(A,B,C,D,E,F,N,O,P,Q,R,S) * Partial RF of phase [45,46]: - RF of loop [45:1,46:1]: A-D+1 ### Specialization of cost equations f5/12 * CE 4 is refined into CE [55] * CE 2 is refined into CE [56,57] * CE 5 is refined into CE [58] * CE 3 is refined into CE [59,60,61] ### Cost equations --> "Loop" of f5/12 * CEs [61] --> Loop 50 * CEs [60] --> Loop 51 * CEs [59] --> Loop 52 * CEs [55] --> Loop 53 * CEs [57] --> Loop 54 * CEs [56] --> Loop 55 * CEs [58] --> Loop 56 ### Ranking functions of CR f5(A,B,C,D,E,F,N,O,P,Q,R,S) * RF of phase [52]: [A-B+1,-B+D] #### Partial ranking functions of CR f5(A,B,C,D,E,F,N,O,P,Q,R,S) * Partial RF of phase [52]: - RF of loop [52:1]: A-B+1 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843