Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900455.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 47K Mar 24 05:37 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 BusinessProcesses-PT-01-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591156273521

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:51:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:51:16] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-06-03 03:51:16] [INFO ] Transformed 200 places.
[2020-06-03 03:51:16] [INFO ] Transformed 178 transitions.
[2020-06-03 03:51:16] [INFO ] Found NUPN structural information;
[2020-06-03 03:51:16] [INFO ] Parsed PT model containing 200 places and 178 transitions in 83 ms.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 119 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 177 rows 199 cols
[2020-06-03 03:51:16] [INFO ] Computed 30 place invariants in 8 ms
[2020-06-03 03:51:16] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned unsat
[2020-06-03 03:51:16] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned unsat
[2020-06-03 03:51:16] [INFO ] [Real]Absence check using 20 positive place invariants in 100 ms returned sat
[2020-06-03 03:51:16] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 30 ms returned sat
[2020-06-03 03:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:17] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-06-03 03:51:17] [INFO ] Deduced a trap composed of 9 places in 361 ms
[2020-06-03 03:51:17] [INFO ] Deduced a trap composed of 59 places in 133 ms
[2020-06-03 03:51:17] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-03 03:51:17] [INFO ] Deduced a trap composed of 12 places in 80 ms
[2020-06-03 03:51:18] [INFO ] Deduced a trap composed of 12 places in 179 ms
[2020-06-03 03:51:18] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2020-06-03 03:51:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 958 ms
[2020-06-03 03:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:51:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 92 ms returned sat
[2020-06-03 03:51:18] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 7 ms returned sat
[2020-06-03 03:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:18] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2020-06-03 03:51:19] [INFO ] Deduced a trap composed of 9 places in 744 ms
[2020-06-03 03:51:20] [INFO ] Deduced a trap composed of 48 places in 968 ms
[2020-06-03 03:51:20] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-06-03 03:51:20] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2020-06-03 03:51:20] [INFO ] Deduced a trap composed of 8 places in 105 ms
[2020-06-03 03:51:21] [INFO ] Deduced a trap composed of 11 places in 139 ms
[2020-06-03 03:51:21] [INFO ] Deduced a trap composed of 51 places in 88 ms
[2020-06-03 03:51:23] [INFO ] Deduced a trap composed of 18 places in 2005 ms
[2020-06-03 03:51:23] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-06-03 03:51:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s10 s11 s12 s13 s14 s57 s63 s64 s65 s117 s122 s158 s159 s170 s171 s181 s184 s188 s189 s193) 0)") while checking expression at index 2
[2020-06-03 03:51:23] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-06-03 03:51:23] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-06-03 03:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:23] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-06-03 03:51:23] [INFO ] Deduced a trap composed of 49 places in 163 ms
[2020-06-03 03:51:23] [INFO ] Deduced a trap composed of 46 places in 106 ms
[2020-06-03 03:51:24] [INFO ] Deduced a trap composed of 9 places in 600 ms
[2020-06-03 03:51:24] [INFO ] Deduced a trap composed of 17 places in 111 ms
[2020-06-03 03:51:24] [INFO ] Deduced a trap composed of 53 places in 101 ms
[2020-06-03 03:51:25] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-06-03 03:51:25] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2020-06-03 03:51:25] [INFO ] Deduced a trap composed of 47 places in 427 ms
[2020-06-03 03:51:26] [INFO ] Deduced a trap composed of 50 places in 522 ms
[2020-06-03 03:51:27] [INFO ] Deduced a trap composed of 40 places in 1228 ms
[2020-06-03 03:51:27] [INFO ] Deduced a trap composed of 44 places in 66 ms
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 51 places in 645 ms
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 51 places in 94 ms
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 53 places in 113 ms
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 39 places in 69 ms
[2020-06-03 03:51:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s42 s43 s44 s92 s101 s102 s103 s106 s107 s108 s116 s118 s131 s132 s133 s140 s141 s142 s143 s144 s145 s148 s149 s150 s151 s162 s163 s166 s167 s168 s169 s174 s175 s178 s179 s190 s191 s192) 0)") while checking expression at index 3
[2020-06-03 03:51:28] [INFO ] [Real]Absence check using 20 positive place invariants in 65 ms returned sat
[2020-06-03 03:51:28] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 7 ms returned sat
[2020-06-03 03:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:28] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-06-03 03:51:28] [INFO ] Deduced a trap composed of 11 places in 67 ms
[2020-06-03 03:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 246 ms
[2020-06-03 03:51:29] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-03 03:51:29] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 5 ms returned sat
[2020-06-03 03:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:29] [INFO ] [Real]Absence check using state equation in 77 ms returned unsat
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 199/199 places, 177/177 transitions.
Graph (trivial) has 110 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 43 ms
Free SCC test removed 7 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 372 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.41 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 189 transition count 125
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 94 place count 148 transition count 125
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 94 place count 148 transition count 103
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 144 place count 120 transition count 103
Symmetric choice reduction at 2 with 20 rule applications. Total rules 164 place count 120 transition count 103
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 204 place count 100 transition count 83
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 204 place count 100 transition count 81
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 98 transition count 81
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 264 place count 70 transition count 53
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 70 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 268 place count 68 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 67 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 66 transition count 50
Applied a total of 270 rules in 197 ms. Remains 66 /199 variables (removed 133) and now considering 50/177 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/199 places, 50/177 transitions.
Incomplete random walk after 1000000 steps, including 35684 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10080 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 11629 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties seen :[0, 0]
Probably explored full state space saw : 9148 states, properties seen :[0, 0]
Probabilistic random walk after 41883 steps, saw 9148 distinct states, run finished after 40 ms. (steps per millisecond=1047 ) properties seen :[0, 0]
Explored full state space saw : 9148 states, properties seen :[0, 0]
Exhaustive walk after 41883 steps, saw 9148 distinct states, run finished after 24 ms. (steps per millisecond=1745 ) properties seen :[0, 0]
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.

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

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="BusinessProcesses-PT-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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