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----3----4
		L : 1
	Transitions:	-40	0	1	2	
	Weight Matrix : 
	
			0,0	0,0	25346,0	16109,0	
			0,0	0,0	0,0	25410,0	
			0,0	-25410,0	0,0	116,0	
			-33,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:	-40	0	1	2	
	Weight Matrix : 
	
			0,0	0,0	0,0	0,0	
			0,0	0,0	0,0	216,0	
			0,0	0,0	0,0	0,0	
			-25410,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----2----3----4
		L : 1
	Transitions:	-40	0	1	2	
	Weight Matrix : 
	
			0,0	25410,0	4294918867,1	116,0	
			0,0	0,0	0,0	216,0	
			0,0	0,0	0,0	0,0	
			-25410,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----4
		L : 1
	Transitions:	0	0	1	2	
	Weight Matrix : 
	
			0,0	4294926609,1	0,0	0,0	
			0,0	0,0	0,0	216,0	
			0,0	0,0	0,0	4294926609,1	
			-513,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----3----4
		L : 1
	Transitions:	0	0	1	2	
	Weight Matrix : 
	
			0,0	0,0	0,0	0,0	
			0,0	0,0	0,0	0,0	
			0,0	0,0	0,0	0,0	
			-513,0	-513,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----4
		L : 1
	Transitions:	0	9	10	11	
	Accuracy: 	    1	    1	    1	    
	TSM : 		0	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), (3, 0.0), (4, 0.0), (5, 0.0), (6, 0.0), (7, 0.0), (8, 0.0), (9, 0.0), (10, 0.0), (11, 0.0), 

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

---END OF EXECUTION---

Execution time : 0.000425 seconds.

