It relaxes some edges twice and double-counts their weight.

The priority queue cannot hold a negative key.

It reports a negative cycle even when the graph has none.

The algorithm never terminates, because the estimates keep decreasing.

A vertex can be removed from the priority queue and its distance treated as final before a cheaper path to it is discovered.