The next run of the program produced the graph GCrb‘o, pictured below.
This graph was only difficult momentarily. Patrick recognized that it was triangle-free and that one of the “special bounds” mentioned in the survey on bounds applies, namely Fajtlowicz’s bound 5n/14 lower bound for triangle-free graphs with maximum degree no more than 3. So its solved now too. Here’s the newest difficult graph: