apps/s_client.c:253: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rshift1`.
Showing all 20 steps of the trace


apps/s_client.c:252:9: Call
250.       int ret =
251.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
252.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
253.           p != NULL && BN_rshift1(p, N) &&
254.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:281:13: Call
    279.           /* now 1 <= check < A */
    280.   
    281.           j = witness(check, A, A1, A1_odd, k, ctx, mont);
                       ^
    282.           if (j == -1)
    283.               goto err;

crypto/bn/bn_prime.c:378:10: Call
      376.                      BN_MONT_CTX *mont)
      377.   {
      378.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      379.           return -1;
      380.       if (BN_is_one(w))

crypto/bn/bn_exp.c:356:14: Call
        354.   
        355.       if (a->neg || BN_ucmp(a, m) >= 0) {
        356.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        357.               goto err;
        358.           aa = val[0];

crypto/bn/bn_mod.c:20:11: Call
          18.        */
          19.   
          20.       if (!(BN_mod(r, m, d, ctx)))
                          ^
          21.           return 0;
          22.       if (!r->neg)

crypto/bn/bn_div.c:140:1: Parameter `*dv->d`
            138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            139.    */
            140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            141.              BN_CTX *ctx)
            142.   {

apps/s_client.c:253:22: Call
251.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
252.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
253.           p != NULL && BN_rshift1(p, N) &&
                            ^
254.           /* p = (N-1)/2 */
255.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&

crypto/bn/bn_shift.c:46:1: Parameter `*r->d`
  44.   }
  45.   
  46. > int BN_rshift1(BIGNUM *r, const BIGNUM *a)
  47.   {
  48.       BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:55:9: Call
  53.   
  54.       if (BN_is_zero(a)) {
  55.           BN_zero(r);
                ^
  56.           return (1);
  57.       }

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_lcl.h:684:12: Call
      682.           return a;
      683.   
      684.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                        ^
      685.   }
      686.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
        321.    */
        322.   
        323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        324.   {
        325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
        326.   
        327.       if (words > b->dmax) {
        328.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        329.           if (!a)
        330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
          270.   
          271.   #if 1
          272.       B = b->d;
                     ^
          273.       /* Check if the previous number needs to be copied */
          274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rshift1` 
          287.               a1 = B[1];
          288.               a2 = B[2];
          289.               a3 = B[3];
                                  ^
          290.               A[0] = a0;
          291.               A[1] = a1;
