Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is NeighborGrid-PT-d2n3m1c12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174100006
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-0
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-1
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-15
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-2
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-3
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-4
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-5
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-6
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-7
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-8
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496256840295


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("p_1_2>=1"))
Formula 0 simplified : !"p_1_2>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.075899,23044,1,0,5,2599,14,0,348,2409,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((X(X("p_1_2>=1")))U("p_1_0>=1"))))
Formula 1 simplified : !G(XX"p_1_2>=1" U "p_1_0>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 9 cols
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.124748,24800,1,0,10,6523,23,0,371,6407,29
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G((X("p_2_2>=1"))U(G("p_2_1>=1"))))))
Formula 2 simplified : !FG(X"p_2_2>=1" U G"p_2_1>=1")
invariant : 1'p_0_0 + 1'p_0_1 + 1'p_0_2 + 1'p_1_0 + 1'p_1_1 + 1'p_1_2 + 1'p_2_0 + 1'p_2_1 + 1'p_2_2= 9
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.322164,29128,1,0,39,22452,32,12,373,26868,116
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((("p_1_1>=1")U(G("p_2_1>=1")))U(F(("p_2_2>=1")U("p_1_2>=1")))))
Formula 3 simplified : !(("p_1_1>=1" U G"p_2_1>=1") U F("p_2_2>=1" U "p_1_2>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.325733,29936,1,0,39,22452,38,12,373,26868,118
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X((F("p_1_1>=1"))U("p_0_0>=1")))))
Formula 4 simplified : !GX(F"p_1_1>=1" U "p_0_0>=1")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.400106,30804,1,0,60,28538,55,20,377,33760,181
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(("p_2_1>=1")U(G("p_1_2>=1")))))
Formula 5 simplified : !F("p_2_1>=1" U G"p_1_2>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.504225,32572,1,0,108,37159,65,50,377,45445,320
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("p_2_0>=1")))
Formula 6 simplified : !G"p_2_0>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.705644,35304,1,0,134,50496,71,61,378,63849,396
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("p_1_2>=1"))
Formula 7 simplified : !"p_1_2>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.706245,35308,1,0,134,50496,71,61,378,63849,396
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(F("p_0_2>=1"))))
Formula 8 simplified : !F"p_0_2>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.706822,35568,1,0,134,50496,80,61,379,63849,400
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("p_2_0>=1"))
Formula 9 simplified : !"p_2_0>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.707225,35568,1,0,134,50496,80,61,379,63849,402
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((("p_2_2>=1")U(F(G("p_1_1>=1")))))
Formula 10 simplified : !("p_2_2>=1" U FG"p_1_1>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.830662,37444,1,0,170,61110,90,86,379,77955,529
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F((X(F("p_1_1>=1")))U(X(F("p_2_1>=1"))))))
Formula 11 simplified : !F(XF"p_1_1>=1" U XF"p_2_1>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.873797,38620,1,0,205,67397,96,99,379,86021,599
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("p_0_1>=1")))
Formula 12 simplified : !G"p_0_1>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.966911,40716,1,0,229,77600,102,109,380,100433,672
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((("p_2_2>=1")U(X("p_1_1>=1")))U("p_1_2>=1")))
Formula 13 simplified : !(("p_2_2>=1" U X"p_1_1>=1") U "p_1_2>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.968305,40848,1,0,229,77600,108,109,384,100433,676
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("p_1_2>=1"))
Formula 14 simplified : !"p_1_2>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.968573,41108,1,0,229,77600,108,109,384,100433,676
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(G(F(X("p_2_2>=1")))))))
Formula 15 simplified : !FXGFX"p_2_2>=1"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.969328,41124,1,0,231,77603,114,110,384,100438,689
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496256845600

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 6:54:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 6:54:03 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 58 ms
May 31, 2017 6:54:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 9 places.
May 31, 2017 6:54:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
May 31, 2017 6:54:03 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
May 31, 2017 6:54:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 14 ms
May 31, 2017 6:54:03 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 195 ms
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 9 variables to be positive in 227 ms
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/40 took 7 ms. Total solver calls (SAT/UNSAT): 10(5/5)
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 207 ms. Total solver calls (SAT/UNSAT): 400(200/200)
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 143 ms. Total solver calls (SAT/UNSAT): 400(200/200)
May 31, 2017 6:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 40 transitions.
May 31, 2017 6:54:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 227 ms. Total solver calls (SAT/UNSAT): 820(820/0)
May 31, 2017 6:54:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 40 transitions.
May 31, 2017 6:54:05 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d2n3m1c12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is NeighborGrid-PT-d2n3m1c12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-149581174100006"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;