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

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1----2----3
		L : 1
	Transitions:	0	4	2	
	Accuracy: 	    1	    1	    
	TSM : 		0	4	6	


	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), (4, 1.0), (5, 1.0), (6, 1.0), (8, 2.0), (7, 2.0), (4, 2.0), (5, 2.0), (6, 2.0), (8, 3.0), (7, 3.0), (4, 3.0), (4, 4.0), (5, 4.0), (6, 4.0), (8, 5.0), (8, 5.0), (7, 5.0), (3, 5.0), (2, 6.0), 

Correct!
#stacks : 1
#clocks : 1
#states : 5
#transitions : 8
Maximum constant(M) : 9
Tree-Width(K) : 5

---END OF EXECUTION---

Execution time : 0.155468 seconds.

