Stack frames and objects (like the Idea Lab activity): Correct Solution

Given the code below, this method call:

Labo.ermHounod();

...will eventually reach the point marked HERE. Draw a diagram of the stack and the heap at that point.

(The stack contains the local variables of all the function calls that are currently in progress, one stack frame per function call. The heap contains all of the objects that currently exist.)

In your diagram:

Label each stack frame with the name of the method.
Label each object with the name of its class.
Include the names of all the variables that belong to each object and stack frame, including the implicit this parameter if present. (You do not need to write the types of any variables.)
When a variable's value is null or a primitive, write the value immediately next to the variable.
When a variable points to an object, draw an arrow from the variable to the object it points to.

The code:

public class Labo {
    private int dord;
    private Bipre ta;
    private Labo nu;

    Labo(int dord) {
        this.dord = dord;
    }

    public void setTa(Bipre ta) {
        this.ta = ta;
    }

    public void setNu(Labo nu) {
        this.nu = nu;
    }

    public static void praEril(Bipre cla, int usm, Bipre be) {
    }

    public static void ermHounod() {
        int ost = 43;
        Bipre wios = new Bipre(400);
        Bipre.nerOsed();
        wios.setLo(wios);
        new Bipre(663).rulLodol(new Bipre(959), ost);
    }
}

public class Bipre {
    private int raParae;
    private Bipre lo;

    Bipre(int raParae) {
        this.raParae = raParae;
    }

    public void setLo(Bipre lo) {
        this.lo = lo;
    }

    public static void nerOsed() {
    }

    public static void weinci() {
        int ec = 85;
        int ti = 23;
        Bipre er = new Bipre(619);
        Bipre cec = new Bipre(1);
        Bipre.omeIkpea(er);
        er.lornod(ec, ti, er);
    }

    public static void omeIkpea(Bipre ju) {
    }

    public void rulLodol(Bipre da, int jic) {
        da.setLo(this);
        Bipre.weinci();
    }

    public void lornod(int us, int ick, Bipre pruc) {
        Labo.praEril(this, us, pruc);
        HERE;
    }
}

Solution

Hints for practicing this puzzle:

Practice with difficulty 0, then work your way up. This will help you get a handle on what the puzzle is asking.
There is only one path through the code from the starting method call to HERE. Start by finding that path.
Be thorough. Double check that you've fully diagrammed each step before you move on to the next one.
You can feed this code into https://pythontutor.com and watch a diagram like this build up step by step. (Yes, despite the web site's name, it also works with Java.)

Related puzzles: