The claim is not true in general. Option(A)
Consider the graph with nodes A,B,C and A->B, A->C, B->C with weights 1,1,-1 in that order. The shortest path from A to C is A->B->C with weight 0. Your strategy adds two to all weights, making A->C shorter (weight 3).