Function substeps_for 

pub fn substeps_for(dt: Time, limit: Time) -> u32

How many equal substeps of at most limit it takes to cover dt.

The deterministic answer to a stability limit: rather than shrinking the step to whatever the local error asks for, take an integer number of equal ones. Two runs of the same scene take the same count, so the arithmetic follows the same path.