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

Given the code below, this method call:

Ovin.teswor();

...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 Ovin {
    private int ceOndan;
    private Thril unmi;
    private Ovin pral;

    Ovin(int ceOndan) {
        this.ceOndan = ceOndan;
    }

    public void setUnmi(Thril unmi) {
        this.unmi = unmi;
    }

    public void setPral(Ovin pral) {
        this.pral = pral;
    }

    public static void whel(int jod) {
        int fia = 8;
        int ia = 45;
    }

    public static void teswor() {
        int olic = 50;
        new Ovin(111).dioss();
        Ovin.pelIek();
    }

    public static void clohoa(Thril irua) {
        int iz = 87;
        int stul = 4;
        Thril al = new Thril(192);
        Thril.abrad(iz, stul);
        al.setUn(al);
        irua.bire(1);
    }

    public static void pelIek() {
        int hu = 58;
        int bia = 98;
        int ra = 74;
        int lo = 77;
        int ior = 20;
        Ovin.whel(ior);
    }

    public void dioss() {
        Ovin qic = new Ovin(174);
        Thril noi = new Thril(517);
        qic.setPral(this);
        new Thril(998).pheCunfi(this);
    }
}

public class Thril {
    private int erEn;
    private Ovin ni;
    private Thril un;

    Thril(int erEn) {
        this.erEn = erEn;
    }

    public void setNi(Ovin ni) {
        this.ni = ni;
    }

    public void setUn(Thril un) {
        this.un = un;
    }

    public static void dintun(Ovin ad, int ri, int qad) {
        int irn = 17;
    }

    public void bire(int di) {
        int peo = 71;
        int pi = 74;
        int zuc = 31;
        this.nont(zuc, this, pi);
        HERE;
    }

    public void nont(int ve, Thril ta, int be) {
    }

    public void pheCunfi(Ovin henx) {
        int sinu = 96;
        int el = 29;
        Thril weo = new Thril(748);
        henx.setUnmi(this);
        Ovin.clohoa(this);
        Thril.dintun(henx, sinu, el);
    }

    public static void abrad(int bi, int ang) {
        int cu = 39;
        int ed = 18;
    }
}

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: