crypto/bn/bn_exp.c:780: error: INTEGER_OVERFLOW_L2
  (0 - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:780:8: Call
778.   	else
779.   #endif
780.    	if (!BN_to_montgomery(&tmp,BN_value_one(),mont,ctx))	goto err;
              ^
781.   
782.   	/* prepare a^1 in Montgomery domain */

crypto/bn/bn_lib.c:138:2: Assignment
  136.   const BIGNUM *BN_value_one(void)
  137.   	{
  138.   	static const BN_ULONG data_one=1L;
          ^
  139.   	static const BIGNUM const_one={(BN_ULONG *)&data_one,1,1,0,BN_FLG_STATIC_DATA};
  140.   

crypto/bn/bn_exp.c:780:8: Call
778.   	else
779.   #endif
780.    	if (!BN_to_montgomery(&tmp,BN_value_one(),mont,ctx))	goto err;
              ^
781.   
782.   	/* prepare a^1 in Montgomery domain */

crypto/bn/bn_mont.c:130:1: Parameter `*a->d`
  128.   #endif
  129.   
  130. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  131.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
  132.   	{

crypto/bn/bn_mont.c:162:8: Call
  160.   	else
  161.   		{
  162.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                ^
  163.   		}
  164.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:898:1: Parameter `*a->d`
    896.   #endif /* BN_RECURSION */
    897.   
    898. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    899.   	{
    900.   	int ret=0;

crypto/bn/bn_mul.c:983:5: Call
    981.   				if (bn_wexpand(t,k*4) == NULL) goto err;
    982.   				if (bn_wexpand(rr,k*4) == NULL) goto err;
    983.   				bn_mul_part_recursive(rr->d,a->d,b->d,
               ^
    984.   					j,al-j,bl-j,t->d);
    985.   				}

crypto/bn/bn_mul.c:516:1: Parameter `*a`
      514.    * t needs to be n*4 is size, as does r */
      515.   /* tnX may not be negative but less than n */
      516. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      517.   	     int tna, int tnb, BN_ULONG *t)
      518.   	{

crypto/bn/bn_mul.c:530:5: Call
      528.   
      529.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      530.   	c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
                 ^
      531.   	c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
      532.   	neg=0;

crypto/bn/bn_lib.c:815:1: Parameter `*b`
        813.      All lengths are the number of BN_ULONGs...  */
        814.   
        815. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
        816.   	int cl, int dl)
        817.   	{

crypto/bn/bn_mul.c:536:3: Call
      534.   		{
      535.   	case -4:
      536.   		bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
               ^
      537.   		bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
      538.   		break;

crypto/bn/bn_mul.c:79:1: <RHS trace>
77.      assembler counterparts for the systems that use assembler files.  */
78.   
79. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
80.   	const BN_ULONG *a, const BN_ULONG *b,
81.   	int cl, int dl)

crypto/bn/bn_mul.c:79:1: Parameter `*b`
        77.      assembler counterparts for the systems that use assembler files.  */
        78.   
        79. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
        80.   	const BN_ULONG *a, const BN_ULONG *b,
        81.   	int cl, int dl)

crypto/bn/bn_mul.c:99:4: Assignment
        97.   		for (;;)
        98.   			{
        99.   			t = b[0];
                  ^
        100.   			r[0] = (0-t-c)&BN_MASK2;
        101.   			if (t != 0) c=1;

crypto/bn/bn_mul.c:100:4: Binary operation: (0 - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery` 
        98.   			{
        99.   			t = b[0];
        100.   			r[0] = (0-t-c)&BN_MASK2;
                  ^
        101.   			if (t != 0) c=1;
        102.   			if (++dl >= 0) break;
