Initial state is same as final state 

Abstract state of the on the fly tree automata(TA):
	Points in the automaton:
		1----2
		L : 1
	Transitions:	0	5	
	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), (2, 2.0), (6, 3.0), (4, 6.0), (5, 12.0), 

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

---END OF EXECUTION---

Execution time : 0.000403 seconds.

