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

Given the code below, this method call:

Cas.trul();

...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 Cas {
    private int wiAcec;
    private Nint aa;
    private Nint azes;

    Cas(int wiAcec) {
        this.wiAcec = wiAcec;
    }

    public void setAa(Nint aa) {
        this.aa = aa;
    }

    public void setAzes(Nint azes) {
        this.azes = azes;
    }

    public static void gald(Cas agh) {
        Cas ulte = new Cas(559);
    }

    public static void trul() {
        Nint.cras(new Nint(770));
        new Nint(845).loiKupan();
    }

    public void mish(Nint fase) {
    }
}

public class Nint {
    private int meass;
    private Cas otuc;
    private Nint cinu;

    Nint(int meass) {
        this.meass = meass;
    }

    public void setOtuc(Cas otuc) {
        this.otuc = otuc;
    }

    public void setCinu(Nint cinu) {
        this.cinu = cinu;
    }

    public void shior() {
        Cas sef = new Cas(776);
        Cas seno = new Cas(680);
    }

    public void mesda() {
        this.setCinu(this);
        new Nint(75).plepol(59);
        new Nint(466).allad();
    }

    public void iedd(Cas ca, int gia, Nint cluw) {
        Nint no = new Nint(342);
        this.shior();
        ca.setAzes(this);
        HERE;
    }

    public void loiKupan() {
        this.setCinu(this);
        new Nint(746).mesda();
    }

    public static void cras(Nint preu) {
        int noea = 27;
        Cas misu = new Cas(883);
        int dast = 51;
        Nint niss = new Nint(53);
        Cas.gald(new Cas(422));
    }

    public void plepol(int oc) {
        new Cas(214).mish(this);
        this.iedd(new Cas(903), oc, this);
    }

    public void allad() {
        Cas co = new Cas(121);
    }
}

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: