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