details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	3.26763 seconds
cpu usage	3.18755
user time	3.14659
system time	0.040959
max virtual memory	320160.0
max residence set size	17052.0

stage attributes

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

output

3.12/3.15 WORST_CASE(?,O(n^1)) 3.12/3.15 3.12/3.15 Preprocessing Cost Relations 3.12/3.15 ===================================== 3.12/3.15 3.12/3.15 #### Computed strongly connected components 3.12/3.15 0. recursive : [lbl101/13] 3.12/3.15 1. recursive : [lbl101_loop_cont/14,lbl91/13] 3.12/3.15 2. non_recursive : [exit_location/1] 3.12/3.15 3. non_recursive : [stop/7] 3.12/3.15 4. non_recursive : [lbl91_loop_cont/8] 3.12/3.15 5. non_recursive : [start/7] 3.12/3.15 6. non_recursive : [start0/7] 3.12/3.15 3.12/3.15 #### Obtained direct recursion through partial evaluation 3.12/3.15 0. SCC is partially evaluated into lbl101/13 3.12/3.15 1. SCC is partially evaluated into lbl91/13 3.12/3.15 2. SCC is completely evaluated into other SCCs 3.12/3.15 3. SCC is completely evaluated into other SCCs 3.12/3.15 4. SCC is partially evaluated into lbl91_loop_cont/8 3.12/3.15 5. SCC is partially evaluated into start/7 3.12/3.15 6. SCC is partially evaluated into start0/7 3.12/3.15 3.12/3.15 Control-Flow Refinement of Cost Relations 3.12/3.15 ===================================== 3.12/3.15 3.12/3.15 ### Specialization of cost equations lbl101/13 3.12/3.15 * CE 11 is refined into CE [20] 3.12/3.15 * CE 9 is refined into CE [21] 3.12/3.15 * CE 8 is refined into CE [22] 3.12/3.15 * CE 10 is refined into CE [23] 3.12/3.15 3.12/3.15 3.12/3.15 ### Cost equations --> "Loop" of lbl101/13 3.12/3.15 * CEs [23] --> Loop 17 3.12/3.15 * CEs [20] --> Loop 18 3.12/3.15 * CEs [21] --> Loop 19 3.12/3.15 * CEs [22] --> Loop 20 3.12/3.15 3.12/3.15 ### Ranking functions of CR lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M) 3.12/3.15 * RF of phase [17]: [-B+D+1,-B+E+1] 3.12/3.15 3.12/3.15 #### Partial ranking functions of CR lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M) 3.12/3.15 * Partial RF of phase [17]: 3.12/3.15 - RF of loop [17:1]: 3.12/3.15 -B+D+1 3.12/3.15 -B+E+1 3.12/3.15 3.12/3.15 3.12/3.15 ### Specialization of cost equations lbl91/13 3.12/3.15 * CE 14 is refined into CE [24,25] 3.12/3.15 * CE 19 is refined into CE [26] 3.12/3.15 * CE 16 is refined into CE [27,28] 3.12/3.15 * CE 17 is refined into CE [29] 3.12/3.15 * CE 15 is refined into CE [30,31] 3.12/3.15 * CE 18 is refined into CE [32] 3.12/3.15 3.12/3.15 3.12/3.15 ### Cost equations --> "Loop" of lbl91/13 3.12/3.15 * CEs [31] --> Loop 21 3.12/3.15 * CEs [30] --> Loop 22 3.12/3.15 * CEs [32] --> Loop 23 3.12/3.15 * CEs [25] --> Loop 24 3.12/3.15 * CEs [24] --> Loop 25 3.12/3.15 * CEs [26] --> Loop 26 3.12/3.15 * CEs [28] --> Loop 27 3.12/3.15 * CEs [27] --> Loop 28 3.12/3.15 * CEs [29] --> Loop 29 3.12/3.15 3.12/3.15 ### Ranking functions of CR lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M) 3.12/3.15 * RF of phase [21,22,23]: [-B+D+1,-C+D+1] 3.12/3.15 3.12/3.15 #### Partial ranking functions of CR lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M) 3.12/3.15 * Partial RF of phase [21,22,23]: 3.12/3.15 - RF of loop [21:1]: 3.12/3.15 -2*A-C+D-1 3.12/3.15 -3/2*A-B/2+E/2-1 3.12/3.15 -2/3*A-B/3+D/3-1/3 3.12/3.15 -B/2+E/2-1 3.12/3.15 -B/2+E/2-3/2*F-1 3.12/3.15 -B/3+D/3-1/3 3.12/3.15 -B/3+D/3-2/3*F-1/3 3.12/3.15 -C+D-1 3.12/3.15 -C+D-2*F-1 3.12/3.15 - RF of loop [22:1]: 3.12/3.15 -2*A-B+E-1 3.12/3.15 -A-C+D 3.12/3.15 -A/2-B/2+D/2 3.12/3.15 -B+E-1 3.12/3.15 -B+E-2*F-1 3.12/3.15 -B/2+D/2 3.12/3.15 -B/2+D/2-F/2 3.12/3.15 -C+D 3.12/3.15 -C+D-F 3.12/3.15 - RF of loop [23:1]: 3.12/3.15 -B+D+1 3.12/3.15 -C+D+1 3.12/3.15 3.12/3.15 3.12/3.15 ### Specialization of cost equations lbl91_loop_cont/8 popout

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

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46