Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800031
=====================================================================

--------------------
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 RobotManipulation-PT-00020-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526896000916


BK_STOP 1526896283326

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using RobotManipulation-PT-00020 as instance name.
Using RobotManipulation as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 196554, 'Memory': 10433.2, 'Tool': 'marcie'}, {'Time': 277404, 'Memory': 2479.59, 'Tool': 'itstools'}, {'Time': 303857, 'Memory': 6938.92, 'Tool': 'lola'}, {'Time': 956402, 'Memory': 1117.66, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.5459212226665446x far from the best tool marcie.
CTLCardinality marcie RobotManipulation-PT-00020...
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

check for maximal unmarked siphon
ok
check for constant places
ok
marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: RobotManipulation_PT_00020
(NrP: 15 NrTr: 11 NrArc: 34)

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.809sec

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
ok
parse successfull
net created successfully

Net: RobotManipulation_PT_00020
(NrP: 15 NrTr: 11 NrArc: 34)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

net check time: 0m 0.000sec

init dd package: 0m 5.635sec


initing FirstDep: 0m 0.000sec


iterations count:1693 (153), effective:401 (36)

RS generation: 0m 0.905sec


-> reachability set: #nodes 58057 (5.8e+04) #states 4,108,911,268 (9)



starting MCC model checker
--------------------------


initing FirstDep: 0m 0.000sec

checking: AG [~ [AG [3<=p_m]]]
normalized: ~ [E [true U ~ [E [true U ~ [3<=p_m]]]]]

abstracting: (3<=p_m)
states: 3,956,598,646 (9)

iterations count:505 (45), effective:114 (10)

iterations count:284 (25), effective:87 (7)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.750sec

checking: EG [AG [p_rel<=r_stopped]]
normalized: EG [~ [E [true U ~ [p_rel<=r_stopped]]]]

abstracting: (p_rel<=r_stopped)
states: 2,675,471,964 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.457sec

checking: EF [p_i1<=p_i2]
normalized: E [true U p_i1<=p_i2]

abstracting: (p_i1<=p_i2)
states: 2,800,924,038 (9)

iterations count:53 (4), effective:21 (1)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.534sec

checking: [~ [~ [1<=p_i2]] | AG [EF [1<=p_rdy]]]
normalized: [1<=p_i2 | ~ [E [true U ~ [E [true U 1<=p_rdy]]]]]

abstracting: (1<=p_rdy)
states: 3,354,213,280 (9)

iterations count:51 (4), effective:9 (0)
abstracting: (1<=p_i2)
states: 4,046,019,769 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.767sec

checking: ~ [EF [EF [access<=initialized]]]
normalized: ~ [E [true U E [true U access<=initialized]]]

abstracting: (access<=initialized)
states: 2,443,518 (6)

iterations count:531 (48), effective:160 (14)

iterations count:11 (1), effective:0 (0)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.264sec

checking: AG [AX [[initialized<=initialized | 3<=p_sc]]]
normalized: ~ [E [true U EX [~ [[initialized<=initialized | 3<=p_sc]]]]]

abstracting: (3<=p_sc)
states: 2,203,432,660 (9)
abstracting: (initialized<=initialized)
states: 4,108,911,268 (9)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [EF [[r_active<=r_moving | move<=r_stopped]]]
normalized: ~ [E [true U ~ [E [true U [r_active<=r_moving | move<=r_stopped]]]]]

abstracting: (move<=r_stopped)
states: 2,675,471,964 (9)
abstracting: (r_active<=r_moving)
states: 47,657,610 (7)

iterations count:31 (2), effective:20 (1)

iterations count:423 (38), effective:130 (11)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.587sec

checking: AX [EG [[p_sc<=r_active & initialized<=move]]]
normalized: ~ [EX [~ [EG [[p_sc<=r_active & initialized<=move]]]]]

abstracting: (initialized<=move)
states: 2,260,104,660 (9)
abstracting: (p_sc<=r_active)
states: 4,108,911,268 (9)
...................................................................................
EG iterations: 83
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.468sec

checking: ~ [A [[1<=r_stopped | 1<=initialize] U ~ [p_rdy<=move]]]
normalized: ~ [[~ [EG [p_rdy<=move]] & ~ [E [p_rdy<=move U [p_rdy<=move & ~ [[1<=r_stopped | 1<=initialize]]]]]]]

abstracting: (1<=initialize)
states: 3,731,562,274 (9)
abstracting: (1<=r_stopped)
states: 3,668,670,775 (9)
abstracting: (p_rdy<=move)
states: 2,260,104,660 (9)
abstracting: (p_rdy<=move)
states: 2,260,104,660 (9)
abstracting: (p_rdy<=move)
states: 2,260,104,660 (9)
...........................................................................................................................
EG iterations: 123
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m32.885sec

checking: AG [EX [[moved<=moved & move<=access]]]
normalized: ~ [E [true U ~ [EX [[moved<=moved & move<=access]]]]]

abstracting: (move<=access)
states: 3,939,856,668 (9)
abstracting: (moved<=moved)
states: 4,108,911,268 (9)

iterations count:897 (81), effective:259 (23)
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.968sec

checking: EF [~ [[[p_i1<=p_sc | 3<=r_stopped] & [3<=p_m | p_m<=p_m]]]]
normalized: E [true U ~ [[[3<=p_m | p_m<=p_m] & [p_i1<=p_sc | 3<=r_stopped]]]]

abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (p_i1<=p_sc)
states: 1,639,088,330 (9)
abstracting: (p_m<=p_m)
states: 4,108,911,268 (9)
abstracting: (3<=p_m)
states: 3,956,598,646 (9)

iterations count:1093 (99), effective:242 (22)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.141sec

checking: [[EF [[initialized<=r_stopped | p_rdy<=p_i2]] & ~ [~ [~ [initialize<=p_m]]]] | [AG [~ [3<=p_rel]] | AG [~ [1<=r_stopped]]]]
normalized: [[~ [E [true U 1<=r_stopped]] | ~ [E [true U 3<=p_rel]]] | [~ [initialize<=p_m] & E [true U [initialized<=r_stopped | p_rdy<=p_i2]]]]

abstracting: (p_rdy<=p_i2)
states: 3,370,884,968 (9)
abstracting: (initialized<=r_stopped)
states: 2,675,471,964 (9)

iterations count:110 (10), effective:33 (3)
abstracting: (initialize<=p_m)
states: 3,109,533,438 (9)
abstracting: (3<=p_rel)
states: 2,203,432,660 (9)

iterations count:128 (11), effective:27 (2)
abstracting: (1<=r_stopped)
states: 3,668,670,775 (9)

iterations count:49 (4), effective:8 (0)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.540sec

checking: [EF [[[r_stopped<=off & 3<=r_stopped] & [3<=r_stopped | initialize<=initialize]]] | AF [~ [[moved<=p_i1 | 1<=p_m]]]]
normalized: [~ [EG [[moved<=p_i1 | 1<=p_m]]] | E [true U [[3<=r_stopped | initialize<=initialize] & [r_stopped<=off & 3<=r_stopped]]]]

abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (r_stopped<=off)
states: 2,166,435,964 (9)
abstracting: (initialize<=initialize)
states: 4,108,911,268 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)

iterations count:452 (41), effective:119 (10)
abstracting: (1<=p_m)
states: 4,090,177,630 (9)
abstracting: (moved<=p_i1)
states: 2,769,140,660 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.029sec

checking: [[[~ [[3<=moved & r_stopped<=access]] & AX [1<=p_sc]] | ~ [EF [p_i1<=move]]] | ~ [[AX [p_rel<=off] & AX [2<=p_i1]]]]
normalized: [~ [[~ [EX [~ [2<=p_i1]]] & ~ [EX [~ [p_rel<=off]]]]] | [~ [E [true U p_i1<=move]] | [~ [EX [~ [1<=p_sc]]] & ~ [[3<=moved & r_stopped<=access]]]]]

abstracting: (r_stopped<=access)
states: 4,108,911,268 (9)
abstracting: (3<=moved)
states: 2,203,432,660 (9)
abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
.abstracting: (p_i1<=move)
states: 1,639,088,330 (9)

iterations count:93 (8), effective:41 (3)

iterations count:218 (19), effective:59 (5)
abstracting: (p_rel<=off)
states: 2,675,471,964 (9)
.abstracting: (2<=p_i1)
states: 3,354,213,280 (9)
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.478sec

checking: [[~ [AX [initialized<=p_rel]] | ~ [AF [3<=p_sc]]] & E [[2<=p_i1 | p_m<=p_i1] U [3<=off & p_i1<=initialize]]]
normalized: [E [[2<=p_i1 | p_m<=p_i1] U [3<=off & p_i1<=initialize]] & [EG [~ [3<=p_sc]] | EX [~ [initialized<=p_rel]]]]

abstracting: (initialized<=p_rel)
states: 2,260,104,660 (9)
.abstracting: (3<=p_sc)
states: 2,203,432,660 (9)
.
EG iterations: 1
abstracting: (p_i1<=initialize)
states: 2,148,124,330 (9)
abstracting: (3<=off)
states: 2,850,092,245 (9)
abstracting: (p_m<=p_i1)
states: 1,143,716,860 (9)
abstracting: (2<=p_i1)
states: 3,354,213,280 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.604sec

checking: EF [[[p_m<=r_stopped & ~ [off<=r_stopped]] & [[r_moving<=move & 2<=initialize] | [p_i1<=access | 1<=initialized]]]]
normalized: E [true U [[[p_i1<=access | 1<=initialized] | [r_moving<=move & 2<=initialize]] & [p_m<=r_stopped & ~ [off<=r_stopped]]]]

abstracting: (off<=r_stopped)
states: 2,166,435,964 (9)
abstracting: (p_m<=r_stopped)
states: 1,060,302,760 (9)
abstracting: (2<=initialize)
states: 3,354,213,280 (9)
abstracting: (r_moving<=move)
states: 2,260,104,660 (9)
abstracting: (1<=initialized)
states: 3,354,213,280 (9)
abstracting: (p_i1<=access)
states: 4,099,544,449 (9)

iterations count:1053 (95), effective:282 (25)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.064sec

totally nodes used: 25234687 (2.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 288861272 73720089 362581361
used/not used/entry size/cache size: 49625558 17483306 16 1024MB
basic ops cache: hits/miss/sum: 107848862 31340672 139189534
used/not used/entry size/cache size: 14929547 1847669 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 6130578 1908926 8039504
used/not used/entry size/cache size: 1698689 6689919 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 49010125
1 14651658
2 2728423
3 465295
4 78769
5 26286
6 13940
7 10790
8 7371
9 8397
>= 10 107810

Total processing time: 4m36.725sec

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="RobotManipulation-PT-00020"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00020.tgz
mv RobotManipulation-PT-00020 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is RobotManipulation-PT-00020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-152685548800031"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;