details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.230712890625 seconds
cpu usage	0.145083376
max memory	8331264.0

stage attributes

key	value
output-size	3319
starexec-result	WORST_CASE(?,O(1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f4/3,f5/3] 1. non_recursive : [exit_location/1] 2. non_recursive : [f14/2] 3. non_recursive : [f11/2] 4. non_recursive : [f4_loop_cont/3] 5. non_recursive : [f0/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f4/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f11/2 4. SCC is partially evaluated into f4_loop_cont/3 5. SCC is partially evaluated into f0/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f4/3 * CE 4 is refined into CE [9] * CE 3 is refined into CE [10] * CE 2 is refined into CE [11] ### Cost equations --> "Loop" of f4/3 * CEs [11] --> Loop 9 * CEs [9] --> Loop 10 * CEs [10] --> Loop 11 ### Ranking functions of CR f4(A,C,D) * RF of phase [9]: [-A+3] #### Partial ranking functions of CR f4(A,C,D) * Partial RF of phase [9]: - RF of loop [9:1]: -A+3 ### Specialization of cost equations f11/2 * CE 8 is refined into CE [12] * CE 7 is refined into CE [13] ### Cost equations --> "Loop" of f11/2 * CEs [12] --> Loop 12 * CEs [13] --> Loop 13 ### Ranking functions of CR f11(A,C) #### Partial ranking functions of CR f11(A,C) ### Specialization of cost equations f4_loop_cont/3 * CE 6 is refined into CE [14] * CE 5 is refined into CE [15,16] ### Cost equations --> "Loop" of f4_loop_cont/3 * CEs [14] --> Loop 14 * CEs [16] --> Loop 15 * CEs [15] --> Loop 16 ### Ranking functions of CR f4_loop_cont(A,B,C) #### Partial ranking functions of CR f4_loop_cont(A,B,C) ### Specialization of cost equations f0/2 * CE 1 is refined into CE [17,18,19,20,21] ### Cost equations --> "Loop" of f0/2 * CEs [17,18,19,20,21] --> Loop 17 ### Ranking functions of CR f0(A,C) #### Partial ranking functions of CR f0(A,C) Computing Bounds ===================================== #### Cost of chains of f4(A,C,D): * Chain [[9],11]: 1*it(9)+0 Such that:it(9) =< -A+D with precondition: [C=2,3>=D,A>=0,D>=A+1] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843