Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759600814.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759600814
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 244K May 18 16:43 model.pnml

--------------------
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 ShieldRVs-PT-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717051439030

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:44:00] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-30 06:44:00] [INFO ] Transformed 803 places.
[2024-05-30 06:44:00] [INFO ] Transformed 903 transitions.
[2024-05-30 06:44:00] [INFO ] Found NUPN structural information;
[2024-05-30 06:44:00] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (44 resets) in 1564 ms. (25 steps per ms) remains 3/14 properties
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
// Phase 1: matrix 903 rows 803 cols
[2024-05-30 06:44:01] [INFO ] Computed 81 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 225/246 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 225/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 557/803 variables, 61/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 557/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 903/1706 variables, 803/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 1687 constraints, problems are : Problem set: 0 solved, 3 unsolved in 947 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 225/246 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 225/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 06:44:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 11 ms to minimize.
[2024-05-30 06:44:02] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-30 06:44:02] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 06:44:02] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 557/803 variables, 61/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/803 variables, 557/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 06:44:03] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 5 ms to minimize.
[2024-05-30 06:44:03] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2024-05-30 06:44:03] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 4 ms to minimize.
[2024-05-30 06:44:03] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 4 ms to minimize.
[2024-05-30 06:44:03] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 3 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 4 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 4 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 4 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 4 ms to minimize.
[2024-05-30 06:44:04] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-30 06:44:05] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-30 06:44:06] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 4 ms to minimize.
[2024-05-30 06:44:06] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-30 06:44:06] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/803 variables, 20/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 06:44:06] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-30 06:44:06] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 4 ms to minimize.
[2024-05-30 06:44:07] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-30 06:44:07] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-05-30 06:44:07] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 6 ms to minimize.
SMT process timed out in 6119ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 803 transition count 830
Reduce places removed 73 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 730 transition count 828
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 728 transition count 828
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 150 place count 728 transition count 730
Deduced a syphon composed of 98 places in 3 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 346 place count 630 transition count 730
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 477 place count 499 transition count 599
Iterating global reduction 3 with 131 rules applied. Total rules applied 608 place count 499 transition count 599
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 608 place count 499 transition count 548
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 710 place count 448 transition count 548
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 988 place count 309 transition count 409
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1026 place count 309 transition count 409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1027 place count 308 transition count 408
Applied a total of 1027 rules in 233 ms. Remains 308 /803 variables (removed 495) and now considering 408/903 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 308/803 places, 408/903 transitions.
RANDOM walk for 40000 steps (139 resets) in 879 ms. (45 steps per ms) remains 1/3 properties
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 22861 steps (8 resets) in 72 ms. (313 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 7702 ms.
ITS solved all properties within timeout

BK_STOP 1717051448058

--------------------
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 ReachabilityCardinality -timeout 360 -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="ShieldRVs-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759600814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;