crypto/bn/bn_sqrt.c:266: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_rshift`.
Showing all 9 steps of the trace


crypto/bn/bn_sqrt.c:110:9: Call
108.   
109.       BN_CTX_start(ctx);
110.       A = BN_CTX_get(ctx);
               ^
111.       b = BN_CTX_get(ctx);
112.       q = BN_CTX_get(ctx);

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

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_sqrt.c:266:10: Call
264.   
265.       /* Here's our actual 'q': */
266.       if (!BN_rshift(q, q, e))
                ^
267.           goto end;
268.   

crypto/bn/bn_shift.c:169:1: <Length trace>
167.   }
168.   
169. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
170.   {
171.       int i, j, nw, lb, rb;

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

crypto/bn/bn_shift.c:200:5: Assignment
  198.       }
  199.   
  200.       f = &(a->d[nw]);
             ^
  201.       t = r->d;
  202.       j = a->top - nw;

crypto/bn/bn_shift.c:209:15: Assignment
  207.               *(t++) = *(f++);
  208.       } else {
  209.           l = *(f++);
                       ^
  210.           for (i = j - 1; i != 0; i--) {
  211.               tmp = (l >> rb) & BN_MASK2;

crypto/bn/bn_shift.c:212:17: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_rshift` 
  210.           for (i = j - 1; i != 0; i--) {
  211.               tmp = (l >> rb) & BN_MASK2;
  212.               l = *(f++);
                         ^
  213.               *(t++) = (tmp | (l << lb)) & BN_MASK2;
  214.           }
