Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300639.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679464632650

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:57:16] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-22 05:57:16] [INFO ] Transformed 1563 places.
[2023-03-22 05:57:16] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:57:16] [INFO ] Found NUPN structural information;
[2023-03-22 05:57:16] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-22 05:57:17] [INFO ] Computed 221 place invariants in 26 ms
[2023-03-22 05:57:18] [INFO ] After 1017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 05:57:19] [INFO ] [Nat]Absence check using 221 positive place invariants in 216 ms returned sat
[2023-03-22 05:57:22] [INFO ] After 2833ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-22 05:57:23] [INFO ] Deduced a trap composed of 32 places in 613 ms of which 12 ms to minimize.
[2023-03-22 05:57:23] [INFO ] Deduced a trap composed of 19 places in 445 ms of which 2 ms to minimize.
[2023-03-22 05:57:26] [INFO ] Deduced a trap composed of 31 places in 2314 ms of which 2 ms to minimize.
[2023-03-22 05:57:26] [INFO ] Deduced a trap composed of 27 places in 461 ms of which 5 ms to minimize.
[2023-03-22 05:57:28] [INFO ] Deduced a trap composed of 20 places in 1699 ms of which 22 ms to minimize.
[2023-03-22 05:57:29] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 1 ms to minimize.
[2023-03-22 05:57:29] [INFO ] Deduced a trap composed of 44 places in 453 ms of which 13 ms to minimize.
[2023-03-22 05:57:30] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-22 05:57:30] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 1 ms to minimize.
[2023-03-22 05:57:30] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 28 ms to minimize.
[2023-03-22 05:57:31] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 1 ms to minimize.
[2023-03-22 05:57:31] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 1 ms to minimize.
[2023-03-22 05:57:32] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 1 ms to minimize.
[2023-03-22 05:57:32] [INFO ] Deduced a trap composed of 19 places in 367 ms of which 0 ms to minimize.
[2023-03-22 05:57:33] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 2 ms to minimize.
[2023-03-22 05:57:33] [INFO ] Deduced a trap composed of 21 places in 654 ms of which 40 ms to minimize.
[2023-03-22 05:57:34] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 0 ms to minimize.
[2023-03-22 05:57:34] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-22 05:57:34] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2023-03-22 05:57:35] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2023-03-22 05:57:35] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 14 ms to minimize.
[2023-03-22 05:57:35] [INFO ] Deduced a trap composed of 22 places in 423 ms of which 11 ms to minimize.
[2023-03-22 05:57:36] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 1 ms to minimize.
[2023-03-22 05:57:36] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 1 ms to minimize.
[2023-03-22 05:57:37] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 2 ms to minimize.
[2023-03-22 05:57:37] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 1 ms to minimize.
[2023-03-22 05:57:38] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 0 ms to minimize.
[2023-03-22 05:57:38] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 0 ms to minimize.
[2023-03-22 05:57:38] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2023-03-22 05:57:38] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 1 ms to minimize.
[2023-03-22 05:57:39] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 1 ms to minimize.
[2023-03-22 05:57:39] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 1 ms to minimize.
[2023-03-22 05:57:40] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 5 ms to minimize.
[2023-03-22 05:57:40] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 4 ms to minimize.
[2023-03-22 05:57:40] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 0 ms to minimize.
[2023-03-22 05:57:40] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 18011 ms
[2023-03-22 05:57:41] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 0 ms to minimize.
[2023-03-22 05:57:41] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 0 ms to minimize.
[2023-03-22 05:57:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 621 ms
[2023-03-22 05:57:41] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
[2023-03-22 05:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-22 05:57:42] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 1 ms to minimize.
[2023-03-22 05:57:42] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 15 ms to minimize.
[2023-03-22 05:57:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 805 ms
[2023-03-22 05:57:43] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2023-03-22 05:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-22 05:57:43] [INFO ] After 23839ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 05:57:43] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 653 ms.
Support contains 96 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1563 transition count 1110
Reduce places removed 313 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 340 rules applied. Total rules applied 653 place count 1250 transition count 1083
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 680 place count 1223 transition count 1083
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 680 place count 1223 transition count 1006
Deduced a syphon composed of 77 places in 41 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 834 place count 1146 transition count 1006
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 954 place count 1026 transition count 886
Iterating global reduction 3 with 120 rules applied. Total rules applied 1074 place count 1026 transition count 886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1076 place count 1026 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1077 place count 1025 transition count 884
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1077 place count 1025 transition count 844
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1157 place count 985 transition count 844
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 620 rules applied. Total rules applied 1777 place count 675 transition count 534
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1861 place count 633 transition count 534
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1864 place count 633 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1867 place count 630 transition count 531
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 1918 place count 630 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1919 place count 629 transition count 530
Applied a total of 1919 rules in 703 ms. Remains 629 /1563 variables (removed 934) and now considering 530/1423 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 704 ms. Remains : 629/1563 places, 530/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 530 rows 629 cols
[2023-03-22 05:57:45] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-22 05:57:46] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:57:46] [INFO ] [Nat]Absence check using 221 positive place invariants in 34 ms returned sat
[2023-03-22 05:57:47] [INFO ] After 648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:57:47] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-22 05:57:47] [INFO ] After 458ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:57:47] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-22 05:57:47] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-22 05:57:48] [INFO ] Deduced a trap composed of 9 places in 423 ms of which 0 ms to minimize.
[2023-03-22 05:57:48] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 1 ms to minimize.
[2023-03-22 05:57:48] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-22 05:57:49] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-22 05:57:49] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-22 05:57:49] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-22 05:57:49] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-22 05:57:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2101 ms
[2023-03-22 05:57:49] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-22 05:57:50] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-22 05:57:50] [INFO ] Deduced a trap composed of 7 places in 719 ms of which 1 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-22 05:57:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2084 ms
[2023-03-22 05:57:52] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 1 ms to minimize.
[2023-03-22 05:57:52] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 05:57:52] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-22 05:57:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2023-03-22 05:57:53] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 13 ms to minimize.
[2023-03-22 05:57:53] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-22 05:57:53] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-03-22 05:57:53] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2023-03-22 05:57:53] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-22 05:57:54] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-22 05:57:54] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-22 05:57:54] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-22 05:57:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1459 ms
[2023-03-22 05:57:54] [INFO ] After 7271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-22 05:57:54] [INFO ] After 8741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 102 ms.
Support contains 88 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 530/530 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 528
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 627 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 626 transition count 527
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 624 transition count 525
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 621 transition count 524
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 621 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 620 transition count 523
Applied a total of 18 rules in 111 ms. Remains 620 /629 variables (removed 9) and now considering 523/530 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 620/629 places, 523/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 87188 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87188 steps, saw 67135 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 523 rows 620 cols
[2023-03-22 05:57:58] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-22 05:57:59] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:57:59] [INFO ] [Nat]Absence check using 221 positive place invariants in 53 ms returned sat
[2023-03-22 05:58:00] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:58:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 05:58:01] [INFO ] After 704ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:58:02] [INFO ] Deduced a trap composed of 4 places in 955 ms of which 0 ms to minimize.
[2023-03-22 05:58:02] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-22 05:58:03] [INFO ] Deduced a trap composed of 11 places in 1368 ms of which 1 ms to minimize.
[2023-03-22 05:58:03] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-22 05:58:04] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:58:05] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 14 ms to minimize.
[2023-03-22 05:58:05] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 14 ms to minimize.
[2023-03-22 05:58:06] [INFO ] Deduced a trap composed of 7 places in 1638 ms of which 27 ms to minimize.
[2023-03-22 05:58:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5858 ms
[2023-03-22 05:58:07] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-22 05:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-22 05:58:08] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2023-03-22 05:58:08] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-22 05:58:08] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-22 05:58:08] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-22 05:58:08] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-22 05:58:09] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-22 05:58:09] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-22 05:58:09] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-22 05:58:09] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-22 05:58:10] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-22 05:58:10] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 0 ms to minimize.
[2023-03-22 05:58:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2806 ms
[2023-03-22 05:58:10] [INFO ] After 10239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-22 05:58:11] [INFO ] After 11936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 113 ms.
Support contains 88 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 523/523 transitions.
Applied a total of 0 rules in 18 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 620/620 places, 523/523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 523/523 transitions.
Applied a total of 0 rules in 14 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-22 05:58:11] [INFO ] Invariant cache hit.
[2023-03-22 05:58:11] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-22 05:58:11] [INFO ] Invariant cache hit.
[2023-03-22 05:58:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 05:58:14] [INFO ] Implicit Places using invariants and state equation in 3018 ms returned []
Implicit Place search using SMT with State Equation took 3388 ms to find 0 implicit places.
[2023-03-22 05:58:14] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 05:58:14] [INFO ] Invariant cache hit.
[2023-03-22 05:58:15] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4392 ms. Remains : 620/620 places, 523/523 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 620 transition count 523
Applied a total of 86 rules in 36 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 523 rows 620 cols
[2023-03-22 05:58:15] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-22 05:58:15] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:58:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 63 ms returned sat
[2023-03-22 05:58:16] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:58:16] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-22 05:58:17] [INFO ] After 715ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:58:17] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-22 05:58:17] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-22 05:58:18] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:58:18] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-22 05:58:18] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-22 05:58:18] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-22 05:58:18] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 0 ms to minimize.
[2023-03-22 05:58:19] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-22 05:58:19] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-22 05:58:19] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-22 05:58:19] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-22 05:58:19] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2959 ms
[2023-03-22 05:58:20] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-22 05:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-22 05:58:21] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-22 05:58:21] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-22 05:58:21] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 2 ms to minimize.
[2023-03-22 05:58:21] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2023-03-22 05:58:22] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:58:23] [INFO ] Deduced a trap composed of 6 places in 1308 ms of which 0 ms to minimize.
[2023-03-22 05:58:23] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-22 05:58:23] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 13 ms to minimize.
[2023-03-22 05:58:24] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 1 ms to minimize.
[2023-03-22 05:58:24] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 23 ms to minimize.
[2023-03-22 05:58:24] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 05:58:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3437 ms
[2023-03-22 05:58:24] [INFO ] After 7849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-22 05:58:25] [INFO ] After 9283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:58:25] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 25 ms.
[2023-03-22 05:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 620 places, 523 transitions and 2032 arcs took 14 ms.
[2023-03-22 05:58:25] [INFO ] Flatten gal took : 117 ms
Total runtime 69934 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/887/inv_0_ --invariant=/tmp/887/inv_1_ --invariant=/tmp/887/inv_2_ --invariant=/tmp/887/inv_3_ --invariant=/tmp/887/inv_4_ --invariant=/tmp/887/inv_5_ --invariant=/tmp/887/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6025340 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096500 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-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 r393-oct2-167903717300639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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