Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881267000408.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBNT-PT-S05J40, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881267000408
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 337K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 236K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 399K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748902997073

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 22:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 22:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:23:18] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2025-06-02 22:23:18] [INFO ] Transformed 629 places.
[2025-06-02 22:23:18] [INFO ] Transformed 1590 transitions.
[2025-06-02 22:23:18] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 269 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 10 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2758 resets) in 2758 ms. (14 steps per ms) remains 39/627 properties
BEST_FIRST walk for 4005 steps (68 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (90 resets) in 48 ms. (81 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (51 resets) in 29 ms. (133 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4003 steps (65 resets) in 62 ms. (63 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4004 steps (78 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (74 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (60 resets) in 29 ms. (133 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (53 resets) in 32 ms. (121 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (46 resets) in 25 ms. (154 steps per ms) remains 24/31 properties
BEST_FIRST walk for 4003 steps (78 resets) in 21 ms. (181 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (79 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (80 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (69 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (67 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (64 resets) in 21 ms. (181 steps per ms) remains 18/22 properties
BEST_FIRST walk for 4003 steps (87 resets) in 24 ms. (160 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (69 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (86 resets) in 32 ms. (121 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (67 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (69 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (72 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 13/16 properties
[2025-06-02 22:23:19] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2025-06-02 22:23:20] [INFO ] Computed 102 invariants in 53 ms
[2025-06-02 22:23:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 138/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 182/333 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 135/468 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 147/615 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 13/628 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 931/1559 variables, 628/730 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1559 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1559 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/1560 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 732 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 138/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 182/333 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 135/468 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 147/615 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-02 22:23:23] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 13/628 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 931/1559 variables, 628/731 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1559 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1559 variables, 13/745 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1559 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/1560 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-02 22:23:26] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/1560 variables, and 747 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 7384ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 624 transition count 893
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 89 place count 582 transition count 893
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 89 place count 582 transition count 852
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 171 place count 541 transition count 852
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 540 transition count 851
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 540 transition count 851
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 538 transition count 849
Applied a total of 177 rules in 215 ms. Remains 538 /629 variables (removed 91) and now considering 849/935 (removed 86) transitions.
Running 843 sub problems to find dead transitions.
[2025-06-02 22:23:27] [INFO ] Flow matrix only has 845 transitions (discarded 4 similar events)
// Phase 1: matrix 845 rows 538 cols
[2025-06-02 22:23:27] [INFO ] Computed 97 invariants in 25 ms
[2025-06-02 22:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2025-06-02 22:23:38] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 4 ms to minimize.
[2025-06-02 22:23:38] [INFO ] Deduced a trap composed of 129 places in 212 ms of which 4 ms to minimize.
[2025-06-02 22:23:38] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1383 variables, and 95 constraints, problems are : Problem set: 0 solved, 843 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/538 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 843/843 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2025-06-02 22:23:53] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1383 variables, and 96 constraints, problems are : Problem set: 0 solved, 843 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/538 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/843 constraints, Known Traps: 4/4 constraints]
After SMT, in 41930ms problems are : Problem set: 0 solved, 843 unsolved
Search for dead transitions found 0 dead transitions in 41943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42177 ms. Remains : 538/629 places, 849/935 transitions.
RANDOM walk for 11385 steps (607 resets) in 270 ms. (42 steps per ms) remains 0/13 properties
Able to resolve query StableMarking after proving 628 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 51345 ms.
ITS solved all properties within timeout

BK_STOP 1748903049705

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBNT-PT-S05J40, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881267000408"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;