The problem of the number of days plus the treewidth is fixed-parameter tractable. A word RAM program computes the answer within $c * g k * (|x| + 1) ^ c$ instructions, where $k$ is the number of days plus the treewidth of the overall conflict graph, for a function $g$ of $k$ alone. The program is compiled from an IMP+ program whose correctness and cost are proved in $Machine/Tw*.lean$; the theorem of Bodlaender and Kloks that finds a nice tree decomposition of small width in time $2^{O(w^3)}$ times a polynomial ($Lax117284.Bodlaender.niceDecomposition_computable$) is proved, in $BodlaenderProved.lean$, from its proof in lax-689794.