Maximum flow with Edmonds–Karp algorithm
I'm sure you have a misunderstanding.  Try simulating the Edmonds-Karp algorithm by hand on the first example, then edit the question to show the residual graph you've got after it finishes.  I'm sure you'll find there remains an augmenting path from $s$ to $t$ in the residual graph.  If you don't draw the residual graph explicitly, you might fail to notice the path -- you can't do this in your head without drawing the graph on paper.

Many students get tripped up by the fact that there might be an augmenting path in the residual graph that looks like it goes "backwards" in the original graph; that's OK, and it still counts as an augmenting graph.