/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f3/2] 1. non_recursive : [exit_location/1] 2. non_recursive : [f3_loop_cont/2] 3. non_recursive : [f0/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f3/2 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f0/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f3/2 * CE 3 is refined into CE [4] * CE 2 is refined into CE [5] ### Cost equations --> "Loop" of f3/2 * CEs [5] --> Loop 4 * CEs [4] --> Loop 5 ### Ranking functions of CR f3(A,B) #### Partial ranking functions of CR f3(A,B) ### Specialization of cost equations f0/2 * CE 1 is refined into CE [6,7] ### Cost equations --> "Loop" of f0/2 * CEs [7] --> Loop 6 * CEs [6] --> Loop 7 ### Ranking functions of CR f0(A,B) #### Partial ranking functions of CR f0(A,B) Computing Bounds ===================================== #### Cost of chains of f3(A,B): * Chain [[4]]...: 1*it(4)+0 with precondition: [B=2] * Chain [[4],5]: 1*it(4)+0 with precondition: [B=2] * Chain [5]: 0 with precondition: [B=2] #### Cost of chains of f0(A,B): * Chain [7]: 1*s(2)+0 with precondition: [] * Chain [6]...: 1*s(3)+0 with precondition: [] Closed-form bounds of f0(A,B): ------------------------------------- * Chain [7] with precondition: [] - Upper bound: inf - Complexity: infinity * Chain [6]... with precondition: [] - Upper bound: inf - Complexity: infinity ### Maximum cost of f0(A,B): inf Asymptotic class: infinity * Total analysis performed in 21 ms.