details

property	value
status	complete
benchmark	sect5-len.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n019.star.cs.uiowa.edu
space	KoAT-2013

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.228665 seconds
cpu usage	0.146796
user time	0.127738
system time	0.019058
max virtual memory	113176.0
max residence set size	11160.0

stage attributes

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

output

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