details

property	value
status	complete
benchmark	Ex6.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n013.star.cs.uiowa.edu
space	PLDI10

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.29946398735 seconds
cpu usage	0.213666707
max memory	8794112.0

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [evalEx6bb1in/6,evalEx6bb2in/6,evalEx6bb3in/6,evalEx6bbin/6] 1. non_recursive : [evalEx6stop/4] 2. non_recursive : [evalEx6returnin/4] 3. non_recursive : [exit_location/1] 4. non_recursive : [evalEx6bb3in_loop_cont/5] 5. non_recursive : [evalEx6entryin/4] 6. non_recursive : [evalEx6start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into evalEx6bb3in/6 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into evalEx6bb3in_loop_cont/5 5. SCC is partially evaluated into evalEx6entryin/4 6. SCC is partially evaluated into evalEx6start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations evalEx6bb3in/6 * CE 6 is refined into CE [9] * CE 5 is refined into CE [10] * CE 3 is refined into CE [11] * CE 4 is refined into CE [12] ### Cost equations --> "Loop" of evalEx6bb3in/6 * CEs [11] --> Loop 9 * CEs [12] --> Loop 10 * CEs [9] --> Loop 11 * CEs [10] --> Loop 12 ### Ranking functions of CR evalEx6bb3in(A,B,C,D,E,F) #### Partial ranking functions of CR evalEx6bb3in(A,B,C,D,E,F) * Partial RF of phase [9,10]: - RF of loop [9:1]: A-B depends on loops [10:1] -B+C - RF of loop [10:1]: -A+B+1 depends on loops [9:1] -A+C ### Specialization of cost equations evalEx6bb3in_loop_cont/5 * CE 8 is refined into CE [13] * CE 7 is refined into CE [14] ### Cost equations --> "Loop" of evalEx6bb3in_loop_cont/5 * CEs [13] --> Loop 13 * CEs [14] --> Loop 14 ### Ranking functions of CR evalEx6bb3in_loop_cont(A,B,C,D,E) #### Partial ranking functions of CR evalEx6bb3in_loop_cont(A,B,C,D,E) ### Specialization of cost equations evalEx6entryin/4 * CE 2 is refined into CE [15,16,17,18] ### Cost equations --> "Loop" of evalEx6entryin/4 * CEs [15] --> Loop 15 * CEs [16,18] --> Loop 16 * CEs [17] --> Loop 17 ### Ranking functions of CR evalEx6entryin(A,B,C,D) #### Partial ranking functions of CR evalEx6entryin(A,B,C,D) ### Specialization of cost equations evalEx6start/4 * CE 1 is refined into CE [19,20,21] ### Cost equations --> "Loop" of evalEx6start/4 * CEs [21] --> Loop 18 * CEs [20] --> Loop 19 * CEs [19] --> Loop 20 ### Ranking functions of CR evalEx6start(A,B,C,D) #### Partial ranking functions of CR evalEx6start(A,B,C,D) Computing Bounds popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843