+ delete rootNode;
+}
+
+void ModelChecker::reset_to_initial_state()
+{
+ DEBUG("+++ Resetting to initial state +++\n");
+ std::map<int, class Thread *, std::less< int >, MyAlloc< std::pair< int, class Thread * > > >::iterator it;
+ for (it = thread_map.begin(); it != thread_map.end(); it++)
+ delete (*it).second;
+ thread_map.clear();
+ action_trace = new action_list_t();
+ currentNode = rootNode;
+ current_action = NULL;
+ next_thread_id = INITIAL_THREAD_ID;
+ used_sequence_numbers = 0;
+ /* scheduler reset ? */
+}
+
+thread_id_t ModelChecker::get_next_id()
+{
+ return next_thread_id++;
+}
+
+int ModelChecker::get_next_seq_num()
+{
+ return ++used_sequence_numbers;
+}
+
+Thread * ModelChecker::schedule_next_thread()
+{
+ Thread *t;
+ if (nextThread == THREAD_ID_T_NONE)
+ return NULL;
+ t = thread_map[id_to_int(nextThread)];
+
+ ASSERT(t != NULL);
+
+ return t;
+}
+
+/*
+ * get_next_replay_thread() - Choose the next thread in the replay sequence
+ *
+ * If we've reached the 'diverge' point, then we pick a thread from the
+ * backtracking set.
+ * Otherwise, we simply return the next thread in the sequence.
+ */
+thread_id_t ModelChecker::get_next_replay_thread()
+{
+ ModelAction *next;
+ thread_id_t tid;
+
+ next = exploring->get_state();
+
+ if (next == exploring->get_diverge()) {
+ TreeNode *node = next->get_node();
+
+ /* Reached divergence point; discard our current 'exploring' */
+ DEBUG("*** Discard 'Backtrack' object ***\n");
+ tid = node->getNextBacktrack();
+ delete exploring;
+ exploring = NULL;
+ } else {
+ tid = next->get_tid();
+ }
+ DEBUG("*** ModelChecker chose next thread = %d ***\n", tid);
+ return tid;
+}
+
+thread_id_t ModelChecker::advance_backtracking_state()
+{
+ /* Have we completed exploring the preselected path? */
+ if (exploring == NULL)
+ return THREAD_ID_T_NONE;
+
+ /* Else, we are trying to replay an execution */
+ exploring->advance_state();
+
+ ASSERT(exploring->get_state() != NULL);
+
+ return get_next_replay_thread();