details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	1.14534 seconds
cpu usage	1.06469
user time	1.03943
system time	0.025261
max virtual memory	316652.0
max residence set size	13464.0

stage attributes

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

output

1.02/1.04 WORST_CASE(?,O(n^1)) 1.02/1.04 1.02/1.04 Preprocessing Cost Relations 1.02/1.04 ===================================== 1.02/1.04 1.02/1.04 #### Computed strongly connected components 1.02/1.04 0. recursive : [f1/40] 1.02/1.04 1. non_recursive : [exit_location/1] 1.02/1.04 2. recursive : [f10/29] 1.02/1.04 3. non_recursive : [f4/25] 1.02/1.04 4. non_recursive : [f10_loop_cont/26] 1.02/1.04 5. non_recursive : [f1_loop_cont/26] 1.02/1.04 6. non_recursive : [f3/25] 1.02/1.04 1.02/1.04 #### Obtained direct recursion through partial evaluation 1.02/1.04 0. SCC is partially evaluated into f1/40 1.02/1.04 1. SCC is completely evaluated into other SCCs 1.02/1.04 2. SCC is partially evaluated into f10/29 1.02/1.04 3. SCC is completely evaluated into other SCCs 1.02/1.04 4. SCC is partially evaluated into f10_loop_cont/26 1.02/1.04 5. SCC is partially evaluated into f1_loop_cont/26 1.02/1.04 6. SCC is partially evaluated into f3/25 1.02/1.04 1.02/1.04 Control-Flow Refinement of Cost Relations 1.02/1.04 ===================================== 1.02/1.04 1.02/1.04 ### Specialization of cost equations f1/40 1.02/1.04 * CE 4 is refined into CE [14] 1.02/1.04 * CE 5 is refined into CE [15] 1.02/1.04 * CE 6 is refined into CE [16] 1.02/1.04 * CE 3 is refined into CE [17] 1.02/1.04 1.02/1.04 1.02/1.04 ### Cost equations --> "Loop" of f1/40 1.02/1.04 * CEs [17] --> Loop 14 1.02/1.04 * CEs [14] --> Loop 15 1.02/1.04 * CEs [15] --> Loop 16 1.02/1.04 * CEs [16] --> Loop 17 1.02/1.04 1.02/1.04 ### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 1.02/1.04 * RF of phase [14]: [A-B] 1.02/1.04 1.02/1.04 #### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 1.02/1.04 * Partial RF of phase [14]: 1.02/1.04 - RF of loop [14:1]: 1.02/1.04 A-B 1.02/1.04 1.02/1.04 1.02/1.04 ### Specialization of cost equations f10/29 1.02/1.04 * CE 11 is refined into CE [18] 1.02/1.04 * CE 10 is refined into CE [19] 1.02/1.04 * CE 9 is refined into CE [20] 1.02/1.04 1.02/1.04 1.02/1.04 ### Cost equations --> "Loop" of f10/29 1.02/1.04 * CEs [20] --> Loop 18 1.02/1.04 * CEs [18] --> Loop 19 1.02/1.04 * CEs [19] --> Loop 20 1.02/1.04 1.02/1.04 ### Ranking functions of CR f10(A,B,C,I,K,N,P,Q,R,S,T,U,V,W,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1) 1.02/1.04 * RF of phase [18]: [U+1] 1.02/1.04 1.02/1.04 #### Partial ranking functions of CR f10(A,B,C,I,K,N,P,Q,R,S,T,U,V,W,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1) 1.02/1.04 * Partial RF of phase [18]: 1.02/1.04 - RF of loop [18:1]: 1.02/1.04 U+1 1.02/1.04 1.02/1.04 1.02/1.04 ### Specialization of cost equations f10_loop_cont/26 1.02/1.04 * CE 13 is refined into CE [21] 1.02/1.04 * CE 12 is refined into CE [22] 1.02/1.04 1.02/1.04 1.02/1.04 ### Cost equations --> "Loop" of f10_loop_cont/26 1.02/1.04 * CEs [21] --> Loop 21 1.02/1.04 * CEs [22] --> Loop 22 1.02/1.04 1.02/1.04 ### Ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 1.02/1.04 1.02/1.04 #### Partial ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 1.02/1.04 1.02/1.04 1.02/1.04 ### Specialization of cost equations f1_loop_cont/26 1.02/1.04 * CE 8 is refined into CE [23,24,25,26] 1.02/1.04 * CE 7 is refined into CE [27] 1.02/1.04 1.02/1.04 1.02/1.04 ### Cost equations --> "Loop" of f1_loop_cont/26 1.02/1.04 * CEs [26] --> Loop 23 1.02/1.04 * CEs [25] --> Loop 24 1.02/1.04 * CEs [24] --> Loop 25 1.02/1.04 * CEs [23] --> Loop 26 1.02/1.04 * CEs [27] --> Loop 27 1.02/1.04 1.02/1.04 ### Ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 1.02/1.04 1.02/1.04 #### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 1.02/1.04 1.02/1.04 1.02/1.04 ### Specialization of cost equations f3/25 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