details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.186661958694 seconds
cpu usage	0.09799144
max memory	8257536.0

stage attributes

key	value
output-size	2224
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f1/2] 1. non_recursive : [exit_location/1] 2. non_recursive : [f1_loop_cont/2] 3. non_recursive : [f0/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f1/2 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f0/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f1/2 * CE 3 is refined into CE [4] * CE 2 is refined into CE [5] ### Cost equations --> "Loop" of f1/2 * CEs [5] --> Loop 4 * CEs [4] --> Loop 5 ### Ranking functions of CR f1(A,B) #### Partial ranking functions of CR f1(A,B) ### Specialization of cost equations f0/2 * CE 1 is refined into CE [6,7,8] ### Cost equations --> "Loop" of f0/2 * CEs [8] --> Loop 6 * CEs [7] --> Loop 7 * CEs [6] --> Loop 8 ### Ranking functions of CR f0(A,B) #### Partial ranking functions of CR f0(A,B) Computing Bounds ===================================== #### Cost of chains of f1(A,B): * Chain [[4]]...: 1*it(4)+0 with precondition: [A>=0,B=2] * Chain [[4],5]: 1*it(4)+0 with precondition: [B=2,A>=0] * Chain [5]: 0 with precondition: [B=2] #### Cost of chains of f0(A,B): * Chain [8]: 0 with precondition: [] * Chain [7]: 1*s(1)+0 with precondition: [A>=0] * Chain [6]...: 1*s(2)+0 with precondition: [A>=0] Closed-form bounds of f0(A,B): ------------------------------------- * Chain [8] with precondition: [] - Upper bound: 0 - Complexity: constant * Chain [7] with precondition: [A>=0] - Upper bound: inf - Complexity: infinity * Chain [6]... with precondition: [A>=0] - Upper bound: inf - Complexity: infinity ### Maximum cost of f0(A,B): inf Asymptotic class: infinity * Total analysis performed in 22 ms. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843