About the Execution of Marcie+red for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7782.352 | 48653.00 | 60814.00 | 557.10 | FFFFFFFFFTTTTFFF | normal |
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.r266-smll-167863540900417.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Parking-PT-208, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900417
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-CTLCardinality-00
FORMULA_NAME Parking-PT-208-CTLCardinality-01
FORMULA_NAME Parking-PT-208-CTLCardinality-02
FORMULA_NAME Parking-PT-208-CTLCardinality-03
FORMULA_NAME Parking-PT-208-CTLCardinality-04
FORMULA_NAME Parking-PT-208-CTLCardinality-05
FORMULA_NAME Parking-PT-208-CTLCardinality-06
FORMULA_NAME Parking-PT-208-CTLCardinality-07
FORMULA_NAME Parking-PT-208-CTLCardinality-08
FORMULA_NAME Parking-PT-208-CTLCardinality-09
FORMULA_NAME Parking-PT-208-CTLCardinality-10
FORMULA_NAME Parking-PT-208-CTLCardinality-11
FORMULA_NAME Parking-PT-208-CTLCardinality-12
FORMULA_NAME Parking-PT-208-CTLCardinality-13
FORMULA_NAME Parking-PT-208-CTLCardinality-14
FORMULA_NAME Parking-PT-208-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679042559446
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:42:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 08:42:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:42:43] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-17 08:42:43] [INFO ] Transformed 137 places.
[2023-03-17 08:42:43] [INFO ] Transformed 201 transitions.
[2023-03-17 08:42:43] [INFO ] Found NUPN structural information;
[2023-03-17 08:42:43] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Applied a total of 0 rules in 28 ms. Remains 137 /137 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 137 cols
[2023-03-17 08:42:43] [INFO ] Computed 34 place invariants in 29 ms
[2023-03-17 08:42:43] [INFO ] Implicit Places using invariants in 558 ms returned [28, 36, 52, 64, 94, 110, 118, 132]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 617 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 116
Applied a total of 2 rules in 15 ms. Remains 128 /129 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 128 cols
[2023-03-17 08:42:43] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-17 08:42:43] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-17 08:42:43] [INFO ] Invariant cache hit.
[2023-03-17 08:42:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 08:42:44] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/137 places, 116/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 128/137 places, 116/117 transitions.
Support contains 66 out of 128 places after structural reductions.
[2023-03-17 08:42:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 08:42:44] [INFO ] Flatten gal took : 67 ms
[2023-03-17 08:42:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Parking-PT-208-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:42:44] [INFO ] Flatten gal took : 26 ms
[2023-03-17 08:42:44] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 60 out of 128 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 829 ms. (steps per millisecond=12 ) properties (out of 41) seen :34
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 08:42:45] [INFO ] Invariant cache hit.
[2023-03-17 08:42:46] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 08:42:46] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-17 08:42:46] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 08:42:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 08:42:46] [INFO ] After 89ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-17 08:42:46] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 17 ms to minimize.
[2023-03-17 08:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-17 08:42:46] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-17 08:42:46] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 2 properties in 60 ms.
Support contains 9 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 116/116 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 128 transition count 113
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 124 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 124 transition count 109
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 121 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 119 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 119 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 34 place count 111 transition count 99
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 111 transition count 77
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 78 place count 89 transition count 77
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 89 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 87 transition count 75
Applied a total of 82 rules in 71 ms. Remains 87 /128 variables (removed 41) and now considering 75/116 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 87/128 places, 75/116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 87 cols
[2023-03-17 08:42:47] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-17 08:42:47] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 08:42:47] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-17 08:42:47] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 08:42:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-17 08:42:47] [INFO ] After 27ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 08:42:47] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-17 08:42:47] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 1 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 75/75 transitions.
Graph (complete) has 180 edges and 87 vertex of which 44 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 44 transition count 36
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 43 transition count 36
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 42 transition count 35
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 42 transition count 35
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 1 with 2 rules applied. Total rules applied 9 place count 41 transition count 34
Applied a total of 9 rules in 15 ms. Remains 41 /87 variables (removed 46) and now considering 34/75 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 41/87 places, 34/75 transitions.
Finished random walk after 10 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
[2023-03-17 08:42:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 13 ms
FORMULA Parking-PT-208-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:47] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 59 out of 128 places (down from 60) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 112
Applied a total of 8 rules in 18 ms. Remains 124 /128 variables (removed 4) and now considering 112/116 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 124/128 places, 112/116 transitions.
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:47] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 112
Applied a total of 8 rules in 10 ms. Remains 124 /128 variables (removed 4) and now considering 112/116 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 124/128 places, 112/116 transitions.
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:42:47] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 111
Applied a total of 10 rules in 9 ms. Remains 123 /128 variables (removed 5) and now considering 111/116 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 123/128 places, 111/116 transitions.
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:42:47] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 110
Applied a total of 12 rules in 7 ms. Remains 122 /128 variables (removed 6) and now considering 110/116 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 122/128 places, 110/116 transitions.
[2023-03-17 08:42:47] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 116/116 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 128 transition count 113
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 124 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 124 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 121 transition count 109
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 20 place count 115 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 115 transition count 103
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 3 with 4 rules applied. Total rules applied 30 place count 113 transition count 101
Applied a total of 30 rules in 29 ms. Remains 113 /128 variables (removed 15) and now considering 101/116 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 113/128 places, 101/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 124 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 124 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 120 transition count 108
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 114 transition count 102
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 109 transition count 97
Applied a total of 38 rules in 26 ms. Remains 109 /128 variables (removed 19) and now considering 97/116 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 109/128 places, 97/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 110
Applied a total of 12 rules in 7 ms. Remains 122 /128 variables (removed 6) and now considering 110/116 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 122/128 places, 110/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 113
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 124 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 124 transition count 109
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 121 transition count 109
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 18 place count 115 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 34 place count 110 transition count 98
Applied a total of 34 rules in 22 ms. Remains 110 /128 variables (removed 18) and now considering 98/116 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 110/128 places, 98/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 127 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 123 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 123 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 119 transition count 107
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 114 transition count 102
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 109 transition count 97
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 109 transition count 97
Applied a total of 38 rules in 23 ms. Remains 109 /128 variables (removed 19) and now considering 97/116 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 109/128 places, 97/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 110
Applied a total of 12 rules in 5 ms. Remains 122 /128 variables (removed 6) and now considering 110/116 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 122/128 places, 110/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 116/116 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 128 transition count 113
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 124 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 124 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 121 transition count 109
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 116 transition count 104
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 116 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 34 place count 111 transition count 99
Applied a total of 34 rules in 19 ms. Remains 111 /128 variables (removed 17) and now considering 99/116 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 111/128 places, 99/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 113
Applied a total of 6 rules in 4 ms. Remains 125 /128 variables (removed 3) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/128 places, 113/116 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:48] [INFO ] Input system was already deterministic with 113 transitions.
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:48] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:48] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-17 08:42:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 116 transitions and 383 arcs took 2 ms.
Total runtime 5778 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 128 NrTr: 116 NrArc: 383)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.548sec
RS generation: 0m 0.056sec
-> reachability set: #nodes 863 (8.6e+02) #states 4,498,391,041 (9)
starting MCC model checker
--------------------------
checking: AG [AX [[p98<=0 & 0<=p98]]]
normalized: ~ [E [true U EX [~ [[p98<=0 & 0<=p98]]]]]
abstracting: (0<=p98)
states: 4,498,391,041 (9)
abstracting: (p98<=0)
states: 4,396,154,881 (9)
.-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.296sec
checking: AF [EG [E [[p93<=1 & 1<=p93] U AG [[[p93<=0 & 0<=p93] | [p60<=1 & 1<=p60]]]]]]
normalized: ~ [EG [~ [EG [E [[p93<=1 & 1<=p93] U ~ [E [true U ~ [[[p60<=1 & 1<=p60] | [p93<=0 & 0<=p93]]]]]]]]]]
abstracting: (0<=p93)
states: 4,498,391,041 (9)
abstracting: (p93<=0)
states: 4,430,233,601 (9)
abstracting: (1<=p60)
states: 138,412,032 (8)
abstracting: (p60<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p93)
states: 68,157,440 (7)
abstracting: (p93<=1)
states: 4,498,391,041 (9)
.
EG iterations: 1
.........................................
EG iterations: 41
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.317sec
checking: [EF [AX [AX [1<=0]]] & AF [AG [[[p45<=0 & 0<=p45] | [[p83<=1 & 1<=p83] | [[p62<=0 & 0<=p62] & [p5<=1 & 1<=p5]]]]]]]
normalized: [~ [EG [E [true U ~ [[[p45<=0 & 0<=p45] | [[[p62<=0 & 0<=p62] & [p5<=1 & 1<=p5]] | [p83<=1 & 1<=p83]]]]]]] & E [true U ~ [EX [EX [~ [1<=0]]]]]]
abstracting: (1<=0)
states: 0
..abstracting: (1<=p83)
states: 102,236,160 (8)
abstracting: (p83<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p5)
states: 2,249,195,520 (9)
abstracting: (p5<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p62)
states: 4,498,391,041 (9)
abstracting: (p62<=0)
states: 3,529,506,817 (9)
abstracting: (0<=p45)
states: 4,498,391,041 (9)
abstracting: (p45<=0)
states: 4,429,185,025 (9)
.......................................
EG iterations: 39
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.211sec
checking: EG [A [EG [[AG [[p99<=0 & 0<=p99]] & EG [[p64<=1 & 1<=p64]]]] U [[p112<=0 & 0<=p112] | [p108<=1 & 1<=p108]]]]
normalized: EG [[~ [EG [~ [[[p112<=0 & 0<=p112] | [p108<=1 & 1<=p108]]]]] & ~ [E [~ [[[p112<=0 & 0<=p112] | [p108<=1 & 1<=p108]]] U [~ [[[p112<=0 & 0<=p112] | [p108<=1 & 1<=p108]]] & ~ [EG [[EG [[p64<=1 & 1<=p64]] & ~ [E [true U ~ [[p99<=0 & 0<=p99]]]]]]]]]]]]
abstracting: (0<=p99)
states: 4,498,391,041 (9)
abstracting: (p99<=0)
states: 4,430,233,601 (9)
abstracting: (1<=p64)
states: 1,349,517,312 (9)
abstracting: (p64<=1)
states: 4,498,391,041 (9)
.....................................
EG iterations: 37
.
EG iterations: 1
abstracting: (1<=p108)
states: 68,157,440 (7)
abstracting: (p108<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p112)
states: 4,498,391,041 (9)
abstracting: (p112<=0)
states: 4,362,076,161 (9)
abstracting: (1<=p108)
states: 68,157,440 (7)
abstracting: (p108<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p112)
states: 4,498,391,041 (9)
abstracting: (p112<=0)
states: 4,362,076,161 (9)
abstracting: (1<=p108)
states: 68,157,440 (7)
abstracting: (p108<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p112)
states: 4,498,391,041 (9)
abstracting: (p112<=0)
states: 4,362,076,161 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Parking-PT-208-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.404sec
checking: EF [[EF [~ [A [[p116<=0 & 0<=p116] U [[p61<=0 & 0<=p61] | [p120<=1 & 1<=p120]]]]] & EX [[p120<=1 & 1<=p120]]]]
normalized: E [true U [EX [[p120<=1 & 1<=p120]] & E [true U ~ [[~ [EG [~ [[[p120<=1 & 1<=p120] | [p61<=0 & 0<=p61]]]]] & ~ [E [~ [[[p120<=1 & 1<=p120] | [p61<=0 & 0<=p61]]] U [~ [[p116<=0 & 0<=p116]] & ~ [[[p120<=1 & 1<=p120] | [p61<=0 & 0<=p61]]]]]]]]]]]
abstracting: (0<=p61)
states: 4,498,391,041 (9)
abstracting: (p61<=0)
states: 138,412,033 (8)
abstracting: (1<=p120)
states: 136,314,880 (8)
abstracting: (p120<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p116)
states: 4,498,391,041 (9)
abstracting: (p116<=0)
states: 4,362,076,161 (9)
abstracting: (0<=p61)
states: 4,498,391,041 (9)
abstracting: (p61<=0)
states: 138,412,033 (8)
abstracting: (1<=p120)
states: 136,314,880 (8)
abstracting: (p120<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p61)
states: 4,498,391,041 (9)
abstracting: (p61<=0)
states: 138,412,033 (8)
abstracting: (1<=p120)
states: 136,314,880 (8)
abstracting: (p120<=1)
states: 4,498,391,041 (9)
.......................................
EG iterations: 39
abstracting: (1<=p120)
states: 136,314,880 (8)
abstracting: (p120<=1)
states: 4,498,391,041 (9)
.-> the formula is TRUE
FORMULA Parking-PT-208-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.624sec
checking: A [~ [[p46<=1 & 1<=p46]] U ~ [[~ [AF [[[p73<=0 & 0<=p73] | [p48<=1 & 1<=p48]]]] | AG [EX [[[p39<=0 & 0<=p39] | [p67<=1 & 1<=p67]]]]]]]
normalized: [~ [EG [[~ [E [true U ~ [EX [[[p67<=1 & 1<=p67] | [p39<=0 & 0<=p39]]]]]] | EG [~ [[[p48<=1 & 1<=p48] | [p73<=0 & 0<=p73]]]]]]] & ~ [E [[~ [E [true U ~ [EX [[[p67<=1 & 1<=p67] | [p39<=0 & 0<=p39]]]]]] | EG [~ [[[p48<=1 & 1<=p48] | [p73<=0 & 0<=p73]]]]] U [[p46<=1 & 1<=p46] & [~ [E [true U ~ [EX [[[p67<=1 & 1<=p67] | [p39<=0 & 0<=p39]]]]]] | EG [~ [[[p48<=1 & 1<=p48] | [p73<=0 & 0<=p73]]]]]]]]]
abstracting: (0<=p73)
states: 4,498,391,041 (9)
abstracting: (p73<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p48)
states: 138,412,032 (8)
abstracting: (p48<=1)
states: 4,498,391,041 (9)
..........................................................
EG iterations: 58
abstracting: (0<=p39)
states: 4,498,391,041 (9)
abstracting: (p39<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p67)
states: 2,249,195,520 (9)
abstracting: (p67<=1)
states: 4,498,391,041 (9)
.abstracting: (1<=p46)
states: 69,206,016 (7)
abstracting: (p46<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p73)
states: 4,498,391,041 (9)
abstracting: (p73<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p48)
states: 138,412,032 (8)
abstracting: (p48<=1)
states: 4,498,391,041 (9)
..........................................................
EG iterations: 58
abstracting: (0<=p39)
states: 4,498,391,041 (9)
abstracting: (p39<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p67)
states: 2,249,195,520 (9)
abstracting: (p67<=1)
states: 4,498,391,041 (9)
.abstracting: (0<=p73)
states: 4,498,391,041 (9)
abstracting: (p73<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p48)
states: 138,412,032 (8)
abstracting: (p48<=1)
states: 4,498,391,041 (9)
..........................................................
EG iterations: 58
abstracting: (0<=p39)
states: 4,498,391,041 (9)
abstracting: (p39<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p67)
states: 2,249,195,520 (9)
abstracting: (p67<=1)
states: 4,498,391,041 (9)
..
EG iterations: 1
-> the formula is TRUE
FORMULA Parking-PT-208-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.989sec
checking: E [[[p83<=0 & 0<=p83] | [p74<=1 & 1<=p74]] U ~ [AG [[[p91<=0 & 0<=p91] & [[p62<=0 & 0<=p62] | [p93<=1 & 1<=p93]]]]]]
normalized: E [[[p74<=1 & 1<=p74] | [p83<=0 & 0<=p83]] U E [true U ~ [[[[p93<=1 & 1<=p93] | [p62<=0 & 0<=p62]] & [p91<=0 & 0<=p91]]]]]
abstracting: (0<=p91)
states: 4,498,391,041 (9)
abstracting: (p91<=0)
states: 4,396,154,881 (9)
abstracting: (0<=p62)
states: 4,498,391,041 (9)
abstracting: (p62<=0)
states: 3,529,506,817 (9)
abstracting: (1<=p93)
states: 68,157,440 (7)
abstracting: (p93<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p83)
states: 4,498,391,041 (9)
abstracting: (p83<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p74)
states: 2,249,195,520 (9)
abstracting: (p74<=1)
states: 4,498,391,041 (9)
-> the formula is TRUE
FORMULA Parking-PT-208-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.200sec
checking: AF [[A [AF [[[p97<=0 & 0<=p97] | [p127<=1 & 1<=p127]]] U [p76<=1 & 1<=p76]] & EX [AF [[[[p92<=0 & 0<=p92] | [p95<=1 & 1<=p95]] & [p124<=0 & 0<=p124]]]]]]
normalized: ~ [EG [~ [[EX [~ [EG [~ [[[[p95<=1 & 1<=p95] | [p92<=0 & 0<=p92]] & [p124<=0 & 0<=p124]]]]]] & [~ [EG [~ [[p76<=1 & 1<=p76]]]] & ~ [E [~ [[p76<=1 & 1<=p76]] U [EG [~ [[[p127<=1 & 1<=p127] | [p97<=0 & 0<=p97]]]] & ~ [[p76<=1 & 1<=p76]]]]]]]]]]
abstracting: (1<=p76)
states: 2,249,195,520 (9)
abstracting: (p76<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p97)
states: 4,498,391,041 (9)
abstracting: (p97<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p127)
states: 1,363,148,800 (9)
abstracting: (p127<=1)
states: 4,498,391,041 (9)
...................................
EG iterations: 35
abstracting: (1<=p76)
states: 2,249,195,520 (9)
abstracting: (p76<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p76)
states: 2,249,195,520 (9)
abstracting: (p76<=1)
states: 4,498,391,041 (9)
....................................................
EG iterations: 52
abstracting: (0<=p124)
states: 4,498,391,041 (9)
abstracting: (p124<=0)
states: 3,544,186,881 (9)
abstracting: (0<=p92)
states: 4,498,391,041 (9)
abstracting: (p92<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p95)
states: 136,314,880 (8)
abstracting: (p95<=1)
states: 4,498,391,041 (9)
...................................................
EG iterations: 51
.....................
EG iterations: 20
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.594sec
checking: AG [E [AG [[[[p36<=0 & 0<=p36] | [p24<=1 & 1<=p24]] & [~ [[[p28<=0 & 0<=p28] | [p71<=1 & 1<=p71]]] | [[p112<=0 & 0<=p112] | [p108<=1 & 1<=p108]]]]] U [AF [EG [[p75<=1 & 1<=p75]]] & [[p114<=0 & 0<=p114] | [p50<=1 & 1<=p50]]]]]
normalized: ~ [E [true U ~ [E [~ [E [true U ~ [[[~ [[[p71<=1 & 1<=p71] | [p28<=0 & 0<=p28]]] | [[p108<=1 & 1<=p108] | [p112<=0 & 0<=p112]]] & [[p24<=1 & 1<=p24] | [p36<=0 & 0<=p36]]]]]] U [~ [EG [~ [EG [[p75<=1 & 1<=p75]]]]] & [[p50<=1 & 1<=p50] | [p114<=0 & 0<=p114]]]]]]]
abstracting: (0<=p114)
states: 4,498,391,041 (9)
abstracting: (p114<=0)
states: 4,362,076,161 (9)
abstracting: (1<=p50)
states: 138,412,032 (8)
abstracting: (p50<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p75)
states: 2,249,195,520 (9)
abstracting: (p75<=1)
states: 4,498,391,041 (9)
...............................................
EG iterations: 47
..
EG iterations: 2
abstracting: (0<=p36)
states: 4,498,391,041 (9)
abstracting: (p36<=0)
states: 4,394,582,017 (9)
abstracting: (1<=p24)
states: 103,809,024 (8)
abstracting: (p24<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p112)
states: 4,498,391,041 (9)
abstracting: (p112<=0)
states: 4,362,076,161 (9)
abstracting: (1<=p108)
states: 68,157,440 (7)
abstracting: (p108<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p28)
states: 4,498,391,041 (9)
abstracting: (p28<=0)
states: 4,394,582,017 (9)
abstracting: (1<=p71)
states: 2,249,195,520 (9)
abstracting: (p71<=1)
states: 4,498,391,041 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.386sec
checking: A [E [[A [AF [[[p47<=0 & 0<=p47] | [p62<=1 & 1<=p62]]] U [[p82<=0 & 0<=p82] | [p124<=1 & 1<=p124]]] & AF [[p63<=1 & 1<=p63]]] U [AX [[EX [[p91<=1 & 1<=p91]] & [p15<=1 & 1<=p15]]] | AX [EX [0<=0]]]] U EX [[~ [EG [[[p7<=0 & 0<=p7] | [p66<=1 & 1<=p66]]]] & AF [[[p7<=0 & 0<=p7] | [p70<=1 & 1<=p70]]]]]]
normalized: [~ [EG [~ [EX [[~ [EG [~ [[[p70<=1 & 1<=p70] | [p7<=0 & 0<=p7]]]]] & ~ [EG [[[p66<=1 & 1<=p66] | [p7<=0 & 0<=p7]]]]]]]]] & ~ [E [~ [EX [[~ [EG [~ [[[p70<=1 & 1<=p70] | [p7<=0 & 0<=p7]]]]] & ~ [EG [[[p66<=1 & 1<=p66] | [p7<=0 & 0<=p7]]]]]]] U [~ [E [[~ [EG [~ [[p63<=1 & 1<=p63]]]] & [~ [EG [~ [[[p124<=1 & 1<=p124] | [p82<=0 & 0<=p82]]]]] & ~ [E [~ [[[p124<=1 & 1<=p124] | [p82<=0 & 0<=p82]]] U [EG [~ [[[p62<=1 & 1<=p62] | [p47<=0 & 0<=p47]]]] & ~ [[[p124<=1 & 1<=p124] | [p82<=0 & 0<=p82]]]]]]]] U [~ [EX [~ [EX [0<=0]]]] | ~ [EX [~ [[EX [[p91<=1 & 1<=p91]] & [p15<=1 & 1<=p15]]]]]]]] & ~ [EX [[~ [EG [~ [[[p70<=1 & 1<=p70] | [p7<=0 & 0<=p7]]]]] & ~ [EG [[[p66<=1 & 1<=p66] | [p7<=0 & 0<=p7]]]]]]]]]]]
abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p66)
states: 2,249,195,520 (9)
abstracting: (p66<=1)
states: 4,498,391,041 (9)
.........................................
EG iterations: 41
abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p70)
states: 2,249,195,520 (9)
abstracting: (p70<=1)
states: 4,498,391,041 (9)
...............................................
EG iterations: 47
.abstracting: (1<=p15)
states: 2,249,195,520 (9)
abstracting: (p15<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p91)
states: 102,236,160 (8)
abstracting: (p91<=1)
states: 4,498,391,041 (9)
..abstracting: (0<=0)
states: 4,498,391,041 (9)
..abstracting: (0<=p82)
states: 4,498,391,041 (9)
abstracting: (p82<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p124)
states: 954,204,160 (8)
abstracting: (p124<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p47)
states: 4,498,391,041 (9)
abstracting: (p47<=0)
states: 4,359,979,009 (9)
abstracting: (1<=p62)
states: 968,884,224 (8)
abstracting: (p62<=1)
states: 4,498,391,041 (9)
.
EG iterations: 1
abstracting: (0<=p82)
states: 4,498,391,041 (9)
abstracting: (p82<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p124)
states: 954,204,160 (8)
abstracting: (p124<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p82)
states: 4,498,391,041 (9)
abstracting: (p82<=0)
states: 4,396,154,881 (9)
abstracting: (1<=p124)
states: 954,204,160 (8)
abstracting: (p124<=1)
states: 4,498,391,041 (9)
....................................
EG iterations: 36
abstracting: (1<=p63)
states: 830,472,192 (8)
abstracting: (p63<=1)
states: 4,498,391,041 (9)
.
EG iterations: 1
abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p66)
states: 2,249,195,520 (9)
abstracting: (p66<=1)
states: 4,498,391,041 (9)
.........................................
EG iterations: 41
abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p70)
states: 2,249,195,520 (9)
abstracting: (p70<=1)
states: 4,498,391,041 (9)
...............................................
EG iterations: 47
.abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p66)
states: 2,249,195,520 (9)
abstracting: (p66<=1)
states: 4,498,391,041 (9)
.........................................
EG iterations: 41
abstracting: (0<=p7)
states: 4,498,391,041 (9)
abstracting: (p7<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p70)
states: 2,249,195,520 (9)
abstracting: (p70<=1)
states: 4,498,391,041 (9)
...............................................
EG iterations: 47
....................................
EG iterations: 35
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.343sec
checking: AF [[EG [[p108<=1 & 1<=p108]] & [EG [~ [A [[[p48<=0 & 0<=p48] | [p73<=1 & 1<=p73]] U [p94<=1 & 1<=p94]]]] | EG [[[[[p123<=0 & 0<=p123] & [p110<=1 & 1<=p110]] | [[[p122<=0 & 0<=p122] | [p16<=1 & 1<=p16]] & [[p96<=0 & 0<=p96] | [p11<=1 & 1<=p11]]]] & A [[p1<=1 & 1<=p1] U [[p42<=0 & 0<=p42] | [p114<=1 & 1<=p114]]]]]]]]
normalized: ~ [EG [~ [[[EG [[[~ [EG [~ [[[p114<=1 & 1<=p114] | [p42<=0 & 0<=p42]]]]] & ~ [E [~ [[[p114<=1 & 1<=p114] | [p42<=0 & 0<=p42]]] U [~ [[p1<=1 & 1<=p1]] & ~ [[[p114<=1 & 1<=p114] | [p42<=0 & 0<=p42]]]]]]] & [[[[p11<=1 & 1<=p11] | [p96<=0 & 0<=p96]] & [[p16<=1 & 1<=p16] | [p122<=0 & 0<=p122]]] | [[p110<=1 & 1<=p110] & [p123<=0 & 0<=p123]]]]] | EG [~ [[~ [EG [~ [[p94<=1 & 1<=p94]]]] & ~ [E [~ [[p94<=1 & 1<=p94]] U [~ [[[p73<=1 & 1<=p73] | [p48<=0 & 0<=p48]]] & ~ [[p94<=1 & 1<=p94]]]]]]]]] & EG [[p108<=1 & 1<=p108]]]]]]
abstracting: (1<=p108)
states: 68,157,440 (7)
abstracting: (p108<=1)
states: 4,498,391,041 (9)
....................................
EG iterations: 36
abstracting: (1<=p94)
states: 136,314,880 (8)
abstracting: (p94<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p48)
states: 4,498,391,041 (9)
abstracting: (p48<=0)
states: 4,359,979,009 (9)
abstracting: (1<=p73)
states: 2,249,195,520 (9)
abstracting: (p73<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p94)
states: 136,314,880 (8)
abstracting: (p94<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p94)
states: 136,314,880 (8)
abstracting: (p94<=1)
states: 4,498,391,041 (9)
.....................................
EG iterations: 37
.........................
EG iterations: 25
abstracting: (0<=p123)
states: 4,498,391,041 (9)
abstracting: (p123<=0)
states: 4,362,076,161 (9)
abstracting: (1<=p110)
states: 136,314,880 (8)
abstracting: (p110<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p122)
states: 4,498,391,041 (9)
abstracting: (p122<=0)
states: 1,499,463,681 (9)
abstracting: (1<=p16)
states: 2,249,195,520 (9)
abstracting: (p16<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p96)
states: 4,498,391,041 (9)
abstracting: (p96<=0)
states: 749,731,841 (8)
abstracting: (1<=p11)
states: 2,249,195,520 (9)
abstracting: (p11<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p42)
states: 4,498,391,041 (9)
abstracting: (p42<=0)
states: 692,060,161 (8)
abstracting: (1<=p114)
states: 136,314,880 (8)
abstracting: (p114<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p1)
states: 2,249,195,520 (9)
abstracting: (p1<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p42)
states: 4,498,391,041 (9)
abstracting: (p42<=0)
states: 692,060,161 (8)
abstracting: (1<=p114)
states: 136,314,880 (8)
abstracting: (p114<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p42)
states: 4,498,391,041 (9)
abstracting: (p42<=0)
states: 692,060,161 (8)
abstracting: (1<=p114)
states: 136,314,880 (8)
abstracting: (p114<=1)
states: 4,498,391,041 (9)
.
EG iterations: 1
.....................................
EG iterations: 37
.
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.138sec
checking: E [[[[p64<=1 & 1<=p64] | [p22<=0 & 0<=p22]] & [~ [[[AX [[[p57<=1 & 1<=p57] | [[p59<=0 & 0<=p59] | [p22<=1 & 1<=p22]]]] & [[p68<=0 & 0<=p68] | [p28<=1 & 1<=p28]]] & [[[p64<=0 & 0<=p64] | [p13<=1 & 1<=p13]] & [~ [[p60<=1 & 1<=p60]] & EX [[[p38<=0 & 0<=p38] | [p111<=1 & 1<=p111]]]]]]] | [[p33<=0 & 0<=p33] | [p98<=1 & 1<=p98]]]] U ~ [EF [AX [[[p112<=0 & 0<=p112] | [p49<=1 & 1<=p49]]]]]]
normalized: E [[[[[p98<=1 & 1<=p98] | [p33<=0 & 0<=p33]] | ~ [[[[EX [[[p111<=1 & 1<=p111] | [p38<=0 & 0<=p38]]] & ~ [[p60<=1 & 1<=p60]]] & [[p13<=1 & 1<=p13] | [p64<=0 & 0<=p64]]] & [[[p28<=1 & 1<=p28] | [p68<=0 & 0<=p68]] & ~ [EX [~ [[[[p22<=1 & 1<=p22] | [p59<=0 & 0<=p59]] | [p57<=1 & 1<=p57]]]]]]]]] & [[p22<=0 & 0<=p22] | [p64<=1 & 1<=p64]]] U ~ [E [true U ~ [EX [~ [[[p112<=0 & 0<=p112] | [p49<=1 & 1<=p49]]]]]]]]
abstracting: (1<=p49)
states: 138,412,032 (8)
abstracting: (p49<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p112)
states: 4,498,391,041 (9)
abstracting: (p112<=0)
states: 4,362,076,161 (9)
.abstracting: (1<=p64)
states: 1,349,517,312 (9)
abstracting: (p64<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p22)
states: 4,498,391,041 (9)
abstracting: (p22<=0)
states: 4,394,582,017 (9)
abstracting: (1<=p57)
states: 138,412,032 (8)
abstracting: (p57<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p59)
states: 4,498,391,041 (9)
abstracting: (p59<=0)
states: 4,359,979,009 (9)
abstracting: (1<=p22)
states: 103,809,024 (8)
abstracting: (p22<=1)
states: 4,498,391,041 (9)
.abstracting: (0<=p68)
states: 4,498,391,041 (9)
abstracting: (p68<=0)
states: 2,249,195,521 (9)
abstracting: (1<=p28)
states: 103,809,024 (8)
abstracting: (p28<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p64)
states: 4,498,391,041 (9)
abstracting: (p64<=0)
states: 3,148,873,729 (9)
abstracting: (1<=p13)
states: 2,249,195,520 (9)
abstracting: (p13<=1)
states: 4,498,391,041 (9)
abstracting: (1<=p60)
states: 138,412,032 (8)
abstracting: (p60<=1)
states: 4,498,391,041 (9)
abstracting: (0<=p38)
states: 4,498,391,041 (9)
abstracting: (p38<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p111)
states: 136,314,880 (8)
abstracting: (p111<=1)
states: 4,498,391,041 (9)
.abstracting: (0<=p33)
states: 4,498,391,041 (9)
abstracting: (p33<=0)
states: 4,359,979,009 (9)
abstracting: (1<=p98)
states: 102,236,160 (8)
abstracting: (p98<=1)
states: 4,498,391,041 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
totally nodes used: 31970706 (3.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26263213 52210975 78474188
used/not used/entry size/cache size: 47852892 19255972 16 1024MB
basic ops cache: hits/miss/sum: 2586707 5672965 8259672
used/not used/entry size/cache size: 8053556 8723660 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 7663 19201 26864
used/not used/entry size/cache size: 19183 8369425 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 42143069
1 19141300
2 4806504
3 874410
4 126631
5 15240
6 1541
7 155
8 13
9 1
>= 10 0
Total processing time: 0m38.515sec
BK_STOP 1679042608099
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.000sec
iterations count:2198 (18), effective:265 (2)
initing FirstDep: 0m 0.000sec
iterations count:1676 (14), effective:174 (1)
iterations count:1319 (11), effective:122 (1)
iterations count:163 (1), effective:2 (0)
iterations count:1164 (10), effective:130 (1)
iterations count:6518 (56), effective:715 (6)
iterations count:1691 (14), effective:179 (1)
iterations count:354 (3), effective:28 (0)
iterations count:191 (1), effective:6 (0)
iterations count:332 (2), effective:22 (0)
iterations count:1321 (11), effective:113 (0)
iterations count:814 (7), effective:92 (0)
iterations count:814 (7), effective:92 (0)
iterations count:164 (1), effective:3 (0)
iterations count:814 (7), effective:92 (0)
iterations count:1663 (14), effective:155 (1)
iterations count:116 (1), effective:0 (0)
iterations count:205 (1), effective:8 (0)
iterations count:5100 (43), effective:563 (4)
iterations count:116 (1), effective:0 (0)
iterations count:223 (1), effective:3 (0)
iterations count:629 (5), effective:53 (0)
iterations count:116 (1), effective:0 (0)
iterations count:1860 (16), effective:209 (1)
iterations count:1209 (10), effective:107 (0)
iterations count:989 (8), effective:91 (0)
iterations count:727 (6), effective:81 (0)
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="Parking-PT-208"
export BK_EXAMINATION="CTLCardinality"
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 Parking-PT-208, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540900417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;