An introduction to lockless algorithms

I didn't understand the second example with the smp_r/wmb. Can't there be a case that 'thread 2' starts and finishes before 'thread 1' ? or the case where 'thread 1' only do "a.x=1" and then 'thread 2' executes until the end?