private static Set<Branch> collectUncoveredBranches(Set<Branch> coveredBranches){
  Set<Branch> uncoveredBranches=new HashSet<Branch>();
  for (  Branch b : coveredBranches) {
    final Branch negate=b.negate();
    if (!coveredBranches.contains(negate)) {
      uncoveredBranches.add(negate);
    }
  }
  return uncoveredBranches;
}

private static Set < Branch > collectUncoveredBranches ( Set < Branch > coveredBranches ) { Set < Branch > uncoveredBranches = new HashSet < Branch > ( ) ; for ( Branch b : coveredBranches ) { final Branch negate = b . negate ( ) ; if ( ! coveredBranches . contains ( negate ) ) { uncoveredBranches . add ( negate ) ; } } return uncoveredBranches ; }
returns those branches that are reached but are not covered
