details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.217321872711 seconds
cpu usage	0.128985435
max memory	8572928.0

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f/4] 1. non_recursive : [exit_location/1] 2. non_recursive : [f_loop_cont/2] 3. non_recursive : [start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f/4 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f/4 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] * CE 2 is refined into CE [7] ### Cost equations --> "Loop" of f/4 * CEs [6] --> Loop 5 * CEs [7] --> Loop 6 * CEs [5] --> Loop 7 ### Ranking functions of CR f(A,B,C,D) * RF of phase [5,6]: [A-B-C] #### Partial ranking functions of CR f(A,B,C,D) * Partial RF of phase [5,6]: - RF of loop [5:1,6:1]: A-B-C ### Specialization of cost equations start/4 * CE 1 is refined into CE [8,9] ### Cost equations --> "Loop" of start/4 * CEs [9] --> Loop 8 * CEs [8] --> Loop 9 ### Ranking functions of CR start(A,B,C,D) #### Partial ranking functions of CR start(A,B,C,D) Computing Bounds ===================================== #### Cost of chains of f(A,B,C,D): * Chain [[5,6],7]: 2*it(5)+0 Such that:aux(3) =< A-B-C it(5) =< aux(3) with precondition: [D=2,A>=B+C+1] * Chain [7]: 0 with precondition: [D=2] #### Cost of chains of start(A,B,C,D): * Chain [9]: 0 with precondition: [] * Chain [8]: 2*s(2)+0 Such that:s(1) =< A-B-C s(2) =< s(1) with precondition: [A>=B+C+1] Closed-form bounds of start(A,B,C,D): ------------------------------------- * Chain [9] with precondition: [] - Upper bound: 0 - Complexity: constant * Chain [8] with precondition: [A>=B+C+1] - Upper bound: 2*A-2*B-2*C - Complexity: n ### Maximum cost of start(A,B,C,D): nat(A-B-C)*2 Asymptotic class: n * Total analysis performed in 53 ms. popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843