details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.215904 seconds
cpu usage	0.133878
user time	0.114526
system time	0.019352
max virtual memory	113176.0
max residence set size	10980.0

stage attributes

key	value
starexec-result	MAYBE

output

0.03/0.11 MAYBE 0.03/0.11 0.03/0.11 Preprocessing Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Computed strongly connected components 0.03/0.11 0. recursive : [f2/4] 0.03/0.11 1. non_recursive : [exit_location/1] 0.03/0.11 2. non_recursive : [f3/3] 0.03/0.11 3. non_recursive : [f2_loop_cont/4] 0.03/0.11 4. non_recursive : [f1/3] 0.03/0.11 0.03/0.11 #### Obtained direct recursion through partial evaluation 0.03/0.11 0. SCC is partially evaluated into f2/4 0.03/0.11 1. SCC is completely evaluated into other SCCs 0.03/0.11 2. SCC is completely evaluated into other SCCs 0.03/0.11 3. SCC is partially evaluated into f2_loop_cont/4 0.03/0.11 4. SCC is partially evaluated into f1/3 0.03/0.11 0.03/0.11 Control-Flow Refinement of Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 ### Specialization of cost equations f2/4 0.03/0.11 * CE 4 is refined into CE [7] 0.03/0.11 * CE 3 is discarded (unfeasible) 0.03/0.11 * CE 2 is refined into CE [8] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f2/4 0.03/0.11 * CEs [8] --> Loop 7 0.03/0.11 * CEs [7] --> Loop 8 0.03/0.11 0.03/0.11 ### Ranking functions of CR f2(A,B,C,D) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f2(A,B,C,D) 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f2_loop_cont/4 0.03/0.11 * CE 6 is refined into CE [9] 0.03/0.11 * CE 5 is refined into CE [10] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f2_loop_cont/4 0.03/0.11 * CEs [9] --> Loop 9 0.03/0.11 * CEs [10] --> Loop 10 0.03/0.11 0.03/0.11 ### Ranking functions of CR f2_loop_cont(A,B,C,D) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f2_loop_cont(A,B,C,D) 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f1/3 0.03/0.11 * CE 1 is refined into CE [11,12,13] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f1/3 0.03/0.11 * CEs [12,13] --> Loop 11 0.03/0.11 * CEs [11] --> Loop 12 0.03/0.11 0.03/0.11 ### Ranking functions of CR f1(A,B,C) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f1(A,B,C) 0.03/0.11 0.03/0.11 0.03/0.11 Computing Bounds 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Cost of chains of f2(A,B,C,D): 0.03/0.11 * Chain [[7]]...: 1*it(7)+0 0.03/0.11 with precondition: [0>=B+2,A>=1] 0.03/0.11 0.03/0.11 * Chain [[7],8]: 1*it(7)+0 0.03/0.11 with precondition: [C=3,0>=B+2,A>=1] 0.03/0.11 0.03/0.11 * Chain [8]: 0 0.03/0.11 with precondition: [C=3,0>=B+2,A>=1] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f2_loop_cont(A,B,C,D): 0.03/0.11 * Chain [10]: 0 0.03/0.11 with precondition: [A=2,0>=C+2] 0.03/0.11 0.03/0.11 * Chain [9]: 0 0.03/0.11 with precondition: [A=3,0>=C+2] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f1(A,B,C): 0.03/0.11 * Chain [12]: 1*s(2)+0 0.03/0.11 with precondition: [A>=1,0>=A+B+1] 0.03/0.11 0.03/0.11 * Chain [11]...: 1*aux(2)+0 0.03/0.11 with precondition: [A>=1,0>=A+B+1] 0.03/0.11 0.03/0.11 0.03/0.11 Closed-form bounds of f1(A,B,C): 0.03/0.11 ------------------------------------- 0.03/0.11 * Chain [12] with precondition: [A>=1,0>=A+B+1] 0.03/0.11 - Upper bound: inf 0.03/0.11 - Complexity: infinity 0.03/0.11 * Chain [11]... with precondition: [A>=1,0>=A+B+1] 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