The following graph depicts all algorithmic steps of the state machine (see the description of the propagator implementation).
Each box in this diagram represents a function call of Octopus, which is related to the algorithmic steps of the propagation.
It can be seen how all three systems step through the above algorithmic steps of the Verlet algorithm. You can use the (+) and (-) buttons to manually step through the algorithm to see in which order the steps are performed, and in which steps the various clocks of the systems are advanced.
The interactive graph also allows to display the (unphysical) container systems and the so-called ‘‘ghost’’ interactions, which are always present and are an internal tool to ensure that systems stay synchronized, even if they do not have a physical interaction between them.
You can set the variable Debug = info in the input file and (re-)run the example. Look for the ‘‘Debug:’’ lines in the output can compare to the graph above.