Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990211
details
property
value
status
complete
benchmark
eric2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n012.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
3.33235 seconds
cpu usage
3.25158
user time
3.21355
system time
0.038026
max virtual memory
321172.0
max residence set size
18016.0
stage attributes
key
value
starexec-result
MAYBE
output
3.21/3.22 MAYBE 3.21/3.22 3.21/3.22 Preprocessing Cost Relations 3.21/3.22 ===================================== 3.21/3.22 3.21/3.22 #### Computed strongly connected components 3.21/3.22 0. recursive : [f2/49] 3.21/3.22 1. recursive : [f1/30,f2_loop_cont/31] 3.21/3.22 2. non_recursive : [exit_location/1] 3.21/3.22 3. non_recursive : [f1_loop_cont/2] 3.21/3.22 4. non_recursive : [f999/30] 3.21/3.22 3.21/3.22 #### Obtained direct recursion through partial evaluation 3.21/3.22 0. SCC is partially evaluated into f2/49 3.21/3.22 1. SCC is partially evaluated into f1/30 3.21/3.22 2. SCC is completely evaluated into other SCCs 3.21/3.22 3. SCC is completely evaluated into other SCCs 3.21/3.22 4. SCC is partially evaluated into f999/30 3.21/3.22 3.21/3.22 Control-Flow Refinement of Cost Relations 3.21/3.22 ===================================== 3.21/3.22 3.21/3.22 ### Specialization of cost equations f2/49 3.21/3.22 * CE 12 is refined into CE [13] 3.21/3.22 * CE 7 is refined into CE [14] 3.21/3.22 * CE 9 is refined into CE [15] 3.21/3.22 * CE 10 is refined into CE [16] 3.21/3.22 * CE 11 is refined into CE [17] 3.21/3.22 * CE 8 is refined into CE [18] 3.21/3.22 3.21/3.22 3.21/3.22 ### Cost equations --> "Loop" of f2/49 3.21/3.22 * CEs [17] --> Loop 13 3.21/3.22 * CEs [18] --> Loop 14 3.21/3.22 * CEs [13] --> Loop 15 3.21/3.22 * CEs [15] --> Loop 16 3.21/3.22 * CEs [14] --> Loop 17 3.21/3.22 * CEs [16] --> Loop 18 3.21/3.22 3.21/3.22 ### Ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2) 3.21/3.22 3.21/3.22 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2) 3.21/3.22 3.21/3.22 3.21/3.22 ### Specialization of cost equations f1/30 3.21/3.22 * CE 2 is refined into CE [19,20] 3.21/3.22 * CE 6 is refined into CE [21] 3.21/3.22 * CE 3 is refined into CE [22,23,24,25,26,27,28] 3.21/3.22 * CE 5 is refined into CE [29] 3.21/3.22 * CE 4 is refined into CE [30] 3.21/3.22 3.21/3.22 3.21/3.22 ### Cost equations --> "Loop" of f1/30 3.21/3.22 * CEs [29] --> Loop 19 3.21/3.22 * CEs [30] --> Loop 20 3.21/3.22 * CEs [27] --> Loop 21 3.21/3.22 * CEs [26] --> Loop 22 3.21/3.22 * CEs [25] --> Loop 23 3.21/3.22 * CEs [24] --> Loop 24 3.21/3.22 * CEs [23] --> Loop 25 3.21/3.22 * CEs [22] --> Loop 26 3.21/3.22 * CEs [28] --> Loop 27 3.21/3.22 * CEs [19] --> Loop 28 3.21/3.22 * CEs [21] --> Loop 29 3.21/3.22 * CEs [20] --> Loop 30 3.21/3.22 3.21/3.22 ### 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,U,V,W,X,Y,Z,A1,B1,C1,E1) 3.21/3.22 3.21/3.22 #### 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,U,V,W,X,Y,Z,A1,B1,C1,E1) 3.21/3.22 * Partial RF of phase [19,20,21,22,23,24,25,26,27]: 3.21/3.22 - RF of loop [19:1]: 3.21/3.22 C depends on loops [20:1,21:1,22:1,23:1,24:1,25:1,26:1,27:1] 3.21/3.22 - RF of loop [20:1]: 3.21/3.22 C+H depends on loops [21:1,22:1,23:1,24:1,25:1,26:1,27:1] 3.21/3.22 - RF of loop [24:1]: 3.21/3.22 C+D+H depends on loops [21:1,22:1,23:1,25:1,26:1,27:1] 3.21/3.22 - RF of loop [26:1]: 3.21/3.22 C/2+D/2+H/2+I/2-1/2 depends on loops [21:1,23:1,25:1,27:1] 3.21/3.22 3.21/3.22 3.21/3.22 ### Specialization of cost equations f999/30 3.21/3.22 * CE 1 is refined into CE [31,32,33,34] 3.21/3.22 3.21/3.22 3.21/3.22 ### Cost equations --> "Loop" of f999/30 3.21/3.22 * CEs [33,34] --> Loop 31 3.21/3.22 * CEs [31,32] --> Loop 32 3.21/3.22 3.21/3.22 ### Ranking functions of CR f999(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,A1,B1,C1,E1) 3.21/3.22 3.21/3.22 #### Partial ranking functions of CR f999(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,A1,B1,C1,E1) 3.21/3.22 3.21/3.22 3.21/3.22 Computing Bounds 3.21/3.22 ===================================== 3.21/3.22 3.21/3.22 #### Cost of chains of f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2): 3.21/3.22 * Chain [[13,14]]...: 2*it(13)+0 3.21/3.22 with precondition: [A=0,B=0,C=0,E1>=2,3>=E1] 3.21/3.22
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