details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.337165 seconds
cpu usage	0.255086
user time	0.232256
system time	0.02283
max virtual memory	113176.0
max residence set size	11236.0

stage attributes

key	value
starexec-result	MAYBE

output

0.03/0.23 MAYBE 0.03/0.23 0.03/0.23 Preprocessing Cost Relations 0.03/0.23 ===================================== 0.03/0.23 0.03/0.23 #### Computed strongly connected components 0.03/0.23 0. recursive : [f2/13] 0.03/0.23 1. non_recursive : [exit_location/1] 0.03/0.23 2. non_recursive : [f300/12] 0.03/0.23 3. non_recursive : [f2_loop_cont/13] 0.03/0.23 4. non_recursive : [f1/12] 0.03/0.23 0.03/0.23 #### Obtained direct recursion through partial evaluation 0.03/0.23 0. SCC is partially evaluated into f2/13 0.03/0.23 1. SCC is completely evaluated into other SCCs 0.03/0.23 2. SCC is completely evaluated into other SCCs 0.03/0.23 3. SCC is partially evaluated into f2_loop_cont/13 0.03/0.23 4. SCC is partially evaluated into f1/12 0.03/0.23 0.03/0.23 Control-Flow Refinement of Cost Relations 0.03/0.23 ===================================== 0.03/0.23 0.03/0.23 ### Specialization of cost equations f2/13 0.03/0.23 * CE 6 is refined into CE [9] 0.03/0.23 * CE 5 is refined into CE [10] 0.03/0.23 * CE 2 is refined into CE [11] 0.03/0.23 * CE 3 is refined into CE [12] 0.03/0.23 * CE 4 is refined into CE [13] 0.03/0.23 0.03/0.23 0.03/0.23 ### Cost equations --> "Loop" of f2/13 0.03/0.23 * CEs [11] --> Loop 9 0.03/0.23 * CEs [12] --> Loop 10 0.03/0.23 * CEs [13] --> Loop 11 0.03/0.23 * CEs [9] --> Loop 12 0.03/0.23 * CEs [10] --> Loop 13 0.03/0.23 0.03/0.23 ### Ranking functions of CR f2(A,B,C,D,E,F,G,P,Q,R,S,T,U) 0.03/0.23 0.03/0.23 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,P,Q,R,S,T,U) 0.03/0.23 0.03/0.23 0.03/0.23 ### Specialization of cost equations f2_loop_cont/13 0.03/0.23 * CE 8 is refined into CE [14] 0.03/0.23 * CE 7 is refined into CE [15] 0.03/0.23 0.03/0.23 0.03/0.23 ### Cost equations --> "Loop" of f2_loop_cont/13 0.03/0.23 * CEs [14] --> Loop 14 0.03/0.23 * CEs [15] --> Loop 15 0.03/0.23 0.03/0.23 ### Ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 0.03/0.23 0.03/0.23 #### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 0.03/0.23 0.03/0.23 0.03/0.23 ### Specialization of cost equations f1/12 0.03/0.23 * CE 1 is refined into CE [16,17,18,19,20] 0.03/0.23 0.03/0.23 0.03/0.23 ### Cost equations --> "Loop" of f1/12 0.03/0.23 * CEs [19,20] --> Loop 16 0.03/0.23 * CEs [16] --> Loop 17 0.03/0.23 * CEs [18] --> Loop 18 0.03/0.23 * CEs [17] --> Loop 19 0.03/0.23 0.03/0.23 ### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,P) 0.03/0.23 0.03/0.23 #### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,P) 0.03/0.23 0.03/0.23 0.03/0.23 Computing Bounds 0.03/0.23 ===================================== 0.03/0.23 0.03/0.23 #### Cost of chains of f2(A,B,C,D,E,F,G,P,Q,R,S,T,U): 0.03/0.23 * Chain [[9,10,11]]...: 3*it(9)+0 0.03/0.23 with precondition: [B>=A+1] 0.03/0.23 0.03/0.23 * Chain [[9,10,11],12]: 3*it(9)+0 0.03/0.23 with precondition: [P=3,B>=A+1] 0.03/0.23 0.03/0.23 * Chain [13]: 0 0.03/0.23 with precondition: [P=2,S=E,T=F,A>=B] 0.03/0.23 0.03/0.23 * Chain [12]: 0 0.03/0.23 with precondition: [P=3] 0.03/0.23 0.03/0.23 0.03/0.23 #### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M): 0.03/0.23 * Chain [15]: 0 0.03/0.23 with precondition: [A=2,L=I,K=J] 0.03/0.23 0.03/0.23 * Chain [14]: 0 0.03/0.23 with precondition: [A=3,L=I,K=J] 0.03/0.23 0.03/0.23 0.03/0.23 #### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,P): 0.03/0.23 * Chain [19]: 0 0.03/0.23 with precondition: [] 0.03/0.23 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