Find worst case input for a program solving an NP-hard problem
See Fast Reduction from RSA to SAT for some ways to get hard instances of SAT.  Then, you can use the known reductions to turn these into hard instances for ILP.  You could also use the SAT instances at http://www.satcompetition.org/, too.