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.r121-tall-167814499400257.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DES-PT-10a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678393299830

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:21:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:21:41] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-09 20:21:41] [INFO ] Transformed 155 places.
[2023-03-09 20:21:41] [INFO ] Transformed 112 transitions.
[2023-03-09 20:21:41] [INFO ] Found NUPN structural information;
[2023-03-09 20:21:41] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 117 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 155/155 places, 112/112 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 155 transition count 98
Applied a total of 14 rules in 16 ms. Remains 155 /155 variables (removed 0) and now considering 98/112 (removed 14) transitions.
// Phase 1: matrix 98 rows 155 cols
[2023-03-09 20:21:41] [INFO ] Computed 59 place invariants in 21 ms
[2023-03-09 20:21:41] [INFO ] Implicit Places using invariants in 293 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 154/155 places, 98/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 339 ms. Remains : 154/155 places, 98/112 transitions.
Discarding 9 transitions out of 98. Remains 89
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 88) seen :62
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 98 rows 154 cols
[2023-03-09 20:21:42] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-09 20:21:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-09 20:21:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-09 20:21:42] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-09 20:21:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-09 20:21:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-09 20:21:43] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-09 20:21:44] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 7 ms to minimize.
[2023-03-09 20:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 20:21:44] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-09 20:21:44] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-09 20:21:44] [INFO ] After 2115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 22 properties in 15781 ms.
Support contains 7 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 98/98 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 153 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 153 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 153 transition count 95
Applied a total of 9 rules in 35 ms. Remains 153 /154 variables (removed 1) and now considering 95/98 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 153/154 places, 95/98 transitions.
Incomplete random walk after 1000000 steps, including 13443 resets, run finished after 14298 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2263 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 2434 ms. (steps per millisecond=410 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7282 resets, run finished after 3724 ms. (steps per millisecond=268 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7299 resets, run finished after 3869 ms. (steps per millisecond=258 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 28882950 steps, run timeout after 78001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 28882950 steps, saw 3469223 distinct states, run finished after 78012 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-09 20:23:45] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:23:45] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:23:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:23:45] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 20:23:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:45] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 20:23:45] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 20:23:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:23:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:23:45] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 20:23:45] [INFO ] After 42ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 20:23:46] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 20:23:46] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 764 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 13 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-09 20:23:46] [INFO ] Invariant cache hit.
[2023-03-09 20:23:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 20:23:46] [INFO ] Invariant cache hit.
[2023-03-09 20:23:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:47] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-09 20:23:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:23:47] [INFO ] Invariant cache hit.
[2023-03-09 20:23:47] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 153/153 places, 95/95 transitions.
Incomplete random walk after 100000 steps, including 1341 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-09 20:23:47] [INFO ] Invariant cache hit.
[2023-03-09 20:23:47] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:23:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:23:47] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:23:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:47] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:23:47] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2023-03-09 20:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 20:23:47] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:23:47] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:23:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:23:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2023-03-09 20:23:47] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:47] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:47] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 20:23:47] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 13434 resets, run finished after 2074 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7268 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4169587 steps, run timeout after 6001 ms. (steps per millisecond=694 ) properties seen :{}
Probabilistic random walk after 4169587 steps, saw 560945 distinct states, run finished after 6001 ms. (steps per millisecond=694 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:23:56] [INFO ] Invariant cache hit.
[2023-03-09 20:23:56] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:23:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:23:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:23:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-09 20:23:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-09 20:23:57] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:57] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:57] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:23:57] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 113 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-09 20:23:57] [INFO ] Invariant cache hit.
[2023-03-09 20:23:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 20:23:57] [INFO ] Invariant cache hit.
[2023-03-09 20:23:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-09 20:23:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:23:57] [INFO ] Invariant cache hit.
[2023-03-09 20:23:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 153/153 places, 95/95 transitions.
Incomplete random walk after 100000 steps, including 1315 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-09 20:23:57] [INFO ] Invariant cache hit.
[2023-03-09 20:23:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:23:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:23:57] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:23:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:57] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:23:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-09 20:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 20:23:57] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:23:57] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:23:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:23:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-09 20:23:58] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:58] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:23:58] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 20:23:58] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2092009 steps, run timeout after 3001 ms. (steps per millisecond=697 ) properties seen :{}
Probabilistic random walk after 2092009 steps, saw 294086 distinct states, run finished after 3001 ms. (steps per millisecond=697 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:24:01] [INFO ] Invariant cache hit.
[2023-03-09 20:24:01] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 20:24:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:24:01] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:24:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:24:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-09 20:24:01] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:24:01] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:01] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 20:24:01] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 10 ms. Remains 152 /153 variables (removed 1) and now considering 94/95 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 152/153 places, 94/95 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2071265 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :{}
Probabilistic random walk after 2071265 steps, saw 291212 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-09 20:24:04] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 20:24:04] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:24:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:24:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:24:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 20:24:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2023-03-09 20:24:04] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:24:04] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:04] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 20:24:04] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-09 20:24:04] [INFO ] Invariant cache hit.
[2023-03-09 20:24:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 20:24:04] [INFO ] Invariant cache hit.
[2023-03-09 20:24:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:24:04] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-09 20:24:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:24:04] [INFO ] Invariant cache hit.
[2023-03-09 20:24:04] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-09 20:24:04] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 20:24:05] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:24:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:24:05] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:24:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:24:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-09 20:24:05] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:05] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:24:05] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-09 20:24:05] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 20:24:05] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:24:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:24:05] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:24:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:24:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-09 20:24:05] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:24:05] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:24:05] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 144251 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 10a
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 155 places, 112 transitions, 552 arcs.
(potential((tk(P62)>=1) & (tk(P60)>=1)))
(potential((tk(P128)>=1) & (tk(P124)>=1) & (tk(P120)>=1) & (tk(P116)>=1) & (tk(P114)>=1) & (tk(P118)>=1) & (tk(P122)>=1) & (tk(P126)>=1)))
(potential((tk(P132)>=1) & (tk(P130)>=1)))
(potential((tk(P141)>=1) & (tk(P139)>=1)))
(potential((tk(P145)>=1) & (tk(P143)>=1)))
(potential((tk(P155)>=1) & (tk(P153)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P66)>=1) & (tk(P64)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P3)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P4)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P5)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P6)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P7)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P8)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P9)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P10)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P11)>=1)))
(potential((tk(P74)>=1) & (tk(P76)>=1) & (tk(P2)>=1)))
(potential((tk(P13)>=1) & (tk(P151)>=1)))
(potential((tk(P14)>=1) & (tk(P151)>=1)))
(potential((tk(P15)>=1) & (tk(P151)>=1)))
(potential((tk(P16)>=1) & (tk(P151)>=1)))
(potential((tk(P17)>=1) & (tk(P151)>=1)))
(potential((tk(P18)>=1) & (tk(P151)>=1)))
(potential((tk(P19)>=1) & (tk(P151)>=1)))
(potential((tk(P20)>=1) & (tk(P151)>=1)))
(potential((tk(P21)>=1) & (tk(P151)>=1)))
(potential((tk(P12)>=1) & (tk(P151)>=1)))
(potential((tk(P33)>=1) & (tk(P46)>=1)))
(potential((tk(P34)>=1) & (tk(P46)>=1)))
(potential((tk(P35)>=1) & (tk(P46)>=1)))
(potential((tk(P36)>=1) & (tk(P46)>=1)))
(potential((tk(P37)>=1) & (tk(P46)>=1)))
(potential((tk(P38)>=1) & (tk(P46)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1) & (tk(P46)>=1)))
(potential((tk(P41)>=1) & (tk(P46)>=1)))
(potential((tk(P32)>=1) & (tk(P46)>=1)))
(potential((tk(P22)>=1) & (tk(P71)>=1)))
(potential((tk(P31)>=1) & (tk(P71)>=1)))
(potential((tk(P30)>=1) & (tk(P71)>=1)))
(potential((tk(P29)>=1) & (tk(P71)>=1)))
(potential((tk(P28)>=1) & (tk(P71)>=1)))
(potential((tk(P27)>=1) & (tk(P71)>=1)))
(potential((tk(P26)>=1) & (tk(P71)>=1)))
(potential((tk(P25)>=1) & (tk(P71)>=1)))
(potential((tk(P24)>=1) & (tk(P71)>=1)))
(potential((tk(P23)>=1) & (tk(P71)>=1)))
(potential((tk(P47)>=1) & (tk(P69)>=1)))
(potential((tk(P47)>=1) & (tk(P69)>=1)))
(potential((tk(P47)>=1) & (tk(P69)>=1)))
(potential((tk(P47)>=1) & (tk(P69)>=1)))
(potential((tk(P47)>=1) & (tk(P69)>=1)))
(potential((tk(P43)>=1) & (tk(P56)>=1)))
(potential((tk(P43)>=1) & (tk(P56)>=1)))
(potential((tk(P45)>=1) & (tk(P65)>=1)))
(potential((tk(P45)>=1) & (tk(P65)>=1)))
(potential((tk(P50)>=1) & (tk(P135)>=1)))
(potential((tk(P50)>=1) & (tk(P135)>=1)))
(potential((tk(P50)>=1) & (tk(P135)>=1)))
(potential((tk(P55)>=1) & (tk(P129)>=1)))
(potential((tk(P52)>=1) & (tk(P146)>=1)))
(potential((tk(P52)>=1) & (tk(P146)>=1)))
(potential((tk(P52)>=1) & (tk(P146)>=1)))
(potential((tk(P75)>=1) & (tk(P147)>=1)))
(potential((tk(P73)>=1) & (tk(P136)>=1)))
(potential((tk(P150)>=1) & (tk(P154)>=1)))
(potential((tk(P137)>=1) & (tk(P152)>=1)))
(potential((tk(P137)>=1) & (tk(P78)>=1) & (tk(P80)>=1)))
(potential((tk(P133)>=1) & (tk(P138)>=1)))
(potential((tk(P137)>=1) & (tk(P78)>=1) & (tk(P80)>=1)))
(potential((tk(P133)>=1) & (tk(P142)>=1)))
(potential((tk(P94)>=1) & (tk(P90)>=1) & (tk(P86)>=1) & (tk(P82)>=1) & (tk(P84)>=1) & (tk(P88)>=1) & (tk(P92)>=1) & (tk(P96)>=1) & (tk(P77)>=1)))
(potential((tk(P79)>=1) & (tk(P149)>=1)))
(potential((tk(P150)>=1) & (tk(P140)>=1)))
(potential((tk(P150)>=1) & (tk(P144)>=1)))
(potential((tk(P79)>=1) & (tk(P148)>=1)))
(potential((tk(P150)>=1) & (tk(P140)>=1)))
(potential((tk(P150)>=1) & (tk(P144)>=1)))
(potential((tk(P111)>=1) & (tk(P127)>=1)))
(potential((tk(P107)>=1) & (tk(P123)>=1)))
(potential((tk(P103)>=1) & (tk(P119)>=1)))
(potential((tk(P99)>=1) & (tk(P115)>=1)))
(potential((tk(P97)>=1) & (tk(P113)>=1)))
(potential((tk(P101)>=1) & (tk(P117)>=1)))
(potential((tk(P105)>=1) & (tk(P121)>=1)))
(potential((tk(P109)>=1) & (tk(P125)>=1)))
(potential((tk(P93)>=1) & (tk(P110)>=1)))
(potential((tk(P89)>=1) & (tk(P106)>=1)))
(potential((tk(P85)>=1) & (tk(P102)>=1)))
(potential((tk(P81)>=1) & (tk(P98)>=1)))
(potential((tk(P83)>=1) & (tk(P100)>=1)))
(potential((tk(P87)>=1) & (tk(P104)>=1)))
(potential((tk(P91)>=1) & (tk(P108)>=1)))
(potential((tk(P95)>=1) & (tk(P112)>=1)))
(potential((tk(P131)>=1) & (tk(P134)>=1)))
(potential((tk(P66)>=1) & (tk(P64)>=1) & (tk(P54)>=1)))
(potential((tk(P54)>=1) & (tk(P61)>=1)))
(potential((tk(P58)>=1) & (tk(P72)>=1)))
(potential((tk(P58)>=1) & (tk(P59)>=1)))
(potential((tk(P70)>=1) & (tk(P68)>=1) & (tk(P63)>=1)))
(potential((tk(P70)>=1) & (tk(P68)>=1) & (tk(P63)>=1)))
(potential((tk(P70)>=1) & (tk(P68)>=1) & (tk(P63)>=1)))
(potential((tk(P70)>=1) & (tk(P68)>=1) & (tk(P63)>=1)))
(potential((tk(P70)>=1) & (tk(P68)>=1) & (tk(P63)>=1)))
(potential((tk(P57)>=1) & (tk(P67)>=1)))
(potential((tk(P66)>=1) & (tk(P64)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P51)>=1) & (tk(P48)>=1) & (tk(P42)>=1) & (tk(P44)>=1) & (tk(P49)>=1) & (tk(P53)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 12674280 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16125648 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 QuasiLiveness -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="DES-PT-10a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DES-PT-10a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-167814499400257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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