1/8/2017:

1. A major Bug sorted out
2. A bad segmentation fault is happening have to find the issue
3. and other things

nbproject/private/configurations.xml

@@ -20,6 +20,8 @@
       </df>
       <df name="obj">
       </df>
+      <df name="output">
+      </df>
       <df name="src">
         <in>continuoustpda.cpp</in>
         <in>drawsystem.cpp</in>
@@ -77,8 +79,10 @@
           <runcommandpicklistitem>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/tp38</runcommandpicklistitem>
           <runcommandpicklistitem>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/tp1</runcommandpicklistitem>
           <runcommandpicklistitem>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/pd1</runcommandpicklistitem>
+          <runcommandpicklistitem>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/tp2_</runcommandpicklistitem>
+          <runcommandpicklistitem>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/tp2_0</runcommandpicklistitem>
         </runcommandpicklist>
-        <runcommand>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/pd1</runcommand>
+        <runcommand>"${OUTPUT_PATH}" /home/sparsa/Programming/mtp/input/tp2_0</runcommand>
         <rundir>.</rundir>
         <buildfirst>false</buildfirst>
         <terminal-type>0</terminal-type>

output/pd1.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	2	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+5
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	3	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+6
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	3	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 0
+#states : 8
+#transitions : 7
+Maximum constant(M) : 2
+Tree-Width(K) : 2
+
+---END OF EXECUTION---
+
+Execution time : 0.000294 seconds.
+

output/rep1.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	2,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	1	3	4	
+	Weight Matrix : 
+	
+			0,0	16383,0	16383,0	16384,0	
+			0,0	0,0	2,0	3,0	
+			0,0	0,0	0,0	1,0	
+			-1,0	-1,0	-1,0	0,0	
+
+
+	Push done at L : 0

output/rep2.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	9	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 2
+#states : 4
+#transitions : 11
+Maximum constant(M) : 3
+Tree-Width(K) : 8
+
+---END OF EXECUTION---
+
+Execution time : 0.000161 seconds.
+

output/sample.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 2
+#states : 4
+#transitions : 4
+Maximum constant(M) : 4
+Tree-Width(K) : 8
+
+---END OF EXECUTION---
+
+Execution time : 0.000123 seconds.
+

output/t1.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-5,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-2,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	4	3	
+	Weight Matrix : 
+	
+			0,0	4,0	4,0	
+			-2,0	0,0	2,0	
+			-2,0	0,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	4	5	
+	Weight Matrix : 
+	
+			0,0	4,0	16384,0	
+			-2,0	0,0	16382,0	
+			-7,0	-5,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 0
+#clocks : 2
+#states : 6
+#transitions : 5
+Maximum constant(M) : 6
+Tree-Width(K) : 3
+
+---END OF EXECUTION---
+
+Execution time : 0.000183 seconds.
+

output/t10.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-4,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	4	
+	Weight Matrix : 
+	
+			0,0	1,0	16384,0	
+			-1,0	0,0	16383,0	
+			-1,0	0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 0
+#clocks : 3
+#states : 6
+#transitions : 8
+Maximum constant(M) : 7
+Tree-Width(K) : 4
+
+---END OF EXECUTION---
+
+Execution time : 0.000167 seconds.
+

output/t11.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-5,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	3	
+	Weight Matrix : 
+	
+			0,0	16382,0	16384,0	
+			-5,0	0,0	2,0	
+			-7,0	-2,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			-3,0	0,0	2,0	
+			-3,0	0,0	0,0	
+
+
+	Push done at L : 0
+5
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	4	5	
+	Weight Matrix : 
+	
+			0,0	3,0	3,0	3,0	
+			-3,0	0,0	0,0	0,0	
+			-3,0	0,0	0,0	0,0	
+			-3,0	0,0	0,0	0,0	
+
+
+	Push done at L : 0
+6
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	6	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			-3,0	0,0	3,0	
+			-3,0	0,0	0,0	
+
+
+	Push done at L : 0
+7
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	6	8	
+	Weight Matrix : 
+	
+			0,0	16383,0	16383,0	16384,0	
+			-3,0	0,0	3,0	4,0	
+			-3,0	0,0	0,0	1,0	
+			-4,0	-1,0	-1,0	0,0	
+
+
+	Push done at L : 0
+8
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4----5
+		L : 1
+	Transitions:	0	2	6	8	4	
+	Weight Matrix : 
+	
+			0,0	16383,0	16383,0	16384,0	16384,0	
+			-3,0	0,0	1,0	2,0	2,0	
+			-3,0	0,0	0,0	1,0	2,0	
+			-4,0	-1,0	-1,0	0,0	1,0	
+			-4,0	-1,0	-1,0	0,0	0,0	
+
+
+	Push done at L : 0
+9
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4----5
+		L : 1
+	Transitions:	0	2	8	4	5	
+	Weight Matrix : 
+	
+			0,0	16381,0	16382,0	16383,0	16384,0	
+			-3,0	0,0	2,0	2,0	4,0	
+			-4,0	-1,0	0,0	1,0	2,0	
+			-4,0	-1,0	0,0	0,0	2,0	
+			-6,0	-3,0	-2,0	-1,0	0,0	
+
+
+	Push done at L : 0
+10
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	8	6	
+	Weight Matrix : 
+	
+			0,0	16383,0	16384,0	16384,0	
+			-3,0	0,0	2,0	3,0	
+			-4,0	-1,0	0,0	2,0	
+			-4,0	-1,0	0,0	0,0	
+
+
+	Push done at L : 0
+11
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	6	8	
+	Weight Matrix : 
+	
+			0,0	16382,0	16383,0	16384,0	
+			-3,0	0,0	3,0	4,0	
+			-4,0	-1,0	0,0	1,0	
+			-5,0	-2,0	-1,0	0,0	
+
+
+	Push done at L : 0
+12
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4----5
+		L : 1
+	Transitions:	0	2	6	8	4	
+	Weight Matrix : 
+	
+			0,0	16382,0	16383,0	16384,0	16384,0	
+			-3,0	0,0	1,0	2,0	2,0	
+			-4,0	-1,0	0,0	1,0	1,0	
+			-5,0	-2,0	-1,0	0,0	0,0	
+			-5,0	-2,0	-1,0	0,0	0,0	
+
+
+	Push done at L : 0
+13
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4----5
+		L : 1
+	Transitions:	0	2	8	4	5	
+	Weight Matrix : 
+	
+			0,0	16380,0	16382,0	16382,0	16384,0	
+			-3,0	0,0	2,0	2,0	4,0	
+			-5,0	-2,0	0,0	0,0	2,0	
+			-5,0	-2,0	0,0	0,0	2,0	
+			-7,0	-4,0	-2,0	-2,0	0,0	
+
+
+	Push done at L : 0
+14
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	8	6	
+	Weight Matrix : 
+	
+			0,0	16382,0	16384,0	16384,0	
+			-3,0	0,0	2,0	3,0	
+			-5,0	-2,0	0,0	1,0	
+			-5,0	-2,0	0,0	0,0	
+
+
+	Push done at L : 0
+15
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	6	8	
+	Weight Matrix : 
+	
+			0,0	16381,0	16383,0	16384,0	
+			-3,0	0,0	3,0	4,0	
+			-5,0	-2,0	0,0	1,0	
+			-6,0	-3,0	-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 0
+#clocks : 4
+#states : 7
+#transitions : 8
+Maximum constant(M) : 6
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000492 seconds.
+

output/t13.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	2,0	
+			-2,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	4	
+	Weight Matrix : 
+	
+			0,0	16383,0	16384,0	
+			-3,0	0,0	3,0	
+			-4,0	-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 0
+#clocks : 3
+#states : 6
+#transitions : 7
+Maximum constant(M) : 4
+Tree-Width(K) : 4
+
+---END OF EXECUTION---
+
+Execution time : 0.000155 seconds.
+

output/t8.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	2	
+	Weight Matrix : 
+	
+			0,0	16383,0	16384,0	
+			0,0	0,0	1,0	
+			-1,0	-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 0
+#clocks : 2
+#states : 4
+#transitions : 6
+Maximum constant(M) : 3
+Tree-Width(K) : 3
+
+---END OF EXECUTION---
+
+Execution time : 0.000135 seconds.
+

output/tp2_0.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	2	3	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	16384,0	
+			0,0	0,0	16384,0	16384,0	
+			0,0	0,0	0,0	16384,0	
+			0,0	0,0	0,0	0,0	
+
+
+	Push done at L : 0

output/tp38.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	4	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	4	1	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	4	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 4
+#transitions : 4
+Maximum constant(M) : 2
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000208 seconds.
+

output/tp3_0.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3----4
+		L : 1
+	Transitions:	0	1	2	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	16384,0	
+			0,0	0,0	16384,0	16384,0	
+			0,0	0,0	0,0	16384,0	
+			0,0	0,0	0,0	0,0	
+
+
+	Push done at L : 0

output/tp6.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	4	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 2
+#states : 6
+#transitions : 8
+Maximum constant(M) : 4
+Tree-Width(K) : 8
+
+---END OF EXECUTION---
+
+Execution time : 0.000146 seconds.
+

output/tp60.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 6
+Maximum constant(M) : 3
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000123 seconds.
+

output/tp62.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	1	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	4	
+	Weight Matrix : 
+	
+			0,0	100,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	6	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 6
+Maximum constant(M) : 101
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000189 seconds.
+

output/tp63.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	2,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 8
+Maximum constant(M) : 9
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000119 seconds.
+

output/tp64.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 4
+Maximum constant(M) : 3
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000121 seconds.
+

output/tp67.txt

+Initial state is same as final state 
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 14
+#transitions : 26
+Maximum constant(M) : 16
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 7.8e-05 seconds.
+

output/tpd1.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	2	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 8
+#transitions : 7
+Maximum constant(M) : 2
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000149 seconds.
+

output/tpg0.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	11,0	
+			-3,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	2	
+	Weight Matrix : 
+	
+			0,0	24,0	
+			-5,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	2	3	
+	Weight Matrix : 
+	
+			0,0	24,0	39,0	
+			-5,0	0,0	15,0	
+			-6,0	-1,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	3	
+	Weight Matrix : 
+	
+			0,0	39,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 2
+#states : 8
+#transitions : 6
+Maximum constant(M) : 16
+Tree-Width(K) : 8
+
+---END OF EXECUTION---
+
+Execution time : 0.000165 seconds.
+

output/tpg1.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	1	2	
+	Weight Matrix : 
+	
+			0,0	0,0	0,0	
+			0,0	0,0	0,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	2	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 2
+#states : 12
+#transitions : 11
+Maximum constant(M) : 1
+Tree-Width(K) : 8
+
+---END OF EXECUTION---
+
+Execution time : 0.000148 seconds.
+

output/tpg11.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 8
+#transitions : 8
+Maximum constant(M) : 3
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000113 seconds.
+

output/tpg2.txt

+Initial state is same as final state 
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 6
+#transitions : 6
+Maximum constant(M) : 6
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 6.3e-05 seconds.
+

output/tps10.txt

+Initial state is same as final state 
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 4
+#transitions : 5
+Maximum constant(M) : 11
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000102 seconds.
+

output/tps11.txt

+Initial state is same as final state 
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 6
+Maximum constant(M) : 11
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 8.9e-05 seconds.
+

output/tps2.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	1	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	2	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	3	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+5
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	2	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+6
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	4	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+7
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	5	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+8
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	6	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+9
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	2	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+10
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	3	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+11
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	4	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+12
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	5	
+	Weight Matrix : 
+	
+			0,0	1,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+13
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	6	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 4
+#transitions : 6
+Maximum constant(M) : 3
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000489 seconds.
+

output.txt → output/tps4.txt

-Processing ./input/pd1 File.. 
 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
 1
-2
-3
 
 Abstract state of the on the fly tree automata(TA):
 	Points in the automaton:
 		1----2
 		L : 1
-	Transitions:	0	7	
-	Accuracy: 	    0	    
-	TSM : 		0	1	
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
 
 
 	Push done at L : 0
-	Pop done at R : 1
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	5	
+	Weight Matrix : 
 	
-A run of the automation as a witness for the language to be non-empty.
-The run given as a sequence of pairs (Transition, Time stamp) : 
-(0, 0.0), (1, 0.0), (2, 0.0), (3, 1.0), (4, 2.0), (5, 2.0), (6, 2.0), (7, 3.0), 
+			0,0	16384,0	
+			0,0	0,0	
 
-Wrong
-Processing ./input/rep1 File.. 
-0
-1
-2
+
+	Push done at L : 0
 3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	1	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
 4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2----3
+		L : 1
+	Transitions:	0	5	6	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	1,0	
+			0,0	0,0	0,0	
+
+
+	Push done at L : 0
 5
-6
-7
-8
-Correct!
-Processing ./input/rep2 File.. 
-0
 
 Abstract state of the on the fly tree automata(TA):
 	Points in the automaton:
 		1----2
 		L : 1
-	Transitions:	0	9	
+	Transitions:	1	2	
 	Weight Matrix : 
 	
 			0,0	1,0	
@@ -47,105 +81,73 @@ Abstract state of the on the fly tree automata(TA):
 
 
 	Push done at L : 0
+6
 
 Abstract state of the on the fly tree automata(TA):
 	Points in the automaton:
-		1----2
+		1----2----3
 		L : 1
-	Transitions:	0	9	
-	Accuracy: 	    1	    
-	TSM : 		0	1	
+	Transitions:	0	5	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
 
 
 	Push done at L : 0
-	Pop done at R : 0
+7
 
-A run of the automation as a witness for the language to be non-empty.
-The run given as a sequence of pairs (Transition, Time stamp) : 
-(0, 0.0), (9, 1.0), 
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	2	
+	Weight Matrix : 
 	
-Correct!
-Processing ./input/sample File.. 
-0
+			0,0	
+
+
+	Push done at L : 0
+8
 
 Abstract state of the on the fly tree automata(TA):
 	Points in the automaton:
-		1----2
+		1----2----3
 		L : 1
-	Transitions:	0	2	
+	Transitions:	0	5	4	
 	Weight Matrix : 
 	
-			0,0	16384,0	
-			0,0	0,0	
+			0,0	16384,0	16384,0	
+			0,0	0,0	16384,0	
+			0,0	0,0	0,0	
 
 
 	Push done at L : 0
+9
 
 Abstract state of the on the fly tree automata(TA):
 	Points in the automaton:
-		1----2----3
+		1----2
 		L : 1
-	Transitions:	0	4	2	
-	Accuracy: 	    0	    1	    
-	TSM : 		0	0	0	
+	Transitions:	2	3	
+	Weight Matrix : 
+	
+			0,0	16384,0	
+			0,0	0,0	
 
 
 	Push done at L : 0
-	Pop done at R : 1
+The language recognized by the TPDA is EMPTY!
 
-A run of the automation as a witness for the language to be non-empty.
-The run given as a sequence of pairs (Transition, Time stamp) : 
-(0, 0.0), (1, 2.0), (3, 2.0), (4, 4.0), (2, 4.0), 
+#stacks : 1
+#clocks : 1
+#states : 6
+#transitions : 6
+Maximum constant(M) : 2
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000396 seconds.
 
-Correct!
-Processing ./input/t1 File.. 
-0
-1
-2
-3
-4
-Correct!
-Processing ./input/t10 File.. 
-0
-1
-2
-3
-Correct!
-Processing ./input/t11 File.. 
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-Correct!
-Processing ./input/t13 File.. 
-0
-1
-2
-3
-Correct!
-Processing ./input/t8 File.. 
-0
-1
-2
-Correct!
-Processing ./input/tp2_0 File.. 
-0
-1
-2
-3
-4
-5
-Correct!
-Processing ./input/tp3_0 File.. 

output/tps5.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	8	
+	Weight Matrix : 
+	
+			0,0	0,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is NOT EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 8
+Maximum constant(M) : 7
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000148 seconds.
+

output/tps9.txt

+0
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	0	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+1
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	0	1	
+	Weight Matrix : 
+	
+			0,0	2,0	
+			0,0	0,0	
+
+
+	Push done at L : 0
+2
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	1	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+3
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	1	2	
+	Weight Matrix : 
+	
+			0,0	2,0	
+			-1,0	0,0	
+
+
+	Push done at L : 0
+4
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1
+		L : 1
+	Transitions:	2	
+	Weight Matrix : 
+	
+			0,0	
+
+
+	Push done at L : 0
+5
+
+Abstract state of the on the fly tree automata(TA):
+	Points in the automaton:
+		1----2
+		L : 1
+	Transitions:	2	3	
+	Weight Matrix : 
+	
+			0,0	2,0	
+			-2,0	0,0	
+
+
+	Push done at L : 0
+The language recognized by the TPDA is EMPTY!
+
+#stacks : 1
+#clocks : 1
+#states : 5
+#transitions : 4
+Maximum constant(M) : 3
+Tree-Width(K) : 5
+
+---END OF EXECUTION---
+
+Execution time : 0.000254 seconds.
+

run.sh

 #!/bin/bash
-FILES=./input/*
-for f in $FILES
+FILES=./input/
+for f in `ls $FILES`
 do
     echo "Processing $f File.. "
-    ./tree $f
+    ./tree $FILES$f > ./output/$f.txt
 done

src/tpdaZone.cpp

@@ -1105,20 +1105,21 @@ stateZone* stateZone::sucState(){
     
     short curReset, reset; // temp vars for keeping reset bit vector
     char count; // will contain #points in the new state
-    char i,j; // counters
-    
+    //char i,j; // counters
+    vector<char> targetToSuc;
     // iterate through all points right to left except the last point 
     curReset = transitions[ del[P-1] ].reset;
     count = 1; //we have to take the last point, so initialize 'count' to 1
     
-    for(i=P-2; i >= 0; i--) {
+    for(char i=0; i <= P-2; i++) {
         reset = transitions[ del[i] ].reset; // reset bit vector for point i+1
         if( reset & (~curReset) & (~1) ) { // if (i+1)-th point has additional reset for some clock
             count++;
             curReset |= reset;
+            targetToSuc.push_back(i);
         }		
     }
-    
+    targetToSuc.push_back(P-1);
     
     stateZone* vs = new stateZone(); // new template state
     
@@ -1127,6 +1128,13 @@ stateZone* stateZone::sucState(){
     
     vs->del = new char[count]; //allocate space for transition
     vs->w = new short[count*(count-1)]; // allocate space for the upper and lower limits
+    for(char i =0; i< count;i++)
+    {
+        for(char j =0 ; j< count ; j++)
+        {
+            vs->w[index(i,j,count)]=w[index(targetToSuc[i],targetToSuc[j],P)];
+        }
+    }
    
     vs->del[count-1] = del[P-1]; // the last point is the last transition
     //vs->w[count-1] = w[P-1]; // have to apply the upper and lower bounds
@@ -1136,11 +1144,12 @@ stateZone* stateZone::sucState(){
     //short nf = 0; // flag variable for new state
     curReset = transitions[ del[P-1] ].reset;
     
-    for(i=P-2, j = count-2; i >= 0; i--) {
+    for(char i=P-2, j = count-2; i >= 0; i--) {
         reset = transitions[ del[i] ].reset; // reset bit vector for point i+1
         
         if(reset & (~curReset) & (~1) ) { // found a new necessary point, copy this point to new state
             vs->del[j] = del[i];
+            
             // vs->w[j] = w[i];
             // if( !big(i+1, lastindex+1) ) //from current needy point to the last found needy point distance small
             // nf |= a32[j+1]; // distance (j+1->(j+2)) is small
@@ -1151,6 +1160,7 @@ stateZone* stateZone::sucState(){
     }
     
     // vs->f = nf; // copy flag information, no stack info is there till now for the template state
+    vs->f = f;
     
     return vs;
 }
@@ -1557,7 +1567,7 @@ bool isEmptyZone() {
         // printing the current state information and its parents
         
         //This line is very important for debugging
-        //rs->print();
+        rs->print();
         //This line is very important for debugging
         xrs = allStatesZone[count].second;
         // priting parents :
@@ -1583,7 +1593,7 @@ bool isEmptyZone() {
         {
             for(int i =0; i < count ; i++)
             {
-                vs = rs->shuffle(allStatesZone[i].first);
+                vs = rs->shuffle(allStatesZone[i].first); //trying to shuffle with all possible
                 if(vs != nullptr)
                 {
                     if(identity(vs)) //if already not present in the all states
@@ -1602,6 +1612,7 @@ bool isEmptyZone() {
                 }
             }
             vs = rs->sucState();
+            getchar();
             if(identity(vs))
             {
                 xrs = getTrackZone(0,-1,count);
@@ -1610,7 +1621,7 @@ bool isEmptyZone() {
             }
             
         }
-        else if (L < P && pushl &&popr && ppDone)
+        else if (L < P && pushl && popr && ppDone)
         {
             for(int i = 0; i < count ; i++)
             {