// The checker's bound for the counter is stop + STEP, folded as a double: // 9007199254740991 + 2 rounds down. The way out of the loop then holds a // contradiction, and anything after the loop is proved. // MUST-NOT-PROVE: assert@9 // RUN-STOPS: overflow@6 FOR I <- 9007199254740990 TO 9007199254740991 STEP 2 OUTPUT I NEXT I ASSERT 1 == 2