Show that CoinGrider halts searching when the number of attempts exceeds TOTAL_TRIES. To do so, show that a solution is found, then add one more entry to the same set of inputs. Since the search orders by effective_value, the solution is constructed such that only values with the lowest effective_value have the least weight. Only the lowest weight values will not exceed the max_selection_weight. Therefore, CoinGrinder will not evaluate all lowest weight solutions together before exceeding TOTAL_TRIES since they are last found.
This test case was inspired by a similar test for BnB currently named bnb_test.