crypto/bn/bn_prime.c:591: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div`.
Showing all 16 steps of the trace


crypto/bn/bn_prime.c:583:15: Call
581.   
582.       BN_CTX_start(ctx);
583.       if ((t1 = BN_CTX_get(ctx)) == NULL)
                     ^
584.           goto err;
585.   

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_prime.c:591:10: Call
589.       /* we need ((rnd-rem) % add) == 0 */
590.   
591.       if (!BN_mod(t1, rnd, add, ctx))
                ^
592.           goto err;
593.       if (!BN_sub(rnd, rnd, t1))

crypto/bn/bn_div.c:188:1: Parameter `*rm->d`
  186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  187.    */
  188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  189.              BN_CTX *ctx)
  190.   {

crypto/bn/bn_div.c:453:9: Call
  451.            */
  452.           int neg = num->neg;
  453.           BN_rshift(rm, snum, norm_shift);
                 ^
  454.           if (!BN_is_zero(rm))
  455.               rm->neg = neg;

crypto/bn/bn_shift.c:168:1: Parameter `*r->d`
    166.   }
    167.   
    168. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
    169.   {
    170.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:186:9: Call
    184.       lb = BN_BITS2 - rb;
    185.       if (nw >= a->top || a->top == 0) {
    186.           BN_zero(r);
                   ^
    187.           return (1);
    188.       }

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
      518.   }
      519.   
      520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
      521.   {
      522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
      521.   {
      522.       bn_check_top(a);
      523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                     ^
      524.           return (0);
      525.       a->neg = 0;

crypto/bn/bn_lib.c:380:1: Parameter `*b->d`
        378.    */
        379.   
        380. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        381.   {
        382.       bn_check_top(b);

crypto/bn/bn_lib.c:385:23: Call
        383.   
        384.       if (words > b->dmax) {
        385.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        386.           if (!a)
        387.               return NULL;

crypto/bn/bn_lib.c:299:1: <Length trace>
297.   /* This is used by bn_expand2() */
298.   /* The caller MUST check that words > b->dmax before calling this */
299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
300.   {
301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:299:1: Parameter `*b->d`
          297.   /* This is used by bn_expand2() */
          298.   /* The caller MUST check that words > b->dmax before calling this */
          299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          300.   {
          301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:325:5: Assignment
          323.   
          324.   #if 1
          325.       B = b->d;
                     ^
          326.       /* Check if the previous number needs to be copied */
          327.       if (B != NULL) {

crypto/bn/bn_lib.c:342:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div` 
          340.               a1 = B[1];
          341.               a2 = B[2];
          342.               a3 = B[3];
                                  ^
          343.               A[0] = a0;
          344.               A[1] = a1;
