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
3

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1----2----3
		L : 1
	Transitions:	-40	0	2	
	Weight Matrix : 
	
			0,0	4294928883,1	0,0	
			0,0	0,0	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----3
		L : 1
	Transitions:	-40	0	2	
	Weight Matrix : 
	
			0,0	0,0	4294918447,1	
			0,0	0,0	32626,0	
			-33,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
		L : 1
	Transitions:	-40	0	2	
	Weight Matrix : 
	
			0,0	0,0	0,0	
			-16687,1	0,0	32626,0	
			-33,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----3
		L : 1
	Transitions:	0	5	6	
	Accuracy: 	    1	    1	    
	TSM : 		0	0	0	


	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), (5, 0.0), (6, 0.0), 

Wrong
#stacks : 1
#clocks : 1
#states : 5
#transitions : 6
Maximum constant(M) : 3
Tree-Width(K) : 5

---END OF EXECUTION---

Execution time : 0.000513 seconds.

