[stree] Suboptimal Memlet propagation

## Description

The "Schedule tree" is an experimental feature in DaCe. The schedule tree is an alternative representation allowing users to focus on scheduling-related analysis and transformation. This is in contrast to SDFGs that were built for data-centric analysis and transformations. A first version of the schedule tree (`SDFG` -> `stree`) was added in https://github.com/spcl/dace/pull/2262. PR https://github.com/spcl/dace/pull/2262 will bring the "back transformation" from schedule trees to `SDFG`s.

PR https://github.com/spcl/dace/pull/2262 lived a long time away from `main` and was only recently adapted to what will be known as DaCe v2. The PR contains two memlet propagation tests, which used to work and broke while bringing the branch back to mainline. The tests are ensuring optimal memlet propagation symbol assignment and dynamic range memlets. The purpose of this issue is to keep track of those to tests. We'd like to re-enable these tests in a follow-up PR.