anchor.diff:  
      Reg#(Bool) hirschARunning <- mkReg(False);
   
  -   FSM hirschA <- mkHirschA(strA.portA, strB.portA, matL.portA);
  -   FSM hirschB <- mkHirschB(strA.portA, strB.portA, matL.portA);
  +   MCSAlgortihm hirschA <- mkHirschA(strA.portA, strB.portA, matL.portA);
  +   MCSAlgorithm hirschB <- mkHirschB(strA.portA, strB.portA, matL.portA);
      
      // create BRAM Write client for matL
   
  
positive.code: // algorithm
  import HirschA::*;
  import Hirsch::*;
  
  /* This module solves the maximum common subsequence problem.
   * It finds the longest subsequence of characters present in both input strings
  
negative.code:       indication.fetchComplete();
     endrule
  
     rule hirschA_completion (hirschARunning && hirschA.fsm.done);
        hirschARunning <= False;
        indication.searchResult(22);
        endrule
  