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.r421-tajo-167905975300461.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 itstools
Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679180668792

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 23:04:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:04:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:04:30] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-18 23:04:30] [INFO ] Transformed 2398 places.
[2023-03-18 23:04:30] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:04:30] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-18 23:04:30] [INFO ] Computed 6 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
[2023-03-18 23:04:31] [INFO ] Invariant cache hit.
[2023-03-18 23:04:31] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-18 23:04:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:31] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-18 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-18 23:04:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:32] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-18 23:04:32] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-18 23:04:33] [INFO ] [Nat]Added 1674 Read/Feed constraints in 504 ms returned sat
[2023-03-18 23:04:33] [INFO ] Deduced a trap composed of 227 places in 380 ms of which 3 ms to minimize.
[2023-03-18 23:04:33] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 2 ms to minimize.
[2023-03-18 23:04:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 840 ms
[2023-03-18 23:04:34] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 378 ms.
[2023-03-18 23:04:35] [INFO ] Added : 17 causal constraints over 4 iterations in 1153 ms. Result :sat
Minimization took 453 ms.
[2023-03-18 23:04:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 23:04:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-18 23:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:36] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2023-03-18 23:04:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:37] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-18 23:04:37] [INFO ] [Nat]Added 1674 Read/Feed constraints in 502 ms returned sat
[2023-03-18 23:04:38] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 2 ms to minimize.
[2023-03-18 23:04:39] [INFO ] Deduced a trap composed of 36 places in 741 ms of which 2 ms to minimize.
[2023-03-18 23:04:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1246 ms
[2023-03-18 23:04:39] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 358 ms.
[2023-03-18 23:04:40] [INFO ] Added : 21 causal constraints over 5 iterations in 1427 ms. Result :sat
Minimization took 1145 ms.
Current structural bounds on expressions (after SMT) : [1, 57] Max seen :[0, 0]
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1169 place count 178 transition count 271
Iterating global reduction 2 with 92 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1335 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1374 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1398 place count 139 transition count 158
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1406 place count 131 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1414 place count 131 transition count 146
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1422 place count 123 transition count 138
Iterating global reduction 4 with 8 rules applied. Total rules applied 1430 place count 123 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1434 place count 119 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 1438 place count 119 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1439 place count 119 transition count 132
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1443 place count 115 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 1447 place count 115 transition count 128
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1450 place count 112 transition count 125
Iterating global reduction 5 with 3 rules applied. Total rules applied 1453 place count 112 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1454 place count 111 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1455 place count 111 transition count 124
Applied a total of 1455 rules in 213 ms. Remains 111 /414 variables (removed 303) and now considering 124/1954 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 111/414 places, 124/1954 transitions.
// Phase 1: matrix 124 rows 111 cols
[2023-03-18 23:04:42] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 224355 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103073 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103734 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 2) seen :0
[2023-03-18 23:04:44] [INFO ] Invariant cache hit.
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-18 23:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-18 23:04:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 23:04:44] [INFO ] [Nat]Added 47 Read/Feed constraints in 17 ms returned sat
[2023-03-18 23:04:44] [INFO ] Computed and/alt/rep : 30/77/30 causal constraints (skipped 93 transitions) in 8 ms.
[2023-03-18 23:04:44] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-18 23:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-18 23:04:44] [INFO ] Added : 20 causal constraints over 4 iterations in 174 ms. Result :sat
Minimization took 49 ms.
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:44] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-18 23:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:44] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-18 23:04:44] [INFO ] [Nat]Added 47 Read/Feed constraints in 13 ms returned sat
[2023-03-18 23:04:45] [INFO ] Computed and/alt/rep : 30/77/30 causal constraints (skipped 93 transitions) in 9 ms.
[2023-03-18 23:04:45] [INFO ] Added : 13 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1, 6] Max seen :[0, 0]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/111 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2023-03-18 23:04:45] [INFO ] Invariant cache hit.
[2023-03-18 23:04:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 23:04:45] [INFO ] Invariant cache hit.
[2023-03-18 23:04:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 23:04:45] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-18 23:04:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:04:45] [INFO ] Invariant cache hit.
[2023-03-18 23:04:45] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 111/111 places, 124/124 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-05
[2023-03-18 23:04:45] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1016 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-18 23:04:45] [INFO ] Invariant cache hit.
[2023-03-18 23:04:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:04:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:45] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 23:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:04:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-18 23:04:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 23:04:45] [INFO ] [Nat]Added 47 Read/Feed constraints in 13 ms returned sat
[2023-03-18 23:04:45] [INFO ] Computed and/alt/rep : 30/77/30 causal constraints (skipped 93 transitions) in 8 ms.
[2023-03-18 23:04:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-18 23:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-18 23:04:46] [INFO ] Added : 20 causal constraints over 4 iterations in 149 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [102] Max seen :[0]
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 108 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 108 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 107 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 107 transition count 119
Applied a total of 9 rules in 22 ms. Remains 107 /111 variables (removed 4) and now considering 119/124 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 107/111 places, 119/124 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-18 23:04:46] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224286 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103286 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :0
[2023-03-18 23:04:47] [INFO ] Invariant cache hit.
[2023-03-18 23:04:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-18 23:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:47] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-18 23:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:04:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-18 23:04:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:04:47] [INFO ] [Nat]Added 44 Read/Feed constraints in 12 ms returned sat
[2023-03-18 23:04:47] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-18 23:04:47] [INFO ] Added : 19 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [96] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:04:47] [INFO ] Invariant cache hit.
[2023-03-18 23:04:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 23:04:48] [INFO ] Invariant cache hit.
[2023-03-18 23:04:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:04:48] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-18 23:04:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:04:48] [INFO ] Invariant cache hit.
[2023-03-18 23:04:48] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 in 2788 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
// Phase 1: matrix 124 rows 111 cols
[2023-03-18 23:04:48] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-18 23:04:48] [INFO ] Invariant cache hit.
[2023-03-18 23:04:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:48] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-18 23:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:04:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:48] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 23:04:48] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 23:04:48] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
[2023-03-18 23:04:48] [INFO ] Computed and/alt/rep : 30/77/30 causal constraints (skipped 93 transitions) in 7 ms.
[2023-03-18 23:04:48] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 109 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 108 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 108 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 107 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 106 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 105 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 105 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 104 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 103 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 103 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 102 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 101 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 101 transition count 110
Applied a total of 21 rules in 19 ms. Remains 101 /111 variables (removed 10) and now considering 110/124 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 101/111 places, 110/124 transitions.
// Phase 1: matrix 110 rows 101 cols
[2023-03-18 23:04:48] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224755 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103576 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :0
[2023-03-18 23:04:49] [INFO ] Invariant cache hit.
[2023-03-18 23:04:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-18 23:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:04:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:04:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:04:50] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-18 23:04:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 23:04:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2023-03-18 23:04:50] [INFO ] Computed and/alt/rep : 26/68/26 causal constraints (skipped 83 transitions) in 5 ms.
[2023-03-18 23:04:50] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-18 23:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-18 23:04:50] [INFO ] Added : 15 causal constraints over 4 iterations in 152 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-18 23:04:50] [INFO ] Invariant cache hit.
[2023-03-18 23:04:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 23:04:50] [INFO ] Invariant cache hit.
[2023-03-18 23:04:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 23:04:50] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-18 23:04:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:04:50] [INFO ] Invariant cache hit.
[2023-03-18 23:04:50] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 101/101 places, 110/110 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 2402 ms.
[2023-03-18 23:04:51] [INFO ] Flatten gal took : 54 ms
[2023-03-18 23:04:51] [INFO ] Applying decomposition
[2023-03-18 23:04:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5769729301266922128.txt' '-o' '/tmp/graph5769729301266922128.bin' '-w' '/tmp/graph5769729301266922128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5769729301266922128.bin' '-l' '-1' '-v' '-w' '/tmp/graph5769729301266922128.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:04:51] [INFO ] Decomposing Gal with order
[2023-03-18 23:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:04:51] [INFO ] Removed a total of 112 redundant transitions.
[2023-03-18 23:04:51] [INFO ] Flatten gal took : 54 ms
[2023-03-18 23:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 8 ms.
[2023-03-18 23:04:51] [INFO ] Time to serialize gal into /tmp/UpperBounds17974293630310537247.gal : 5 ms
[2023-03-18 23:04:51] [INFO ] Time to serialize properties into /tmp/UpperBounds16230717110571692285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17974293630310537247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16230717110571692285.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds16230717110571692285.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,90562,0.544912,21752,877,528,27439,8188,367,60513,129,48040,0
Total reachable state count : 90562

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 :0 <= i5.u13.p57 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-05,0,0.565536,21752,1,0,27439,8188,490,60513,155,48040,723
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 :0 <= i9.u21.l1698 <= 2
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-14,0,0.567438,21752,1,0,27439,8188,522,60513,163,48040,989
Total runtime 22067 ms.

BK_STOP 1679180693114

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975300461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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