fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r281-smll-167863551000273
Last Updated
May 14, 2023

About the Execution of Smart+red for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
317.363 58434.00 94556.00 552.00 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r281-smll-167863551000273.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Parking-PT-432, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863551000273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:23 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 1678921707234

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-432
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 23:08:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 23:08:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:08:31] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-15 23:08:31] [INFO ] Transformed 529 places.
[2023-03-15 23:08:31] [INFO ] Transformed 785 transitions.
[2023-03-15 23:08:31] [INFO ] Found NUPN structural information;
[2023-03-15 23:08:31] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 386 ms.
Structural test allowed to assert that 201 places are NOT stable. Took 19 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 876 ms. (steps per millisecond=11 ) properties (out of 328) seen :208
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 120) seen :0
Running SMT prover for 120 properties.
// Phase 1: matrix 457 rows 529 cols
[2023-03-15 23:08:32] [INFO ] Computed 124 place invariants in 22 ms
[2023-03-15 23:08:35] [INFO ] After 3031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:120
[2023-03-15 23:08:37] [INFO ] [Nat]Absence check using 120 positive place invariants in 72 ms returned sat
[2023-03-15 23:08:37] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:08:44] [INFO ] After 4541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :120
[2023-03-15 23:08:44] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-15 23:08:49] [INFO ] After 4822ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :120
[2023-03-15 23:08:49] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 12 ms to minimize.
[2023-03-15 23:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 23:08:51] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-15 23:08:53] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2023-03-15 23:08:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-15 23:08:56] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2023-03-15 23:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-15 23:08:57] [INFO ] After 13151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :120
Attempting to minimize the solution found.
Minimization took 2894 ms.
[2023-03-15 23:09:00] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :120
Fused 120 Parikh solutions to 116 different solutions.
Parikh walk visited 63 properties in 23895 ms.
Support contains 57 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 529 transition count 441
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 513 transition count 441
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 513 transition count 425
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 497 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 493 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 493 transition count 421
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 112 place count 473 transition count 401
Free-agglomeration rule applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 192 place count 473 transition count 321
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 272 place count 393 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 392 transition count 320
Reduce places removed 80 places and 0 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 3 with 190 rules applied. Total rules applied 463 place count 312 transition count 210
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 4 with 155 rules applied. Total rules applied 618 place count 202 transition count 165
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 647 place count 173 transition count 165
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 36 Pre rules applied. Total rules applied 647 place count 173 transition count 129
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 719 place count 137 transition count 129
Applied a total of 719 rules in 238 ms. Remains 137 /529 variables (removed 392) and now considering 129/457 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 137/529 places, 129/457 transitions.
Finished random walk after 210 steps, including 0 resets, run visited all 57 properties in 9 ms. (steps per millisecond=23 )
Able to resolve query StableMarking after proving 329 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 53812 ms.
ITS solved all properties within timeout

BK_STOP 1678921765668

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Parking-PT-432"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Parking-PT-432, 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 r281-smll-167863551000273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;