fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978700282
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10241.056 873842.00 913368.00 284.60 ??????T???????T? normal

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.r426-tajo-167905978700282.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 marciexred
Input is ShieldRVt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 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.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 239K 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 ShieldRVt-PT-020B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679347873293

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:31:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:31:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:31:15] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-20 21:31:15] [INFO ] Transformed 1003 places.
[2023-03-20 21:31:15] [INFO ] Transformed 1003 transitions.
[2023-03-20 21:31:15] [INFO ] Found NUPN structural information;
[2023-03-20 21:31:15] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 89 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 204 places :
Symmetric choice reduction at 0 with 204 rule applications. Total rules 204 place count 799 transition count 799
Iterating global reduction 0 with 204 rules applied. Total rules applied 408 place count 799 transition count 799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 409 place count 798 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 410 place count 798 transition count 798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 411 place count 797 transition count 797
Iterating global reduction 0 with 1 rules applied. Total rules applied 412 place count 797 transition count 797
Applied a total of 412 rules in 186 ms. Remains 797 /1003 variables (removed 206) and now considering 797/1003 (removed 206) transitions.
// Phase 1: matrix 797 rows 797 cols
[2023-03-20 21:31:15] [INFO ] Computed 81 place invariants in 26 ms
[2023-03-20 21:31:15] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-20 21:31:15] [INFO ] Invariant cache hit.
[2023-03-20 21:31:16] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-20 21:31:16] [INFO ] Invariant cache hit.
[2023-03-20 21:31:16] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/1003 places, 797/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1566 ms. Remains : 797/1003 places, 797/1003 transitions.
Support contains 89 out of 797 places after structural reductions.
[2023-03-20 21:31:17] [INFO ] Flatten gal took : 147 ms
[2023-03-20 21:31:17] [INFO ] Flatten gal took : 65 ms
[2023-03-20 21:31:17] [INFO ] Input system was already deterministic with 797 transitions.
Support contains 82 out of 797 places (down from 89) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 59) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-20 21:31:18] [INFO ] Invariant cache hit.
[2023-03-20 21:31:19] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-20 21:31:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 38 ms returned sat
[2023-03-20 21:31:20] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-20 21:31:21] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 20 ms to minimize.
[2023-03-20 21:31:21] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2023-03-20 21:31:21] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 1 ms to minimize.
[2023-03-20 21:31:21] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 14 ms to minimize.
[2023-03-20 21:31:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1179 ms
[2023-03-20 21:31:22] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 8 ms to minimize.
[2023-03-20 21:31:22] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2023-03-20 21:31:22] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-03-20 21:31:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 672 ms
[2023-03-20 21:31:23] [INFO ] Deduced a trap composed of 52 places in 338 ms of which 2 ms to minimize.
[2023-03-20 21:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-20 21:31:23] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 1 ms to minimize.
[2023-03-20 21:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-20 21:31:24] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:31:24] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2023-03-20 21:31:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 543 ms
[2023-03-20 21:31:24] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 0 ms to minimize.
[2023-03-20 21:31:24] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2023-03-20 21:31:25] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 1 ms to minimize.
[2023-03-20 21:31:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 633 ms
[2023-03-20 21:31:25] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 2 ms to minimize.
[2023-03-20 21:31:25] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-20 21:31:25] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 0 ms to minimize.
[2023-03-20 21:31:26] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2023-03-20 21:31:26] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2023-03-20 21:31:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1073 ms
[2023-03-20 21:31:26] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 0 ms to minimize.
[2023-03-20 21:31:26] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 0 ms to minimize.
[2023-03-20 21:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-20 21:31:27] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2023-03-20 21:31:27] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 0 ms to minimize.
[2023-03-20 21:31:27] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:31:27] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 0 ms to minimize.
[2023-03-20 21:31:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2023-03-20 21:31:27] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 0 ms to minimize.
[2023-03-20 21:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-20 21:31:28] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2023-03-20 21:31:28] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-20 21:31:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2023-03-20 21:31:28] [INFO ] After 9139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 802 ms.
[2023-03-20 21:31:29] [INFO ] After 10521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 1 properties in 444 ms.
Support contains 33 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 797/797 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 797 transition count 597
Reduce places removed 200 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 205 rules applied. Total rules applied 405 place count 597 transition count 592
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 410 place count 592 transition count 592
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 144 Pre rules applied. Total rules applied 410 place count 592 transition count 448
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 698 place count 448 transition count 448
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 703 place count 443 transition count 443
Iterating global reduction 3 with 5 rules applied. Total rules applied 708 place count 443 transition count 443
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 708 place count 443 transition count 440
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 714 place count 440 transition count 440
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1068 place count 263 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1069 place count 263 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1071 place count 262 transition count 261
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1165 place count 215 transition count 296
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1167 place count 215 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1169 place count 213 transition count 294
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1170 place count 213 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1171 place count 212 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1172 place count 211 transition count 292
Applied a total of 1172 rules in 184 ms. Remains 211 /797 variables (removed 586) and now considering 292/797 (removed 505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 211/797 places, 292/797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 292 rows 211 cols
[2023-03-20 21:31:31] [INFO ] Computed 80 place invariants in 3 ms
[2023-03-20 21:31:31] [INFO ] [Real]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-20 21:31:31] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 21:31:31] [INFO ] [Nat]Absence check using 80 positive place invariants in 12 ms returned sat
[2023-03-20 21:31:31] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 21:31:31] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-20 21:31:32] [INFO ] After 253ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 21:31:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-20 21:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-20 21:31:32] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-20 21:31:32] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 2 properties in 201 ms.
Support contains 19 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 292/292 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 288
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 207 transition count 288
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 207 transition count 280
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 199 transition count 280
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 195 transition count 276
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 190 transition count 285
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 190 transition count 284
Applied a total of 43 rules in 26 ms. Remains 190 /211 variables (removed 21) and now considering 284/292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 190/211 places, 284/292 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 284 rows 190 cols
[2023-03-20 21:31:33] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-20 21:31:33] [INFO ] [Real]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-20 21:31:33] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:31:33] [INFO ] [Nat]Absence check using 80 positive place invariants in 16 ms returned sat
[2023-03-20 21:31:33] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:31:33] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-20 21:31:34] [INFO ] After 447ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 21:31:34] [INFO ] After 907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-20 21:31:35] [INFO ] After 1408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 62 ms.
Support contains 17 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 284/284 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 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 189 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 188 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 187 transition count 284
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 187 transition count 283
Applied a total of 7 rules in 31 ms. Remains 187 /190 variables (removed 3) and now considering 283/284 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 187/190 places, 283/284 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 225 ms. (steps per millisecond=44 ) 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 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
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 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 270258 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{0=1, 2=1, 3=1, 6=1}
Probabilistic random walk after 270258 steps, saw 169516 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 283 rows 187 cols
[2023-03-20 21:31:38] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-20 21:31:38] [INFO ] [Real]Absence check using 80 positive place invariants in 8 ms returned sat
[2023-03-20 21:31:38] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:31:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-20 21:31:39] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:39] [INFO ] State equation strengthened by 131 read => feed constraints.
[2023-03-20 21:31:39] [INFO ] After 143ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-20 21:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-20 21:31:39] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-20 21:31:39] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 12 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 283/283 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 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 186 transition count 282
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 186 transition count 278
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 182 transition count 278
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 180 transition count 282
Applied a total of 14 rules in 34 ms. Remains 180 /187 variables (removed 7) and now considering 282/283 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 180/187 places, 282/283 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 416199 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416199 steps, saw 112566 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 282 rows 180 cols
[2023-03-20 21:31:42] [INFO ] Computed 80 place invariants in 3 ms
[2023-03-20 21:31:43] [INFO ] [Real]Absence check using 80 positive place invariants in 20 ms returned sat
[2023-03-20 21:31:43] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:31:43] [INFO ] [Nat]Absence check using 80 positive place invariants in 15 ms returned sat
[2023-03-20 21:31:43] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:43] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-20 21:31:44] [INFO ] After 990ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2023-03-20 21:31:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-20 21:31:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-20 21:31:45] [INFO ] After 1656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1393 ms.
[2023-03-20 21:31:46] [INFO ] After 3237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 12 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 282/282 transitions.
Applied a total of 0 rules in 16 ms. Remains 180 /180 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 180/180 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 282/282 transitions.
Applied a total of 0 rules in 14 ms. Remains 180 /180 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 21:31:46] [INFO ] Invariant cache hit.
[2023-03-20 21:31:46] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-20 21:31:46] [INFO ] Invariant cache hit.
[2023-03-20 21:31:46] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-20 21:31:47] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-20 21:31:47] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-20 21:31:47] [INFO ] Invariant cache hit.
[2023-03-20 21:31:47] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 783 ms. Remains : 180/180 places, 282/282 transitions.
Graph (trivial) has 70 edges and 180 vertex of which 4 / 180 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 637 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 67 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 173 transition count 273
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 66 edges and 172 vertex of which 2 / 172 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 171 transition count 268
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 65 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 169 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 25 place count 168 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 168 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 167 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 30 place count 165 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 34 place count 165 transition count 255
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 39 place count 165 transition count 250
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 53 place count 165 transition count 250
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 66 place count 165 transition count 237
Applied a total of 66 rules in 36 ms. Remains 165 /180 variables (removed 15) and now considering 237/282 (removed 45) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 237 rows 165 cols
[2023-03-20 21:31:47] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-20 21:31:47] [INFO ] [Real]Absence check using 73 positive place invariants in 10 ms returned sat
[2023-03-20 21:31:47] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:31:47] [INFO ] [Nat]Absence check using 73 positive place invariants in 9 ms returned sat
[2023-03-20 21:31:47] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 21:31:47] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-20 21:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-20 21:31:47] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 21:31:47] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:31:47] [INFO ] Flatten gal took : 30 ms
[2023-03-20 21:31:47] [INFO ] Flatten gal took : 27 ms
[2023-03-20 21:31:47] [INFO ] Input system was already deterministic with 797 transitions.
Computed a total of 242 stabilizing places and 242 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 796 transition count 574
Reduce places removed 222 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 574 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 573 transition count 573
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 446 place count 573 transition count 423
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 746 place count 423 transition count 423
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 755 place count 414 transition count 414
Iterating global reduction 3 with 9 rules applied. Total rules applied 764 place count 414 transition count 414
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 764 place count 414 transition count 407
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 778 place count 407 transition count 407
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 1100 place count 246 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1101 place count 246 transition count 245
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1103 place count 245 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1105 place count 243 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1106 place count 242 transition count 242
Applied a total of 1106 rules in 75 ms. Remains 242 /797 variables (removed 555) and now considering 242/797 (removed 555) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 242/797 places, 242/797 transitions.
[2023-03-20 21:31:47] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:31:47] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:31:47] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 785 transition count 785
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 785 transition count 785
Applied a total of 24 rules in 36 ms. Remains 785 /797 variables (removed 12) and now considering 785/797 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 785/797 places, 785/797 transitions.
[2023-03-20 21:31:47] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 36 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 21 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 784 transition count 784
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 784 transition count 784
Applied a total of 26 rules in 37 ms. Remains 784 /797 variables (removed 13) and now considering 784/797 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 784/797 places, 784/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 43 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 17 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 17 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 37 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 796 transition count 571
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 1 with 225 rules applied. Total rules applied 450 place count 571 transition count 571
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 450 place count 571 transition count 423
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 746 place count 423 transition count 423
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 756 place count 413 transition count 413
Iterating global reduction 2 with 10 rules applied. Total rules applied 766 place count 413 transition count 413
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 766 place count 413 transition count 405
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 782 place count 405 transition count 405
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1102 place count 245 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1103 place count 245 transition count 244
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1105 place count 244 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1107 place count 242 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1108 place count 241 transition count 241
Applied a total of 1108 rules in 53 ms. Remains 241 /797 variables (removed 556) and now considering 241/797 (removed 556) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 241/797 places, 241/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 241 transitions.
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
FORMULA ShieldRVt-PT-020B-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 36 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 36 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 782 transition count 782
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 782 transition count 782
Applied a total of 30 rules in 35 ms. Remains 782 /797 variables (removed 15) and now considering 782/797 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 782/797 places, 782/797 transitions.
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:48] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:48] [INFO ] Input system was already deterministic with 782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 783 transition count 783
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 783 transition count 783
Applied a total of 28 rules in 35 ms. Remains 783 /797 variables (removed 14) and now considering 783/797 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 783/797 places, 783/797 transitions.
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:31:49] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 43 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:31:49] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 36 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:31:49] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 40 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:31:49] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 796 transition count 570
Reduce places removed 226 places and 0 transitions.
Iterating post reduction 1 with 226 rules applied. Total rules applied 452 place count 570 transition count 570
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 452 place count 570 transition count 421
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 750 place count 421 transition count 421
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 759 place count 412 transition count 412
Iterating global reduction 2 with 9 rules applied. Total rules applied 768 place count 412 transition count 412
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 768 place count 412 transition count 405
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 782 place count 405 transition count 405
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 1104 place count 244 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1105 place count 244 transition count 243
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1107 place count 243 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1109 place count 241 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1110 place count 240 transition count 240
Applied a total of 1110 rules in 53 ms. Remains 240 /797 variables (removed 557) and now considering 240/797 (removed 557) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 240/797 places, 240/797 transitions.
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:31:49] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:31:49] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 852959 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 852959 steps, saw 728011 distinct states, run finished after 3002 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 240 rows 240 cols
[2023-03-20 21:31:52] [INFO ] Computed 80 place invariants in 4 ms
[2023-03-20 21:31:52] [INFO ] [Real]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-20 21:31:52] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:31:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-20 21:31:52] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:31:52] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 21:31:52] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
FORMULA ShieldRVt-PT-020B-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 797/797 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 781 transition count 781
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 781 transition count 781
Applied a total of 32 rules in 51 ms. Remains 781 /797 variables (removed 16) and now considering 781/797 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 781/797 places, 781/797 transitions.
[2023-03-20 21:31:52] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:31:52] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:31:53] [INFO ] Input system was already deterministic with 781 transitions.
[2023-03-20 21:31:53] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:31:53] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:31:53] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 21:31:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 797 places, 797 transitions and 1954 arcs took 5 ms.
Total runtime 38096 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 797 NrTr: 797 NrArc: 1954)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.048sec

net check time: 0m 0.000sec

init dd package: 0m 3.378sec


before gc: list nodes free: 1574814

after gc: idd nodes used:44173168, unused:19826832; list nodes free:92719783

RS generation: 13m13.950sec


-> last computed set: #nodes 44172373 (4.4e+07) #states 21,112,056,059,203,097,589,259 (22)


CANNOT_COMPUTE


BK_STOP 1679348747135

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.014sec

idd.cc:820: DD Exception: No free nodes

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldRVt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978700282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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