Incorrect proof of closure under the star operation using NFA results in the NFA recognizing undesired strings?
Consider a two state automaton for the language $a^*b$, two transitions from the initial state, one looping with label $a$, the other with label $b$ to the final state.

Making the initial state final, would also accept $a^*$.