Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744093
details
property
value
status
complete
benchmark
logarithmic.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n079.star.cs.uiowa.edu
space
misc
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.0748810768127 seconds
cpu usage
0.088433204
max memory
8335360.0
stage attributes
key
value
output-size
1802
starexec-result
WORST_CASE(?,O(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(1)) WARNING: Excluded non-linear constraints:[D=A*C] Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [a/2] 1. non_recursive : [exit_location/1] 2. non_recursive : [a_loop_cont/2] 3. non_recursive : [start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into a/2 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations a/2 * CE 2 is refined into CE [3] ### Cost equations --> "Loop" of a/2 * CEs [3] --> Loop 3 ### Ranking functions of CR a(A,C) #### Partial ranking functions of CR a(A,C) ### Specialization of cost equations start/2 * CE 1 is refined into CE [4] ### Cost equations --> "Loop" of start/2 * CEs [4] --> Loop 4 ### Ranking functions of CR start(A,C) #### Partial ranking functions of CR start(A,C) Computing Bounds ===================================== #### Cost of chains of a(A,C): * Chain [3]: 0 with precondition: [C=2,A>=1] #### Cost of chains of start(A,C): * Chain [4]: 0 with precondition: [A>=1] Closed-form bounds of start(A,C): ------------------------------------- * Chain [4] with precondition: [A>=1] - Upper bound: 0 - Complexity: constant ### Maximum cost of start(A,C): 0 Asymptotic class: constant * Total analysis performed in 13 ms.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843