MOVer: The MPI-Optimized Verifier (version 0.1 of 05-Jul-2004)
Beginning search.
Max memory (bytes):        1977024512

    nStored |   nMatched |     nTrans |      depth |       time |     totMem
          0 |          0 |          0 |          1 |        0.0 |    2031616
Deadlock found! Trace:
   [0,0,0;(),(),()]
1. SendStep[1,0,c!1]
   [0,1,0;(1),(),()]
2. SendStep[1,1,c!1]
   [0,2,0;(1 1),(),()]
3. SendStep[1,2,c!1]
   [0,3,0;(1 1 1),(),()]
4. SendStep[1,3,c!1]
   [0,4,0;(1 1 1 1),(),()]
5. SendStep[1,4,c!1]
   [0,5,0;(1 1 1 1 1),(),()]
6. SendStep[1,5,c!1]
   [0,6,0;(1 1 1 1 1 1),(),()]
7. SendStep[1,6,c!1]
   [0,7,0;(1 1 1 1 1 1 1),(),()]
8. SendStep[1,7,c!1]
   [0,8,0;(1 1 1 1 1 1 1 1),(),()]
9. SendStep[1,8,c!1]
   [0,9,0;(1 1 1 1 1 1 1 1 1),(),()]
10. SendStep[1,9,c!1]
   [0,10,0;(1 1 1 1 1 1 1 1 1 1),(),()]
11. SendStep[1,10,c!1]
   [0,11,0;(1 1 1 1 1 1 1 1 1 1 1),(),()]
12. SendStep[1,11,c!1]
   [0,12,0;(1 1 1 1 1 1 1 1 1 1 1 1),(),()]
13. SendStep[1,12,c!1]
   [0,13,0;(1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
14. SendStep[1,13,c!1]
   [0,14,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
15. SendStep[1,14,c!1]
   [0,15,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
16. SendStep[1,15,c!1]
   [0,16,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
17. SendStep[1,16,c!1]
   [0,17,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
18. SendStep[1,17,c!1]
   [0,18,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
19. SendStep[1,18,c!1]
   [0,19,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
20. SendStep[1,19,c!1]
   [0,20,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
21. SendStep[1,20,c!1]
   [0,21,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
22. SendStep[1,21,c!1]
   [0,22,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
23. SendStep[1,22,c!1]
   [0,23,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
24. SendStep[1,23,c!1]
   [0,24,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
25. SendStep[1,24,c!1]
   [0,25,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
26. SendStep[1,25,c!1]
   [0,26,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
27. SendStep[1,26,c!1]
   [0,27,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
28. SendStep[1,27,c!1]
   [0,28,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
29. SendStep[1,28,c!1]
   [0,29,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
30. SendStep[1,29,c!1]
   [0,30,0;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
31. SynchStep[1,30,e!1;2,0,e?1]
   [0,31,1;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]
32. SynchStep[2,1,d!1;0,31,d?1]
   [31,31,2;(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1),(),()]


Number of counter examples found: 1

Number of processes:      3
Bytes per process:        [1,1,1]
Bytes for all procs:      3
Number of channels:       3
Bytes per message:        [1,1,1]

No unreached local states.
Num local state arrays:   500
Num buffers:              31
Buffers:
  ()
  (0)
  (0,0)
  (0,0,0)
  (0,0,0,0)
  (0,0,0,0,0)
  (0,0,0,0,0,0)
  (0,0,0,0,0,0,0)
  (0,0,0,0,0,0,0,0)
  (0,0,0,0,0,0,0,0,0)
  (0,0,0,0,0,0,0,0,0,0)
  etc.

Num buffer arrays:        31
Lengths reached:          [30,0,0]

Buffer arrays:
  [(),(),()]
  [(0),(),()]
  [(0,0),(),()]
  [(0,0,0),(),()]
  [(0,0,0,0),(),()]
  [(0,0,0,0,0),(),()]
  [(0,0,0,0,0,0),(),()]
  [(0,0,0,0,0,0,0),(),()]
  [(0,0,0,0,0,0,0,0),(),()]
  [(0,0,0,0,0,0,0,0,0),(),()]
  [(0,0,0,0,0,0,0,0,0,0),(),()]
  etc.

Number of states stored:          500
Number of new states:             500
Number of states matched:          29
Search depth reached:              62
Number of transitions:            528
Search time (seconds):          0.099
Max memory (bytes):        1977024512
Before gc...
  Total memory:               2031616
  Free memory :               1456720
  Used memory :                574896
After gc...
  Total memory:               2031616
  Free memory :               1595192
  Used memory :                436424
