A total [k]-coloring of a graph G is a mapping ?: V (G) ∪E(G) → {1,2, ..., k} such that any two adjacent elements in V (G)∪E(G) receive different colors. Let f(v) denote the sum of the colors of a vertex v and the colors of all incident edges of v. A total [k]-neighbor sum distinguishing-coloring of G is a total [k]-coloring of G such that for each edge uv ∈E(G),f(u)≠f(v). By χnsd″(G), we denote the smallest value k in such a coloring of G. Pil?niak and Wo?niak conjectured χnsd″(G)≤?(G)+3 for any simple graph with maximum degree Δ(G). This conjecture has been proved for complete graphs, cycles, bipartite graphs, and subcubic graphs. In this paper, we prove that it also holds for K4-minor free graphs. Furthermore, we show that if G is a K4-minor free graph with ?(G)≥4, then χnsd″(G)≤?(G)+2 The bound Δ(G) + 2 is sharp.