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

Given the code below, this method call:

Seall.eusCelpi();

...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 Seall {
    private int mosm;

    Seall(int mosm) {
        this.mosm = mosm;
    }

    public static void pruss(Seall dre) {
        Anen ner = new Anen(52);
        Seall raot = new Seall(233);
        Anen seun = new Anen(454);
        int schu = 86;
        seun.laong(new Seall(33), seun);
    }

    public static void eusCelpi() {
        int je = 14;
        Seall.pruss(new Seall(994));
        Anen.globa();
    }
}

public class Anen {
    private int amrin;
    private Seall spe;
    private Seall hoso;
    private Seall ird;
    private Seall sirp;

    Anen(int amrin) {
        this.amrin = amrin;
    }

    public void setSpe(Seall spe) {
        this.spe = spe;
    }

    public void setHoso(Seall hoso) {
        this.hoso = hoso;
    }

    public void setIrd(Seall ird) {
        this.ird = ird;
    }

    public void setSirp(Seall sirp) {
        this.sirp = sirp;
    }

    public void eost(int ec) {
        int iang = 6;
        HERE;
    }

    public void laong(Seall esm, Anen roet) {
        int ar = 26;
        Seall saos = new Seall(231);
    }

    public void ipuDiant(Seall ai) {
        int samu = 35;
    }

    public static void globa() {
        Anen ebra = new Anen(896);
        Seall ra = new Seall(934);
        Anen kio = new Anen(543);
        Anen en = new Anen(848);
        en.setHoso(ra);
        Anen.zedei();
        kio.nonre();
    }

    public void sepra(int ci) {
        this.eost(ci);
        Anen.ostrin();
    }

    public static void zedei() {
        Seall trul = new Seall(77);
        int nisa = 53;
        int nud = 82;
        Anen mesi = new Anen(952);
        int laes = 21;
        mesi.setIrd(trul);
        mesi.sepra(nud);
        mesi.ipuDiant(trul);
    }

    public static void ostrin() {
        int dres = 55;
    }

    public void nonre() {
        int tion = 18;
        int woro = 55;
        int co = 76;
    }
}

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: