crypto/ec/ecp_oct.c:78: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 22 steps of the trace


crypto/ec/ecp_oct.c:37:12: Call
35.   
36.       BN_CTX_start(ctx);
37.       tmp1 = BN_CTX_get(ctx);
                 ^
38.       tmp2 = BN_CTX_get(ctx);
39.       x = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/ec/ecp_oct.c:78:18: Call
76.               if (!group->meth->field_decode(group, tmp2, group->a, ctx))
77.                   goto err;
78.               if (!BN_mod_mul(tmp2, tmp2, x, group->field, ctx))
                       ^
79.                   goto err;
80.           } else {

crypto/bn/bn_mod.c:193:1: Parameter `*b->d`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:210:14: Call
  208.               goto err;
  209.       } else {
  210.           if (!BN_mul(t, a, b, ctx))
                      ^
  211.               goto err;
  212.       }

crypto/bn/bn_mul.c:497:1: Parameter `*b->d`
    495.   #endif                          /* BN_RECURSION */
    496.   
    497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
    497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                         ^
    500.   
    501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `*b->d`
      505.   }
      506.   
      507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      508.   {
      509.       int ret = 0;

crypto/bn/bn_mul.c:587:17: Call
      585.                   if (bn_wexpand(rr, k * 4) == NULL)
      586.                       goto err;
      587.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                             ^
      588.                                         j, al - j, bl - j, t->d);
      589.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
        320.    */
        321.   /* tnX may not be negative but less than n */
        322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
        323.                              int tna, int tnb, BN_ULONG *t)
        324.   {

crypto/bn/bn_mul.c:336:10: Call
        334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
        335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
        336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                        ^
        337.       neg = 0;
        338.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:706:1: Parameter `cl`
          704.    */
          705.   
          706. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
          707.   {
          708.       int n, i;

crypto/bn/bn_lib.c:723:12: Call
          721.           }
          722.       }
          723.       return bn_cmp_words(a, b, cl);
                            ^
          724.   }
          725.   

crypto/bn/bn_lib.c:679:1: <Offset trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `n`
            677.   }
            678.   
            679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
            680.   {
            681.       int i;

crypto/bn/bn_lib.c:688:10: Assignment
            686.       if (aa != bb)
            687.           return ((aa > bb) ? 1 : -1);
            688.       for (i = n - 2; i >= 0; i--) {
                            ^
            689.           aa = a[i];
            690.           bb = b[i];

crypto/bn/bn_lib.c:679:1: <Length trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `*a`
            677.   }
            678.   
            679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
            680.   {
            681.       int i;

crypto/bn/bn_lib.c:689:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_mul` 
            687.           return ((aa > bb) ? 1 : -1);
            688.       for (i = n - 2; i >= 0; i--) {
            689.           aa = a[i];
                                ^
            690.           bb = b[i];
            691.           if (aa != bb)
