A $k^{*}$-container of a graph G is a set of k disjoint paths between any pair of nodes whose union covers all nodes of G. The spanning connectivity of G, ${\kappa }^{*}\left(G\right)$, is the largest k, such that there exists a $j^{*}$-container between any pair of nodes of G for all $1\le j\le k$. If ${\kappa }^{*}\left(G\right)=\kappa \left(G\right)$, then G is super spanning connected. Spanning connectivity is an important property to measure the fault tolerance of an interconnection network. The divide-and-swap cube $DS{C}_n$ is a newly proposed hypercube variant, which reduces the network cost from $O\left(n^2\right)$ to $O\left(n{log}_{2}n\right)$ compared with the hypercube and other hypercube variants. The folded divide-and-swap cube $FDS{C}_n$ is proposed based on $DS{C}_n$ to reduce the diameter of $DS{C}_n$. Both $DS{C}_n$ and $FDS{C}_n$ possess many better properties than hypercubes. In this paper, we investigate the super spanning connectivity of $FDS{C}_n$ where $n=2^d$ and $d\ge 1$. We show that ${\kappa }^{*}\left(FDS{C}_n\right)=\kappa \left(FDS{C}_n\right)=d+2$, which means there exists an m-DPC(node-disjoint path cover) between any pair of nodes in $FDS{C}_n$ for all $1\le m\le d+2$.