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.r468-smll-171620167300230.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 ltsminxred
Input is AutonomousCar-PT-01b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 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 AutonomousCar-PT-01b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717209771211

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:42:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:42:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:42:53] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-01 02:42:53] [INFO ] Transformed 119 places.
[2024-06-01 02:42:53] [INFO ] Transformed 132 transitions.
[2024-06-01 02:42:53] [INFO ] Found NUPN structural information;
[2024-06-01 02:42:53] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (15 resets) in 2095 ms. (19 steps per ms) remains 7/14 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (18 resets) in 264 ms. (150 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (33 resets) in 634 ms. (62 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (10 resets) in 611 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (16 resets) in 144 ms. (275 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (13 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
// Phase 1: matrix 132 rows 119 cols
[2024-06-01 02:42:55] [INFO ] Computed 6 invariants in 22 ms
Problem AutonomousCar-PT-01b-ReachabilityCardinality-2024-13 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/119 variables, 6/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 50/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/251 variables, 119/244 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 244 constraints, problems are : Problem set: 1 solved, 3 unsolved in 573 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 64/119 variables, 6/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 64/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 02:42:55] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 25 ms to minimize.
Problem AutonomousCar-PT-01b-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 4/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 132/251 variables, 119/253 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/255 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 02:42:56] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 02:42:57] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 3/258 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 258 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1463 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 2160ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 345 ms.
Support contains 39 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 132/132 transitions.
Graph (trivial) has 51 edges and 119 vertex of which 4 / 119 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 203 edges and 117 vertex of which 112 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 112 transition count 115
Reduce places removed 10 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 21 rules applied. Total rules applied 33 place count 102 transition count 104
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 44 place count 91 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 44 place count 91 transition count 99
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 86 transition count 99
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 82 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 82 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 81 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 81 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 78 place count 74 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 74 transition count 81
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 74 transition count 76
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 94 place count 69 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 69 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 69 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 69 transition count 74
Applied a total of 99 rules in 140 ms. Remains 69 /119 variables (removed 50) and now considering 74/132 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 69/119 places, 74/132 transitions.
RANDOM walk for 40000 steps (864 resets) in 258 ms. (154 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 39366 steps (367 resets) in 183 ms. (213 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4900 ms.
ITS solved all properties within timeout

BK_STOP 1717209777915

--------------------
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="AutonomousCar-PT-01b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-01b, 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 r468-smll-171620167300230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b 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 ;