Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979200111.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979200111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 244K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679379465192

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 06:17:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 06:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:17:47] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-21 06:17:47] [INFO ] Transformed 803 places.
[2023-03-21 06:17:47] [INFO ] Transformed 903 transitions.
[2023-03-21 06:17:47] [INFO ] Found NUPN structural information;
[2023-03-21 06:17:47] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-21 06:17:48] [INFO ] Computed 81 place invariants in 27 ms
[2023-03-21 06:17:49] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 06:17:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-21 06:17:50] [INFO ] After 930ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 7 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 1 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 2 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 1 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 46 places in 313 ms of which 1 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 2 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 0 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 5 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 0 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:18:00] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 9536 ms
[2023-03-21 06:18:00] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2023-03-21 06:18:00] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 0 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 4 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3038 ms
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 0 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 11 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 0 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2023-03-21 06:18:08] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2023-03-21 06:18:08] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-21 06:18:08] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-21 06:18:08] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-21 06:18:08] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-21 06:18:09] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 6533 ms
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 0 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:18:10] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:18:11] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2456 ms
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2023-03-21 06:18:14] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 06:18:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 06:18:14] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 109 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 803 transition count 845
Reduce places removed 58 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 123 place count 745 transition count 838
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 738 transition count 838
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 130 place count 738 transition count 744
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 318 place count 644 transition count 744
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 424 place count 538 transition count 638
Iterating global reduction 3 with 106 rules applied. Total rules applied 530 place count 538 transition count 638
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 530 place count 538 transition count 604
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 598 place count 504 transition count 604
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 858 place count 374 transition count 474
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 890 place count 374 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 891 place count 373 transition count 473
Applied a total of 891 rules in 214 ms. Remains 373 /803 variables (removed 430) and now considering 473/903 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 373/803 places, 473/903 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :2
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 473 rows 373 cols
[2023-03-21 06:18:14] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-21 06:18:14] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 06:18:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-21 06:18:15] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 621 ms
[2023-03-21 06:18:16] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-21 06:18:16] [INFO ] After 1340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 76 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 473/473 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 373 transition count 469
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 369 transition count 469
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 369 transition count 465
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 365 transition count 465
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 50 place count 348 transition count 448
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 348 transition count 448
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 344 transition count 444
Applied a total of 56 rules in 70 ms. Remains 344 /373 variables (removed 29) and now considering 444/473 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 344/373 places, 444/473 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 788897 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 788897 steps, saw 148999 distinct states, run finished after 3002 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 344 cols
[2023-03-21 06:18:19] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-21 06:18:19] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 06:18:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-21 06:18:20] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-21 06:18:20] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-21 06:18:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 856 ms
[2023-03-21 06:18:21] [INFO ] After 1244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-21 06:18:21] [INFO ] After 1544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 76 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 14 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 344/344 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 40 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-21 06:18:21] [INFO ] Invariant cache hit.
[2023-03-21 06:18:21] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-21 06:18:21] [INFO ] Invariant cache hit.
[2023-03-21 06:18:22] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-21 06:18:22] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-21 06:18:22] [INFO ] Invariant cache hit.
[2023-03-21 06:18:22] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1286 ms. Remains : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 30 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 06:18:22] [INFO ] Invariant cache hit.
[2023-03-21 06:18:22] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 06:18:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 26 ms returned sat
[2023-03-21 06:18:23] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 06:18:23] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-21 06:18:23] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-21 06:18:23] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2023-03-21 06:18:23] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-21 06:18:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-21 06:18:25] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2048 ms
[2023-03-21 06:18:25] [INFO ] After 2586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-21 06:18:25] [INFO ] After 2942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 06:18:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-21 06:18:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 344 places, 444 transitions and 1986 arcs took 6 ms.
[2023-03-21 06:18:25] [INFO ] Flatten gal took : 87 ms
Total runtime 38404 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 020B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 344 places, 444 transitions, 1986 arcs.
Final Score: 6441.9
Took : 22 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679379529255

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 2821:
syntax error

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="ShieldRVs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ShieldRVs-PT-020B, 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 r427-tajo-167905979200111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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