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.r394-oct2-167903717700282.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679500798201

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=ShieldIIPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:00:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:00:00] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-22 16:00:00] [INFO ] Transformed 1403 places.
[2023-03-22 16:00:00] [INFO ] Transformed 1303 transitions.
[2023-03-22 16:00:00] [INFO ] Found NUPN structural information;
[2023-03-22 16:00:00] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 137 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 186 places :
Symmetric choice reduction at 0 with 186 rule applications. Total rules 186 place count 1217 transition count 1117
Iterating global reduction 0 with 186 rules applied. Total rules applied 372 place count 1217 transition count 1117
Applied a total of 372 rules in 266 ms. Remains 1217 /1403 variables (removed 186) and now considering 1117/1303 (removed 186) transitions.
// Phase 1: matrix 1117 rows 1217 cols
[2023-03-22 16:00:01] [INFO ] Computed 181 place invariants in 27 ms
[2023-03-22 16:00:02] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-22 16:00:02] [INFO ] Invariant cache hit.
[2023-03-22 16:00:04] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2023-03-22 16:00:04] [INFO ] Invariant cache hit.
[2023-03-22 16:00:04] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1217/1403 places, 1117/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3801 ms. Remains : 1217/1403 places, 1117/1303 transitions.
Support contains 137 out of 1217 places after structural reductions.
[2023-03-22 16:00:05] [INFO ] Flatten gal took : 123 ms
[2023-03-22 16:00:05] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:00:05] [INFO ] Input system was already deterministic with 1117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 84) seen :54
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-22 16:00:06] [INFO ] Invariant cache hit.
[2023-03-22 16:00:07] [INFO ] [Real]Absence check using 181 positive place invariants in 105 ms returned sat
[2023-03-22 16:00:07] [INFO ] After 1008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-22 16:00:08] [INFO ] [Nat]Absence check using 181 positive place invariants in 139 ms returned sat
[2023-03-22 16:00:12] [INFO ] After 2804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-22 16:00:13] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 8 ms to minimize.
[2023-03-22 16:00:13] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 3 ms to minimize.
[2023-03-22 16:00:14] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2023-03-22 16:00:14] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2023-03-22 16:00:14] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2023-03-22 16:00:14] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 1 ms to minimize.
[2023-03-22 16:00:15] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 0 ms to minimize.
[2023-03-22 16:00:15] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 0 ms to minimize.
[2023-03-22 16:00:15] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2023-03-22 16:00:16] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2023-03-22 16:00:16] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-22 16:00:16] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 1 ms to minimize.
[2023-03-22 16:00:16] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2023-03-22 16:00:17] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 0 ms to minimize.
[2023-03-22 16:00:17] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2023-03-22 16:00:17] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 1 ms to minimize.
[2023-03-22 16:00:17] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2023-03-22 16:00:18] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2023-03-22 16:00:18] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2023-03-22 16:00:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5772 ms
[2023-03-22 16:00:18] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 1 ms to minimize.
[2023-03-22 16:00:19] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-22 16:00:19] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2023-03-22 16:00:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 893 ms
[2023-03-22 16:00:20] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-22 16:00:20] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2023-03-22 16:00:20] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2023-03-22 16:00:20] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2023-03-22 16:00:21] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 0 ms to minimize.
[2023-03-22 16:00:21] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-22 16:00:21] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2023-03-22 16:00:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1964 ms
[2023-03-22 16:00:22] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 0 ms to minimize.
[2023-03-22 16:00:22] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 1 ms to minimize.
[2023-03-22 16:00:23] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-22 16:00:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
[2023-03-22 16:00:24] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 0 ms to minimize.
[2023-03-22 16:00:24] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2023-03-22 16:00:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-22 16:00:24] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-22 16:00:25] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2023-03-22 16:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 605 ms
[2023-03-22 16:00:25] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2023-03-22 16:00:25] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 1 ms to minimize.
[2023-03-22 16:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2023-03-22 16:00:26] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2023-03-22 16:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-22 16:00:26] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2023-03-22 16:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-22 16:00:27] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2023-03-22 16:00:27] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2023-03-22 16:00:27] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 13 ms to minimize.
[2023-03-22 16:00:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 702 ms
[2023-03-22 16:00:28] [INFO ] After 18316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 2162 ms.
[2023-03-22 16:00:30] [INFO ] After 23201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 1470 ms.
Support contains 49 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 1217 transition count 896
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 444 place count 996 transition count 894
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 454 place count 995 transition count 885
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 463 place count 986 transition count 885
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 139 Pre rules applied. Total rules applied 463 place count 986 transition count 746
Deduced a syphon composed of 139 places in 2 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 4 with 278 rules applied. Total rules applied 741 place count 847 transition count 746
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 758 place count 830 transition count 729
Iterating global reduction 4 with 17 rules applied. Total rules applied 775 place count 830 transition count 729
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 775 place count 830 transition count 717
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 799 place count 818 transition count 717
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 4 with 640 rules applied. Total rules applied 1439 place count 498 transition count 397
Renaming transitions due to excessive name length > 1024 char.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1543 place count 446 transition count 428
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1544 place count 446 transition count 427
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1547 place count 446 transition count 424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1550 place count 443 transition count 424
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 1567 place count 443 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1568 place count 442 transition count 423
Applied a total of 1568 rules in 177 ms. Remains 442 /1217 variables (removed 775) and now considering 423/1117 (removed 694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 442/1217 places, 423/1117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 423 rows 442 cols
[2023-03-22 16:00:32] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-22 16:00:33] [INFO ] [Real]Absence check using 181 positive place invariants in 27 ms returned sat
[2023-03-22 16:00:33] [INFO ] After 490ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:23
[2023-03-22 16:00:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-22 16:00:33] [INFO ] After 78ms SMT Verify possible using 33 Read/Feed constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-22 16:00:33] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-22 16:00:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 68 ms returned sat
[2023-03-22 16:00:35] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-22 16:00:36] [INFO ] After 879ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-22 16:00:36] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-22 16:00:36] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:00:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-03-22 16:00:36] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-22 16:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-22 16:00:36] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-22 16:00:37] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-03-22 16:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-22 16:00:38] [INFO ] After 2966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-03-22 16:00:39] [INFO ] After 5437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 248 ms.
Support contains 44 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 423/423 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 442 transition count 421
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 440 transition count 421
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 0 with 2 rules applied. Total rules applied 6 place count 439 transition count 420
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 0 with 2 rules applied. Total rules applied 8 place count 438 transition count 421
Applied a total of 8 rules in 37 ms. Remains 438 /442 variables (removed 4) and now considering 421/423 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 438/442 places, 421/423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 421 rows 438 cols
[2023-03-22 16:00:39] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-22 16:00:40] [INFO ] [Real]Absence check using 181 positive place invariants in 37 ms returned sat
[2023-03-22 16:00:41] [INFO ] After 791ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:17
[2023-03-22 16:00:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-22 16:00:41] [INFO ] After 93ms SMT Verify possible using 33 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 16:00:41] [INFO ] After 1220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 16:00:41] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2023-03-22 16:00:42] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 16:00:43] [INFO ] After 533ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-22 16:00:43] [INFO ] Deduced a trap composed of 3 places in 468 ms of which 14 ms to minimize.
[2023-03-22 16:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2023-03-22 16:00:44] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 16:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-22 16:00:44] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-22 16:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-22 16:00:44] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-22 16:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-22 16:00:45] [INFO ] After 2532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 662 ms.
[2023-03-22 16:00:45] [INFO ] After 4761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 185 ms.
Support contains 34 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 421/421 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 438 transition count 418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 435 transition count 418
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 435 transition count 415
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 432 transition count 415
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 426 transition count 409
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 26 place count 425 transition count 410
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 423 transition count 408
Applied a total of 28 rules in 42 ms. Remains 423 /438 variables (removed 15) and now considering 408/421 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/438 places, 408/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 408 rows 423 cols
[2023-03-22 16:00:46] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-22 16:00:46] [INFO ] [Real]Absence check using 181 positive place invariants in 64 ms returned sat
[2023-03-22 16:00:47] [INFO ] After 1054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 16:00:48] [INFO ] [Nat]Absence check using 181 positive place invariants in 49 ms returned sat
[2023-03-22 16:00:48] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 16:00:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 16:00:49] [INFO ] After 499ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 16:00:50] [INFO ] After 1337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-22 16:00:50] [INFO ] After 3085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 94 ms.
Support contains 29 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 408/408 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 423 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 422 transition count 407
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 422 transition count 405
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 420 transition count 405
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 418 transition count 403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 417 transition count 402
Applied a total of 11 rules in 25 ms. Remains 417 /423 variables (removed 6) and now considering 402/408 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 417/423 places, 402/408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 136238 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136238 steps, saw 90679 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 402 rows 417 cols
[2023-03-22 16:00:54] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-22 16:00:54] [INFO ] [Real]Absence check using 181 positive place invariants in 22 ms returned sat
[2023-03-22 16:00:54] [INFO ] After 425ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2023-03-22 16:00:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 16:00:54] [INFO ] After 57ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:00:54] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:00:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 74 ms returned sat
[2023-03-22 16:00:56] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 16:00:56] [INFO ] After 457ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 16:00:57] [INFO ] After 1173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-22 16:00:57] [INFO ] After 2739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 215 ms.
Support contains 28 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 402/402 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 416 transition count 401
Applied a total of 2 rules in 11 ms. Remains 416 /417 variables (removed 1) and now considering 401/402 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 416/417 places, 401/402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 122150 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122150 steps, saw 81299 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 401 rows 416 cols
[2023-03-22 16:01:01] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-22 16:01:01] [INFO ] [Real]Absence check using 181 positive place invariants in 29 ms returned sat
[2023-03-22 16:01:02] [INFO ] After 616ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2023-03-22 16:01:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 16:01:02] [INFO ] After 149ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:01:02] [INFO ] After 1144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:01:02] [INFO ] [Nat]Absence check using 181 positive place invariants in 49 ms returned sat
[2023-03-22 16:01:03] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 16:01:03] [INFO ] After 457ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 16:01:04] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2023-03-22 16:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-22 16:01:04] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-22 16:01:05] [INFO ] After 1530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-22 16:01:05] [INFO ] After 3156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 127 ms.
Support contains 28 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 16:01:05] [INFO ] Invariant cache hit.
[2023-03-22 16:01:06] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-22 16:01:06] [INFO ] Invariant cache hit.
[2023-03-22 16:01:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 16:01:06] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-22 16:01:06] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 16:01:06] [INFO ] Invariant cache hit.
[2023-03-22 16:01:06] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 416/416 places, 401/401 transitions.
Graph (complete) has 1057 edges and 416 vertex of which 414 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 414 transition count 400
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 413 transition count 400
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 45 place count 413 transition count 400
Applied a total of 45 rules in 27 ms. Remains 413 /416 variables (removed 3) and now considering 400/401 (removed 1) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 400 rows 413 cols
[2023-03-22 16:01:06] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-22 16:01:07] [INFO ] [Real]Absence check using 179 positive place invariants in 38 ms returned sat
[2023-03-22 16:01:08] [INFO ] After 494ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2023-03-22 16:01:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:01:08] [INFO ] After 82ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:01:08] [INFO ] After 1159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 16:01:08] [INFO ] [Nat]Absence check using 179 positive place invariants in 42 ms returned sat
[2023-03-22 16:01:09] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 16:01:09] [INFO ] After 466ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 16:01:09] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-22 16:01:09] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:01:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2023-03-22 16:01:10] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-22 16:01:11] [INFO ] After 2911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 97 ms
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 49 ms
[2023-03-22 16:01:11] [INFO ] Input system was already deterministic with 1117 transitions.
Computed a total of 330 stabilizing places and 330 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 1216 transition count 868
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 250 rules applied. Total rules applied 498 place count 968 transition count 866
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 500 place count 967 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 501 place count 966 transition count 865
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 144 Pre rules applied. Total rules applied 501 place count 966 transition count 721
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 789 place count 822 transition count 721
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 817 place count 794 transition count 693
Iterating global reduction 4 with 28 rules applied. Total rules applied 845 place count 794 transition count 693
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 845 place count 794 transition count 674
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 883 place count 775 transition count 674
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 4 with 624 rules applied. Total rules applied 1507 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1509 place count 461 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1511 place count 459 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1511 place count 459 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1513 place count 458 transition count 359
Applied a total of 1513 rules in 126 ms. Remains 458 /1217 variables (removed 759) and now considering 359/1117 (removed 758) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 126 ms. Remains : 458/1217 places, 359/1117 transitions.
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 13 ms
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 14 ms
[2023-03-22 16:01:11] [INFO ] Input system was already deterministic with 359 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 130 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 29 ms
[2023-03-22 16:01:11] [INFO ] Flatten gal took : 28 ms
[2023-03-22 16:01:11] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 138 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:01:12] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1186 transition count 1086
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 129 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:01:12] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1185 transition count 1085
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 98 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 55 ms
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 32 ms
[2023-03-22 16:01:12] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1216 transition count 880
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 474 place count 980 transition count 878
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 480 place count 979 transition count 873
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 485 place count 974 transition count 873
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 485 place count 974 transition count 728
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 775 place count 829 transition count 728
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 799 place count 805 transition count 704
Iterating global reduction 4 with 24 rules applied. Total rules applied 823 place count 805 transition count 704
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 823 place count 805 transition count 688
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 855 place count 789 transition count 688
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 4 with 626 rules applied. Total rules applied 1481 place count 476 transition count 375
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1483 place count 474 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1485 place count 472 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1485 place count 472 transition count 372
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1487 place count 471 transition count 372
Applied a total of 1487 rules in 110 ms. Remains 471 /1217 variables (removed 746) and now considering 372/1117 (removed 745) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 471/1217 places, 372/1117 transitions.
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 11 ms
[2023-03-22 16:01:12] [INFO ] Flatten gal took : 10 ms
[2023-03-22 16:01:12] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1190 transition count 1090
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1190 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1189 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1189 transition count 1089
Applied a total of 56 rules in 151 ms. Remains 1189 /1217 variables (removed 28) and now considering 1089/1117 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 1189/1217 places, 1089/1117 transitions.
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:01:13] [INFO ] Input system was already deterministic with 1089 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 124 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:13] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1186 transition count 1086
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 118 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 21 ms
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:13] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 145 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:13] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1184 transition count 1084
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1183 transition count 1083
Applied a total of 68 rules in 170 ms. Remains 1183 /1217 variables (removed 34) and now considering 1083/1117 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 1183/1217 places, 1083/1117 transitions.
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 23 ms
[2023-03-22 16:01:14] [INFO ] Input system was already deterministic with 1083 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1216 transition count 877
Reduce places removed 239 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 977 transition count 875
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 483 place count 976 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 485 place count 974 transition count 873
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 144 Pre rules applied. Total rules applied 485 place count 974 transition count 729
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 773 place count 830 transition count 729
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 799 place count 804 transition count 703
Iterating global reduction 4 with 26 rules applied. Total rules applied 825 place count 804 transition count 703
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 825 place count 804 transition count 684
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 863 place count 785 transition count 684
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 0 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 4 with 628 rules applied. Total rules applied 1491 place count 471 transition count 370
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1495 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1495 place count 467 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1497 place count 466 transition count 367
Applied a total of 1497 rules in 157 ms. Remains 466 /1217 variables (removed 751) and now considering 367/1117 (removed 750) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 157 ms. Remains : 466/1217 places, 367/1117 transitions.
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 9 ms
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-22 16:01:14] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1216 transition count 872
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 246 rules applied. Total rules applied 490 place count 972 transition count 870
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 493 place count 971 transition count 868
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 495 place count 969 transition count 868
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 143 Pre rules applied. Total rules applied 495 place count 969 transition count 725
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 4 with 286 rules applied. Total rules applied 781 place count 826 transition count 725
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 806 place count 801 transition count 700
Iterating global reduction 4 with 25 rules applied. Total rules applied 831 place count 801 transition count 700
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 831 place count 801 transition count 682
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 867 place count 783 transition count 682
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 4 with 624 rules applied. Total rules applied 1491 place count 471 transition count 370
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1495 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1495 place count 467 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1497 place count 466 transition count 367
Applied a total of 1497 rules in 145 ms. Remains 466 /1217 variables (removed 751) and now considering 367/1117 (removed 750) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 466/1217 places, 367/1117 transitions.
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 9 ms
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 9 ms
[2023-03-22 16:01:14] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 136 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 21 ms
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 22 ms
[2023-03-22 16:01:14] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1185 transition count 1085
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1184 transition count 1084
Applied a total of 66 rules in 133 ms. Remains 1184 /1217 variables (removed 33) and now considering 1084/1117 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1184/1217 places, 1084/1117 transitions.
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 20 ms
[2023-03-22 16:01:14] [INFO ] Flatten gal took : 21 ms
[2023-03-22 16:01:15] [INFO ] Input system was already deterministic with 1084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 118 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-22 16:01:15] [INFO ] Flatten gal took : 21 ms
[2023-03-22 16:01:15] [INFO ] Flatten gal took : 22 ms
[2023-03-22 16:01:15] [INFO ] Input system was already deterministic with 1081 transitions.
[2023-03-22 16:01:15] [INFO ] Flatten gal took : 28 ms
[2023-03-22 16:01:15] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:01:15] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 16:01:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1217 places, 1117 transitions and 2874 arcs took 6 ms.
Total runtime 74703 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: 1217 NrTr: 1117 NrArc: 2874)

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

net check time: 0m 0.000sec

init dd package: 0m 2.922sec


before gc: list nodes free: 153600

after gc: idd nodes used:51470717, unused:12529283; list nodes free:56865130

RS generation: 15m21.655sec


-> last computed set: #nodes 51469502 (5.1e+07) #states 9,450,225,296,435,081,378,939,083 (24)


CANNOT_COMPUTE


BK_STOP 1679501829912

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../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.004sec

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="ShieldIIPt-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 ShieldIIPt-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 r394-oct2-167903717700282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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