details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.483821 seconds
cpu usage	0.402888
user time	0.378168
system time	0.02472
max virtual memory	113176.0
max residence set size	11988.0

stage attributes

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

output

0.03/0.38 WORST_CASE(?,O(n^2)) 0.03/0.38 0.03/0.38 Preprocessing Cost Relations 0.03/0.38 ===================================== 0.03/0.38 0.03/0.38 #### Computed strongly connected components 0.03/0.38 0. recursive : [evalfbb1in/7,evalfbb2in/7,evalfbb3in/7,evalfbb4in/7,evalfbbin/7] 0.03/0.38 1. non_recursive : [evalfstop/5] 0.03/0.38 2. non_recursive : [evalfreturnin/5] 0.03/0.38 3. non_recursive : [exit_location/1] 0.03/0.38 4. non_recursive : [evalfbb3in_loop_cont/6] 0.03/0.38 5. non_recursive : [evalfentryin/5] 0.03/0.38 6. non_recursive : [evalfstart/5] 0.03/0.38 0.03/0.38 #### Obtained direct recursion through partial evaluation 0.03/0.38 0. SCC is partially evaluated into evalfbb3in/7 0.03/0.38 1. SCC is completely evaluated into other SCCs 0.03/0.38 2. SCC is completely evaluated into other SCCs 0.03/0.38 3. SCC is completely evaluated into other SCCs 0.03/0.38 4. SCC is partially evaluated into evalfbb3in_loop_cont/6 0.03/0.38 5. SCC is partially evaluated into evalfentryin/5 0.03/0.38 6. SCC is partially evaluated into evalfstart/5 0.03/0.38 0.03/0.38 Control-Flow Refinement of Cost Relations 0.03/0.38 ===================================== 0.03/0.38 0.03/0.38 ### Specialization of cost equations evalfbb3in/7 0.03/0.38 * CE 7 is refined into CE [10] 0.03/0.38 * CE 3 is refined into CE [11] 0.03/0.38 * CE 6 is refined into CE [12] 0.03/0.38 * CE 5 is refined into CE [13] 0.03/0.38 * CE 4 is refined into CE [14] 0.03/0.38 0.03/0.38 0.03/0.38 ### Cost equations --> "Loop" of evalfbb3in/7 0.03/0.38 * CEs [13] --> Loop 10 0.03/0.38 * CEs [14] --> Loop 11 0.03/0.38 * CEs [10] --> Loop 12 0.03/0.38 * CEs [12] --> Loop 13 0.03/0.38 * CEs [11] --> Loop 14 0.03/0.38 0.03/0.38 ### Ranking functions of CR evalfbb3in(A,B,C,D,F,G,H) 0.03/0.38 0.03/0.38 #### Partial ranking functions of CR evalfbb3in(A,B,C,D,F,G,H) 0.03/0.38 * Partial RF of phase [10,11]: 0.03/0.38 - RF of loop [10:1]: 0.03/0.38 A-C depends on loops [11:1] 0.03/0.38 B-C-1 depends on loops [11:1] 0.03/0.38 - RF of loop [11:1]: 0.03/0.38 -A+C+1 depends on loops [10:1] 0.03/0.38 B-D 0.03/0.38 C depends on loops [10:1] 0.03/0.38 0.03/0.38 0.03/0.38 ### Specialization of cost equations evalfbb3in_loop_cont/6 0.03/0.38 * CE 9 is refined into CE [15] 0.03/0.38 * CE 8 is refined into CE [16] 0.03/0.38 0.03/0.38 0.03/0.38 ### Cost equations --> "Loop" of evalfbb3in_loop_cont/6 0.03/0.38 * CEs [15] --> Loop 15 0.03/0.38 * CEs [16] --> Loop 16 0.03/0.38 0.03/0.38 ### Ranking functions of CR evalfbb3in_loop_cont(A,B,C,D,E,F) 0.03/0.38 0.03/0.38 #### Partial ranking functions of CR evalfbb3in_loop_cont(A,B,C,D,E,F) 0.03/0.38 0.03/0.38 0.03/0.38 ### Specialization of cost equations evalfentryin/5 0.03/0.38 * CE 2 is refined into CE [17,18,19,20,21] 0.03/0.38 0.03/0.38 0.03/0.38 ### Cost equations --> "Loop" of evalfentryin/5 0.03/0.38 * CEs [17,18,19,20,21] --> Loop 17 0.03/0.38 0.03/0.38 ### Ranking functions of CR evalfentryin(A,B,C,D,F) 0.03/0.38 0.03/0.38 #### Partial ranking functions of CR evalfentryin(A,B,C,D,F) 0.03/0.38 0.03/0.38 0.03/0.38 ### Specialization of cost equations evalfstart/5 0.03/0.38 * CE 1 is refined into CE [22] 0.03/0.38 0.03/0.38 0.03/0.38 ### Cost equations --> "Loop" of evalfstart/5 0.03/0.38 * CEs [22] --> Loop 18 0.03/0.38 0.03/0.38 ### Ranking functions of CR evalfstart(A,B,C,D,F) 0.03/0.38 0.03/0.38 #### Partial ranking functions of CR evalfstart(A,B,C,D,F) 0.03/0.38 0.03/0.38 0.03/0.38 Computing Bounds 0.03/0.38 ===================================== 0.03/0.38 0.03/0.38 #### Cost of chains of evalfbb3in(A,B,C,D,F,G,H): 0.03/0.38 * Chain [[10,11],14]: 1*it(10)+1*it(11)+0 0.03/0.38 Such that:aux(19) =< B 0.03/0.38 aux(4) =< B-C 0.03/0.38 it(11) =< -D+H 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