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.r210-tall-174894547200232.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 ShieldIIPs-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547200232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 503K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749025658195

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:27:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 08:27:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:27:39] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2025-06-04 08:27:39] [INFO ] Transformed 1803 places.
[2025-06-04 08:27:39] [INFO ] Transformed 1773 transitions.
[2025-06-04 08:27:39] [INFO ] Found NUPN structural information;
[2025-06-04 08:27:39] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 329 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1803 transition count 1622
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1652 transition count 1622
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1652 transition count 1471
Deduced a syphon composed of 151 places in 18 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1501 transition count 1471
Performed 720 Post agglomeration using F-continuation condition.Transition count delta: 720
Deduced a syphon composed of 720 places in 3 ms
Reduce places removed 720 places and 0 transitions.
Iterating global reduction 2 with 1440 rules applied. Total rules applied 2044 place count 781 transition count 751
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2044 rules in 301 ms. Remains 781 /1803 variables (removed 1022) and now considering 751/1773 (removed 1022) transitions.
// Phase 1: matrix 751 rows 781 cols
[2025-06-04 08:27:40] [INFO ] Computed 271 invariants in 24 ms
[2025-06-04 08:27:40] [INFO ] Implicit Places using invariants in 661 ms returned [766]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 694 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 780/1803 places, 751/1773 transitions.
Applied a total of 0 rules in 10 ms. Remains 780 /780 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1022 ms. Remains : 780/1803 places, 751/1773 transitions.
Discarding 180 transitions out of 751. Remains 571
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (24 resets) in 2796 ms. (14 steps per ms) remains 1/570 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
// Phase 1: matrix 751 rows 780 cols
[2025-06-04 08:27:41] [INFO ] Computed 270 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 769/780 variables, 267/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 769/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 7 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2025-06-04 08:27:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/780 variables, 13/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 751/1531 variables, 780/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 3 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 3 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 3 ms to minimize.
[2025-06-04 08:27:43] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 3 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2025-06-04 08:27:44] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1531 variables, 17/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1531 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1531/1531 variables, and 1860 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3664 ms.
Refiners :[Domain max(s): 780/780 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 769/780 variables, 267/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 769/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/780 variables, 30/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2025-06-04 08:27:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 8/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 751/1531 variables, 780/1868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 1/1869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2025-06-04 08:27:46] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1531 variables, 14/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1531 variables, 0/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1531 variables, 0/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1531/1531 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2380 ms.
Refiners :[Domain max(s): 780/780 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 52/52 constraints]
After SMT, in 6086ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 751/751 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 750 transition count 721
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 750 transition count 721
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 266 place count 750 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 267 place count 749 transition count 720
Applied a total of 267 rules in 175 ms. Remains 749 /780 variables (removed 31) and now considering 720/751 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 749/780 places, 720/751 transitions.
RANDOM walk for 5965 steps (1 resets) in 58 ms. (101 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 571 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 8976 ms.
ITS solved all properties within timeout

BK_STOP 1749025668522

--------------------
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 QuasiLiveness -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="ShieldIIPs-PT-030B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldIIPs-PT-030B, examination is QuasiLiveness"
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-tall-174894547200232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;