Segmentation fault with closed hash table

Problem with closed hashTable,segmentation fault core dumped,problem with insertion

Hash table problem Hey,i am facing a problem with a closed hashtable i am trying to implement... Everything should work correct ,but i get again and again segmentation fault... I am reading words from a file,and insert them in a HashTable object.. There is no remove() function,and i dont used at main.cpp Search() fucntion .. I think there is something wrong with the resize of the hashtable.

#include <iostream>
#include <fstream>
#include <cstring>
#include "HashTable.h"

using namespace std;

int main()
{
   string filename;
   cout<<"Enter filename: ";
   cin>>filename;
   string w;
   int i,j;
   HashTable s5;

   ifstream ifs;
   ifs.open(filename);
   if(ifs.is_open())
   {
        cout<<"File open ok"<<endl;
        while(ifs>>w)
        {
             for (i = 0;i<w.size();i++)
             {
                unsigned char c=w[i];
                if(isupper(c))
                    w[i]=tolower(c);
             }
            i=0;
            while (i<w.size())
            {
                   if (ispunct((unsigned char)w[i]))
                   {
                       w.erase(i,1);
                   }
                  else
                    {
                        i++;
                    }
            }

            s5.Insert(w,1);
    }
   }
    else
    {
        cout<<"File error"<<endl;
        return 1;
    }
    s5.print();
    ifs.close();
    bool f;
    return 1;
    
}


#ifndef HASHTABLE_H
#define HASHTABLE_H

#include <string>
#include <iostream>

using namespace std;

class word
{
    public:
        string w;
        int freq;
        word(string w,int freq)
        {
            this->w=w;
            this->freq=freq;
        }
};

class HashTable
{
    private:
        int size;
        int elements;
        word  **A;
        unsigned int hash(string);
        unsigned int hash2(unsigned int);
        word *Search(string);
    public:
        HashTable();
        ~HashTable();
        bool Insert(string,int);
        bool Search(string,int);
        void print()
        {
          for(int i=0;i<=size-1;i++)
            if(A[i]!=nullptr)
               cout<<A[i]->w<<" "<<A[i]->freq<<endl;
        }
};

#endif



#include "HashTable.h"
#include <iostream>
#include <cstring>

using namespace std;

HashTable::HashTable()
{
    size=1000;
    elements=0;
    A=new word *[size];
    for(int i=0;i<size;i++)
        A[i]=nullptr;
}

HashTable::~HashTable()
{
    delete[]A;
    A=nullptr;
    elements=0;
    size=0;
}

unsigned int HashTable::hash(string s)
{
    unsigned int h=7;
    for(int i=0;i<=s.length()-1;i++)
       h=h*31+s[i];
    return h%size;
}

unsigned int HashTable::hash2(unsigned int d)
{
    return (d+1)%size;
}

bool HashTable::Insert(string s,int d)
{
    if(Search(s)!=nullptr)
        return false;
    if(elements>=size/2)
    {
        word **temp;
        size*=2;
        temp=new word*[size];
        for(int i=0;i<size;i++)
            temp[i]=nullptr;

        for(int i=0;i<size/2;i++)
        {
            if(A[i]!=nullptr)
            {
                unsigned int p=hash(A[i]->w);
                while(temp[p]!=nullptr)
                    p=hash2(p);
                temp[p]=A[i];
                A[i]=nullptr;
            }        
        }
        delete[]A;
        A=temp;
    }
    unsigned int p=hash(s);
    while(A[p]!=nullptr)
        p=hash2(p);
    A[p]=new  word(s,d);
    elements++;
    return true;
}

word *HashTable::Search(string s)
{
    unsigned int p=hash(s);
    while((A[p]!=nullptr && A[p]->w!=s))
        p=hash2(p);
    return A[p];
}

bool HashTable::Search(string s,int d)
{
    word *p=Search(s);

    if(p==nullptr)
        return false;

    d=p->freq;

    return true;
}