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.r140-smll-174876533600163.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 MedleyA-PT-21, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533600163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 70K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748928912132

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:35:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:35:14] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2025-06-03 05:35:14] [INFO ] Transformed 306 places.
[2025-06-03 05:35:14] [INFO ] Transformed 298 transitions.
[2025-06-03 05:35:14] [INFO ] Found NUPN structural information;
[2025-06-03 05:35:14] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 317 ms.
Graph (trivial) has 235 edges and 306 vertex of which 6 / 306 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Structural test allowed to assert that 171 places are NOT stable. Took 33 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
RANDOM walk for 40000 steps (8 resets) in 2859 ms. (13 steps per ms) remains 31/135 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
// Phase 1: matrix 293 rows 301 cols
[2025-06-03 05:35:16] [INFO ] Computed 20 invariants in 17 ms
[2025-06-03 05:35:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 126/157 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 144/301 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 144/321 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 292/593 variables, 301/622 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/594 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/594 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 623 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2603 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 301/301 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 126/157 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 25 ms to minimize.
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:19] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 144/301 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 144/330 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 3 ms to minimize.
[2025-06-03 05:35:20] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2025-06-03 05:35:21] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 292/593 variables, 301/636 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 31/667 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:21] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-03 05:35:21] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2025-06-03 05:35:22] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/593 variables, 3/670 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:22] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-03 05:35:22] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2025-06-03 05:35:22] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2025-06-03 05:35:22] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 4/674 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-03 05:35:23] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
[2025-06-03 05:35:23] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
SMT process timed out in 7743ms, After SMT, problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 301 transition count 206
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 215 transition count 206
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 173 place count 215 transition count 182
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 221 place count 191 transition count 182
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 251 place count 161 transition count 152
Iterating global reduction 2 with 30 rules applied. Total rules applied 281 place count 161 transition count 152
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 281 place count 161 transition count 143
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 299 place count 152 transition count 143
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 367 place count 118 transition count 109
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 373 place count 115 transition count 132
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 400 place count 115 transition count 105
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 429 place count 88 transition count 103
Applied a total of 429 rules in 124 ms. Remains 88 /301 variables (removed 213) and now considering 103/293 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 88/301 places, 103/293 transitions.
RANDOM walk for 27086 steps (783 resets) in 535 ms. (50 steps per ms) remains 0/31 properties
Able to resolve query StableMarking after proving 137 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 10135 ms.
ITS solved all properties within timeout

BK_STOP 1748928924370

--------------------
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 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="MedleyA-PT-21"
export BK_EXAMINATION="StableMarking"
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 MedleyA-PT-21, 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 r140-smll-174876533600163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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