details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.299492 seconds
cpu usage	0.217294
user time	0.200354
system time	0.01694
max virtual memory	113176.0
max residence set size	11388.0

stage attributes

key	value
starexec-result	WORST_CASE(?,O(n^1))

output

0.03/0.19 WORST_CASE(?,O(n^1)) 0.03/0.19 0.03/0.19 Preprocessing Cost Relations 0.03/0.19 ===================================== 0.03/0.19 0.03/0.19 #### Computed strongly connected components 0.03/0.19 0. recursive : [eval2/5] 0.03/0.19 1. recursive : [eval1/3,eval2_loop_cont/4] 0.03/0.19 2. non_recursive : [exit_location/1] 0.03/0.19 3. non_recursive : [eval1_loop_cont/2] 0.03/0.19 4. non_recursive : [start/3] 0.03/0.19 0.03/0.19 #### Obtained direct recursion through partial evaluation 0.03/0.19 0. SCC is partially evaluated into eval2/5 0.03/0.19 1. SCC is partially evaluated into eval1/3 0.03/0.19 2. SCC is completely evaluated into other SCCs 0.03/0.19 3. SCC is completely evaluated into other SCCs 0.03/0.19 4. SCC is partially evaluated into start/3 0.03/0.19 0.03/0.19 Control-Flow Refinement of Cost Relations 0.03/0.19 ===================================== 0.03/0.19 0.03/0.19 ### Specialization of cost equations eval2/5 0.03/0.19 * CE 7 is refined into CE [8] 0.03/0.19 * CE 6 is refined into CE [9] 0.03/0.19 * CE 5 is refined into CE [10] 0.03/0.19 0.03/0.19 0.03/0.19 ### Cost equations --> "Loop" of eval2/5 0.03/0.19 * CEs [10] --> Loop 8 0.03/0.19 * CEs [8] --> Loop 9 0.03/0.19 * CEs [9] --> Loop 10 0.03/0.19 0.03/0.19 ### Ranking functions of CR eval2(A,B,C,D,E) 0.03/0.19 * RF of phase [8]: [B] 0.03/0.19 0.03/0.19 #### Partial ranking functions of CR eval2(A,B,C,D,E) 0.03/0.19 * Partial RF of phase [8]: 0.03/0.19 - RF of loop [8:1]: 0.03/0.19 B 0.03/0.19 0.03/0.19 0.03/0.19 ### Specialization of cost equations eval1/3 0.03/0.19 * CE 2 is refined into CE [11,12] 0.03/0.19 * CE 4 is refined into CE [13] 0.03/0.19 * CE 3 is refined into CE [14,15] 0.03/0.19 0.03/0.19 0.03/0.19 ### Cost equations --> "Loop" of eval1/3 0.03/0.19 * CEs [15] --> Loop 11 0.03/0.19 * CEs [14] --> Loop 12 0.03/0.19 * CEs [12] --> Loop 13 0.03/0.19 * CEs [11] --> Loop 14 0.03/0.19 * CEs [13] --> Loop 15 0.03/0.19 0.03/0.19 ### Ranking functions of CR eval1(A,B,C) 0.03/0.19 * RF of phase [11]: [A] 0.03/0.19 0.03/0.19 #### Partial ranking functions of CR eval1(A,B,C) 0.03/0.19 * Partial RF of phase [11]: 0.03/0.19 - RF of loop [11:1]: 0.03/0.19 A 0.03/0.19 0.03/0.19 0.03/0.19 ### Specialization of cost equations start/3 0.03/0.19 * CE 1 is refined into CE [16,17,18,19,20,21,22] 0.03/0.19 0.03/0.19 0.03/0.19 ### Cost equations --> "Loop" of start/3 0.03/0.19 * CEs [22] --> Loop 16 0.03/0.19 * CEs [21] --> Loop 17 0.03/0.19 * CEs [20] --> Loop 18 0.03/0.19 * CEs [19] --> Loop 19 0.03/0.19 * CEs [18] --> Loop 20 0.03/0.19 * CEs [17] --> Loop 21 0.03/0.19 * CEs [16] --> Loop 22 0.03/0.19 0.03/0.19 ### Ranking functions of CR start(A,B,C) 0.03/0.19 0.03/0.19 #### Partial ranking functions of CR start(A,B,C) 0.03/0.19 0.03/0.19 0.03/0.19 Computing Bounds 0.03/0.19 ===================================== 0.03/0.19 0.03/0.19 #### Cost of chains of eval2(A,B,C,D,E): 0.03/0.19 * Chain [[8],10]: 1*it(8)+0 0.03/0.19 Such that:it(8) =< B 0.03/0.19 0.03/0.19 with precondition: [C=2,E=0,A=D+1,A>=1,B>=1] 0.03/0.19 0.03/0.19 * Chain [[8],9]: 1*it(8)+0 0.03/0.19 Such that:it(8) =< B 0.03/0.19 0.03/0.19 with precondition: [C=3,A>=1,B>=1] 0.03/0.19 0.03/0.19 * Chain [10]: 0 0.03/0.19 with precondition: [C=2,A=D+1,B=E,0>=B,A>=1] 0.03/0.19 0.03/0.19 * Chain [9]: 0 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