crypto/bn/bn_sqrt.c:98: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 23 steps of the trace


crypto/bn/bn_sqrt.c:60:9: Call
58.   
59.       BN_CTX_start(ctx);
60.       A = BN_CTX_get(ctx);
              ^
61.       b = BN_CTX_get(ctx);
62.       q = 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:463:1: Parameter `*a->d`
    461.   }
    462.   
    463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    464.   {
    465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
    464.   {
    465.       bn_check_top(a);
    466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    467.           return (0);
    468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
      674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      675.   
      676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      677.   {
      678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_sqrt.c:98:14: Call
96.           if (!BN_add_word(q, 1))
97.               goto end;
98.           if (!BN_mod_exp(ret, A, q, p, ctx))
                    ^
99.               goto end;
100.           err = 0;

crypto/bn/bn_exp.c:90:1: Parameter `*a->d`
  88.   }
  89.   
  90. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  91.                  BN_CTX *ctx)
  92.   {

crypto/bn/bn_exp.c:150:19: Call
  148.           } else
  149.   # endif
  150.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  151.       } else
  152.   #endif

crypto/bn/bn_exp.c:300:1: Parameter `*a->d`
    298.   }
    299.   
    300. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    301.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    302.   {

crypto/bn/bn_exp.c:312:16: Call
    310.   
    311.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
    312.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    313.       }
    314.   

crypto/bn/bn_exp.c:592:1: Parameter `*a->d`
      590.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      591.    */
      592. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      593.                                 const BIGNUM *m, BN_CTX *ctx,
      594.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:749:17: Call
      747.           if (!BN_to_montgomery(&am, &am, mont, ctx))
      748.               goto err;
      749.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                             ^
      750.           goto err;
      751.   

crypto/bn/bn_lib.c:943:1: Parameter `*a->d`
        941.   }
        942.   
        943. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        944.                        BN_CTX *ctx)
        945.   {

crypto/bn/bn_lib.c:946:12: Call
        944.                        BN_CTX *ctx)
        945.   {
        946.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                          ^
        947.   }
        948.   

crypto/bn/bn_mont.c:26:1: Parameter `*a->d`
          24.   #endif
          25.   
          26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
          27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
          28.   {

crypto/bn/bn_mont.c:56:14: Call
          54.               goto err;
          55.       } else {
          56.           if (!BN_mul(tmp, a, b, ctx))
                             ^
          57.               goto err;
          58.       }

crypto/bn/bn_mul.c:829:1: Parameter `*a->d`
            827.   #endif                          /* BN_RECURSION */
            828.   
            829. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
            830.   {
            831.       int ret = 0;

crypto/bn/bn_mul.c:910:17: Call
            908.                   if (bn_wexpand(rr, k * 4) == NULL)
            909.                       goto err;
            910.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                                   ^
            911.                                         j, al - j, bl - j, t->d);
            912.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:480:1: Parameter `*a`
              478.    */
              479.   /* tnX may not be negative but less than n */
              480. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
              481.                              int tna, int tnb, BN_ULONG *t)
              482.   {

crypto/bn/bn_mul.c:488:9: Call
              486.   
              487.       if (n < 8) {
              488.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                             ^
              489.           return;
              490.       }

crypto/bn/bn_mul.c:983:1: <Length trace>
981.   }
982.   
983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
984.   {
985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:983:1: Parameter `*b`
                981.   }
                982.   
                983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
                984.   {
                985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1018:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp` 
                1016.           if (--nb <= 0)
                1017.               return;
                1018.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                         ^
                1019.           rr += 4;
                1020.           r += 4;
