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
		L : 1
	Transitions:	-40	2	
	Weight Matrix : 
	
			0,0	0,0	
			0,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	7	
	Accuracy: 	    0	    
	TSM : 		0	1	


	Push done at L : 0
	Pop done at R : 1

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), 

Wrong
#stacks : 1
#clocks : 0
#states : 8
#transitions : 7
Maximum constant(M) : 2
Tree-Width(K) : 2

---END OF EXECUTION---

Execution time : 0.000281 seconds.

