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.r010-oct2-167813599100482.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 AutoFlight-PT-24a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Feb 25 18:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 18:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678692626003

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=AutoFlight-PT-24a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:30:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:30:29] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-13 07:30:29] [INFO ] Transformed 607 places.
[2023-03-13 07:30:29] [INFO ] Transformed 605 transitions.
[2023-03-13 07:30:29] [INFO ] Found NUPN structural information;
[2023-03-13 07:30:29] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
Support contains 114 out of 607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 607/607 places, 485/485 transitions.
Applied a total of 0 rules in 88 ms. Remains 607 /607 variables (removed 0) and now considering 485/485 (removed 0) transitions.
// Phase 1: matrix 485 rows 607 cols
[2023-03-13 07:30:29] [INFO ] Computed 148 place invariants in 14 ms
[2023-03-13 07:30:31] [INFO ] Implicit Places using invariants in 1702 ms returned [21, 28, 42, 49, 63, 84, 91, 105, 119, 126, 171, 174, 177, 180, 183, 189, 192, 195, 198, 201, 204, 207, 210, 213, 219, 222, 225, 228, 231, 234, 237, 240, 460, 466, 472, 478, 484, 490, 496, 502, 508, 514, 520, 526, 532, 538, 550, 556, 562, 568, 580, 586, 592, 604]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1756 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/607 places, 485/485 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 536 transition count 468
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 536 transition count 468
Applied a total of 34 rules in 69 ms. Remains 536 /553 variables (removed 17) and now considering 468/485 (removed 17) transitions.
// Phase 1: matrix 468 rows 536 cols
[2023-03-13 07:30:31] [INFO ] Computed 94 place invariants in 5 ms
[2023-03-13 07:30:31] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-13 07:30:31] [INFO ] Invariant cache hit.
[2023-03-13 07:30:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-13 07:30:32] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/607 places, 468/485 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3210 ms. Remains : 536/607 places, 468/485 transitions.
Support contains 114 out of 536 places after structural reductions.
[2023-03-13 07:30:32] [INFO ] Flatten gal took : 97 ms
[2023-03-13 07:30:32] [INFO ] Flatten gal took : 50 ms
[2023-03-13 07:30:32] [INFO ] Input system was already deterministic with 468 transitions.
Support contains 106 out of 536 places (down from 114) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 60) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 07:30:33] [INFO ] Invariant cache hit.
[2023-03-13 07:30:33] [INFO ] [Real]Absence check using 94 positive place invariants in 22 ms returned sat
[2023-03-13 07:30:34] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:18
[2023-03-13 07:30:34] [INFO ] [Nat]Absence check using 94 positive place invariants in 15 ms returned sat
[2023-03-13 07:30:35] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :13
[2023-03-13 07:30:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-13 07:30:36] [INFO ] After 543ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :7 sat :13
[2023-03-13 07:30:37] [INFO ] After 1730ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :13
Attempting to minimize the solution found.
Minimization took 664 ms.
[2023-03-13 07:30:37] [INFO ] After 3459ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :13
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 11 properties in 83 ms.
Support contains 7 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 468/468 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 536 transition count 383
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 451 transition count 383
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 170 place count 451 transition count 311
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 314 place count 379 transition count 311
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 317 place count 376 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 320 place count 376 transition count 308
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 412 place count 330 transition count 262
Free-agglomeration rule applied 47 times.
Iterating global reduction 2 with 47 rules applied. Total rules applied 459 place count 330 transition count 215
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 506 place count 283 transition count 215
Applied a total of 506 rules in 69 ms. Remains 283 /536 variables (removed 253) and now considering 215/468 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 283/536 places, 215/468 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Finished Best-First random walk after 2205 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=367 )
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-24a-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 20 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 20 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 468 transitions.
Support contains 77 out of 536 places (down from 78) after GAL structural reductions.
Computed a total of 17 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 536 transition count 383
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 451 transition count 383
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 170 place count 451 transition count 311
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 314 place count 379 transition count 311
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 318 place count 375 transition count 307
Iterating global reduction 2 with 4 rules applied. Total rules applied 322 place count 375 transition count 307
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 418 place count 327 transition count 259
Applied a total of 418 rules in 74 ms. Remains 327 /536 variables (removed 209) and now considering 259/468 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 327/536 places, 259/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 17 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 259 transitions.
Finished random walk after 1684 steps, including 28 resets, run visited all 1 properties in 9 ms. (steps per millisecond=187 )
FORMULA AutoFlight-PT-24a-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 24 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 30 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 32 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 22 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 17 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 16 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 22 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 19 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 25 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 13 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 536 transition count 382
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 450 transition count 382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 172 place count 450 transition count 310
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 316 place count 378 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 320 place count 374 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 324 place count 374 transition count 306
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 416 place count 328 transition count 260
Applied a total of 416 rules in 32 ms. Remains 328 /536 variables (removed 208) and now considering 260/468 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 328/536 places, 260/468 transitions.
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:30:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:30:38] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 533 transition count 465
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 533 transition count 465
Applied a total of 6 rules in 13 ms. Remains 533 /536 variables (removed 3) and now considering 465/468 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 533/536 places, 465/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 533 transition count 465
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 533 transition count 465
Applied a total of 6 rules in 16 ms. Remains 533 /536 variables (removed 3) and now considering 465/468 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 533/536 places, 465/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 16 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 20 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 536 transition count 382
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 450 transition count 382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 172 place count 450 transition count 310
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 316 place count 378 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 320 place count 374 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 324 place count 374 transition count 306
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 418 place count 327 transition count 259
Applied a total of 418 rules in 31 ms. Remains 327 /536 variables (removed 209) and now considering 259/468 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 327/536 places, 259/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 259 transitions.
Finished random walk after 704 steps, including 13 resets, run visited all 1 properties in 4 ms. (steps per millisecond=176 )
FORMULA AutoFlight-PT-24a-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 536 transition count 382
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 450 transition count 382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 172 place count 450 transition count 310
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 316 place count 378 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 319 place count 375 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 322 place count 375 transition count 307
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 410 place count 331 transition count 263
Applied a total of 410 rules in 28 ms. Remains 331 /536 variables (removed 205) and now considering 263/468 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 331/536 places, 263/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 532 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 532 transition count 464
Applied a total of 8 rules in 29 ms. Remains 532 /536 variables (removed 4) and now considering 464/468 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 532/536 places, 464/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 15 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 468/468 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 533 transition count 465
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 533 transition count 465
Applied a total of 6 rules in 18 ms. Remains 533 /536 variables (removed 3) and now considering 465/468 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 533/536 places, 465/468 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Input system was already deterministic with 465 transitions.
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:30:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:30:39] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 07:30:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 536 places, 468 transitions and 1427 arcs took 3 ms.
Total runtime 10916 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: 536 NrTr: 468 NrArc: 1427)

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

net check time: 0m 0.000sec

init dd package: 0m 2.921sec


RS generation: 0m14.304sec


-> reachability set: #nodes 5552 (5.6e+03) #states 148,559,689,786,909,964,678,404,667,080,705 (32)



starting MCC model checker
--------------------------

checking: AX [EG [[p39<=1 & 1<=p39]]]
normalized: ~ [EX [~ [EG [[p39<=1 & 1<=p39]]]]]

abstracting: (1<=p39)
states: 49,521,112,648,971,219,262,120,409,432,064 (31)
abstracting: (p39<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
......
before gc: list nodes free: 1294035

after gc: idd nodes used:1219237, unused:62780763; list nodes free:296123524
.
before gc: list nodes free: 1393535

after gc: idd nodes used:2692548, unused:61307452; list nodes free:291413191

before gc: list nodes free: 2776045

after gc: idd nodes used:2749692, unused:61250308; list nodes free:291085110

before gc: list nodes free: 3519405

after gc: idd nodes used:3475566, unused:60524434; list nodes free:287469450
.
before gc: list nodes free: 433000

after gc: idd nodes used:3221510, unused:60778490; list nodes free:291021595
MC time: 4m37.118sec

checking: AF [AG [AX [EF [[[p436<=0 & 0<=p436] | [p535<=0 & 0<=p535]]]]]]
normalized: ~ [EG [E [true U EX [~ [E [true U [[p535<=0 & 0<=p535] | [p436<=0 & 0<=p436]]]]]]]]

abstracting: (0<=p436)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p436<=0)
states: 147,221,430,941,857,569,975,964,929,097,729 (32)
abstracting: (0<=p535)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p535<=0)
states: 1,338,258,845,052,394,702,439,737,982,977 (30)
..
EG iterations: 1
-> the formula is TRUE

FORMULA AutoFlight-PT-24a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.349sec

checking: AX [EG [AF [[EF [[[p123<=1 & 1<=p123] & [p228<=1 & 1<=p228]]] & AF [[[p100<=1 & 1<=p100] & [p494<=1 & 1<=p494]]]]]]]
normalized: ~ [EX [~ [EG [~ [EG [~ [[~ [EG [~ [[[p494<=1 & 1<=p494] & [p100<=1 & 1<=p100]]]]] & E [true U [[p228<=1 & 1<=p228] & [p123<=1 & 1<=p123]]]]]]]]]]]

abstracting: (1<=p123)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p123<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p228)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p228<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
MC time: 4m37.892sec

checking: AX [AG [AF [[[p64<=0 & 0<=p64] & [[p187<=1 & 1<=p187] & [[p65<=0 & 0<=p65] | [p219<=0 & 0<=p219]]]]]]]
normalized: ~ [EX [E [true U EG [~ [[[p64<=0 & 0<=p64] & [[[p65<=0 & 0<=p65] | [p219<=0 & 0<=p219]] & [p187<=1 & 1<=p187]]]]]]]]

abstracting: (1<=p187)
states: 74,279,844,893,454,982,339,202,333,540,352 (31)
abstracting: (p187<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (0<=p219)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p219<=0)
states: 148,559,610,290,062,761,287,560,533,639,169 (32)
abstracting: (0<=p65)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p65<=0)
states: 1
abstracting: (0<=p64)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p64<=0)
states: 99,037,350,914,597,361,081,925,773,557,761 (31)
...........................................................................................................
before gc: list nodes free: 6430864

after gc: idd nodes used:51141, unused:63948859; list nodes free:305943870
.............
EG iterations: 120
.-> the formula is FALSE

FORMULA AutoFlight-PT-24a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.162sec

checking: AX [EF [[[p81<=1 & 1<=p81] & [[p479<=1 & 1<=p479] & [[p149<=0 & 0<=p149] | [[p104<=0 & 0<=p104] | [p395<=0 & 0<=p395]]]]]]]
normalized: ~ [EX [~ [E [true U [[[[[p395<=0 & 0<=p395] | [p104<=0 & 0<=p104]] | [p149<=0 & 0<=p149]] & [p479<=1 & 1<=p479]] & [p81<=1 & 1<=p81]]]]]]

abstracting: (1<=p81)
states: 49,526,299,258,642,086,617,132,732,252,160 (31)
abstracting: (p81<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p479)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p479<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (0<=p149)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p149<=0)
states: 99,636,403,327,671,163,198,324,730,757,121 (31)
abstracting: (0<=p104)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p104<=0)
states: 1
abstracting: (0<=p395)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p395<=0)
states: 148,559,610,290,062,761,287,560,533,639,169 (32)
MC time: 4m34.759sec

checking: [A [[~ [[[1<=p353 & p353<=1] & [p144<=1 & 1<=p144]]] | [p156<=1 & 1<=p156]] U EG [[[p59<=1 & 1<=p59] & [p315<=1 & 1<=p315]]]] | EF [AG [AX [[p113<=0 & 0<=p113]]]]]
normalized: [E [true U ~ [E [true U EX [~ [[p113<=0 & 0<=p113]]]]]] | [~ [EG [~ [EG [[[p315<=1 & 1<=p315] & [p59<=1 & 1<=p59]]]]]] & ~ [E [~ [EG [[[p315<=1 & 1<=p315] & [p59<=1 & 1<=p59]]]] U [~ [[[p156<=1 & 1<=p156] | ~ [[[p144<=1 & 1<=p144] & [1<=p353 & p353<=1]]]]] & ~ [EG [[[p315<=1 & 1<=p315] & [p59<=1 & 1<=p59]]]]]]]]]

abstracting: (1<=p59)
states: 49,522,670,109,175,951,058,329,449,529,344 (31)
abstracting: (p59<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p315)
states: 4,584,188,799,329,126,909,409,755,136 (27)
abstracting: (p315<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
..........................................................................................................
EG iterations: 106
abstracting: (p353<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p353)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (1<=p144)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p144<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p156)
states: 48,625,895,604,782,713,768,426,661,216,256 (31)
abstracting: (p156<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p59)
states: 49,522,670,109,175,951,058,329,449,529,344 (31)
abstracting: (p59<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p315)
states: 4,584,188,799,329,126,909,409,755,136 (27)
abstracting: (p315<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
..........................................................................................................
EG iterations: 106
MC time: 4m21.523sec

checking: AF [[EX [AG [[p143<=0 & 0<=p143]]] | AX [AX [[[p136<=1 & 1<=p136] & A [[[p52<=1 & 1<=p52] & [p387<=1 & 1<=p387]] U [[p192<=1 & 1<=p192] & [p497<=1 & 1<=p497]]]]]]]]
normalized: ~ [EG [~ [[~ [EX [EX [~ [[[~ [EG [~ [[[p497<=1 & 1<=p497] & [p192<=1 & 1<=p192]]]]] & ~ [E [~ [[[p497<=1 & 1<=p497] & [p192<=1 & 1<=p192]]] U [~ [[[p52<=1 & 1<=p52] & [p387<=1 & 1<=p387]]] & ~ [[[p497<=1 & 1<=p497] & [p192<=1 & 1<=p192]]]]]]] & [p136<=1 & 1<=p136]]]]]] | EX [~ [E [true U ~ [[p143<=0 & 0<=p143]]]]]]]]]

abstracting: (0<=p143)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (p143<=0)
states: 98,840,618,407,893,078,983,126,726,737,921 (31)
MC time: 3m46.673sec

checking: A [EF [[AG [[p81<=1 & 1<=p81]] & [~ [[[p137<=1 & 1<=p137] & [p352<=1 & 1<=p352]]] | [[[p529<=1 & 1<=p529] & [p534<=1 & 1<=p534]] & [[p171<=1 & 1<=p171] & [p453<=1 & 1<=p453]]]]]] U AX [1<=0]]
normalized: [~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [~ [E [true U [[[[[p453<=1 & 1<=p453] & [p171<=1 & 1<=p171]] & [[p534<=1 & 1<=p534] & [p529<=1 & 1<=p529]]] | ~ [[[p352<=1 & 1<=p352] & [p137<=1 & 1<=p137]]]] & ~ [E [true U ~ [[p81<=1 & 1<=p81]]]]]]] & EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p81)
states: 49,526,299,258,642,086,617,132,732,252,160 (31)
abstracting: (p81<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p137)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p137<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p352)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p352<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p529)
states: 141,868,395,561,647,991,166,205,977,165,824 (32)
abstracting: (p529<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p534)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p534<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p171)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p171<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p453)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p453<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
....
before gc: list nodes free: 16114600

after gc: idd nodes used:197838, unused:63802162; list nodes free:305229347
..
before gc: list nodes free: 4586701

after gc: idd nodes used:1277162, unused:62722838; list nodes free:300076990
.
before gc: list nodes free: 3232456

after gc: idd nodes used:2716246, unused:61283754; list nodes free:293336034
MC time: 3m23.987sec

checking: EF [[E [AF [[[p123<=1 & 1<=p123] & [p300<=1 & 1<=p300]]] U A [[p32<=1 & 1<=p32] U [[p151<=1 & 1<=p151] & [p232<=1 & 1<=p232]]]] & [~ [[p71<=1 & 1<=p71]] & [~ [[p144<=1 & 1<=p144]] | ~ [[p353<=1 & 1<=p353]]]]]]
normalized: E [true U [[~ [[p71<=1 & 1<=p71]] & [~ [[p144<=1 & 1<=p144]] | ~ [[p353<=1 & 1<=p353]]]] & E [~ [EG [~ [[[p300<=1 & 1<=p300] & [p123<=1 & 1<=p123]]]]] U [~ [EG [~ [[[p232<=1 & 1<=p232] & [p151<=1 & 1<=p151]]]]] & ~ [E [~ [[[p232<=1 & 1<=p232] & [p151<=1 & 1<=p151]]] U [~ [[p32<=1 & 1<=p32]] & ~ [[[p232<=1 & 1<=p232] & [p151<=1 & 1<=p151]]]]]]]]]]

abstracting: (1<=p151)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p151<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p232)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p232<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p32)
states: 49,521,012,035,773,977,470,583,303,045,120 (31)
abstracting: (p32<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p151)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p151<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p232)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p232<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p151)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p151<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p232)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p232<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
.........................................................................................................................................................
before gc: list nodes free: 4511956

after gc: idd nodes used:191922, unused:63808078; list nodes free:305287973
.........................................................................................
EG iterations: 242
abstracting: (1<=p123)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p123<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p300)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p300<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
..............................................................................................................................................................................
EG iterations: 174
abstracting: (1<=p353)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p353<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p144)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p144<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p71)
states: 49,523,102,903,779,158,450,963,795,148,800 (31)
abstracting: (p71<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
MC time: 3m 5.705sec

checking: [EG [AX [1<=0]] & EX [[[EF [[[p489<=1 & 1<=p489] & [p535<=1 & 1<=p535]]] & [[p105<=0 & 0<=p105] | [p322<=0 & 0<=p322]]] | [[AX [[[p84<=1 & 1<=p84] & [p480<=1 & 1<=p480]]] & AG [[p162<=1 & 1<=p162]]] | EG [[p160<=1 & 1<=p160]]]]]]
normalized: [EX [[[EG [[p160<=1 & 1<=p160]] | [~ [E [true U ~ [[p162<=1 & 1<=p162]]]] & ~ [EX [~ [[[p480<=1 & 1<=p480] & [p84<=1 & 1<=p84]]]]]]] | [[[p322<=0 & 0<=p322] | [p105<=0 & 0<=p105]] & E [true U [[p535<=1 & 1<=p535] & [p489<=1 & 1<=p489]]]]]] & EG [~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
abstracting: (1<=p489)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p489<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p535)
states: 147,221,430,941,857,569,975,964,929,097,728 (32)
abstracting: (p535<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
MC time: 2m48.471sec

checking: EX [[[AG [[~ [A [[p133<=1 & 1<=p133] U [p136<=1 & 1<=p136]]] | [[p13<=1 & 1<=p13] & [p433<=1 & 1<=p433]]]] | E [[p44<=1 & 1<=p44] U [p371<=1 & 1<=p371]]] | [AF [[[p203<=1 & 1<=p203] & [p522<=1 & 1<=p522]]] | AG [AF [[[p104<=0 & 0<=p104] | [p347<=0 & 0<=p347]]]]]]]
normalized: EX [[[~ [E [true U EG [~ [[[p347<=0 & 0<=p347] | [p104<=0 & 0<=p104]]]]]] | ~ [EG [~ [[[p522<=1 & 1<=p522] & [p203<=1 & 1<=p203]]]]]] | [E [[p44<=1 & 1<=p44] U [p371<=1 & 1<=p371]] | ~ [E [true U ~ [[[[p433<=1 & 1<=p433] & [p13<=1 & 1<=p13]] | ~ [[~ [EG [~ [[p136<=1 & 1<=p136]]]] & ~ [E [~ [[p136<=1 & 1<=p136]] U [~ [[p133<=1 & 1<=p133]] & ~ [[p136<=1 & 1<=p136]]]]]]]]]]]]]]

abstracting: (1<=p136)
states: 49,652,984,522,471,088,426,021,656,985,600 (31)
abstracting: (p136<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p133)
states: 49,653,315,759,334,435,887,872,212,992,000 (31)
abstracting: (p133<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p136)
states: 49,652,984,522,471,088,426,021,656,985,600 (31)
abstracting: (p136<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p136)
states: 49,652,984,522,471,088,426,021,656,985,600 (31)
abstracting: (p136<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
....
before gc: list nodes free: 7427939

after gc: idd nodes used:178776, unused:63821224; list nodes free:305329352
...
before gc: list nodes free: 4538542

after gc: idd nodes used:1688843, unused:62311157; list nodes free:298193516
MC time: 2m32.348sec

checking: [EX [A [AG [~ [[[p65<=1 & 1<=p65] & [p341<=1 & 1<=p341]]]] U ~ [EX [EG [[p179<=1 & 1<=p179]]]]]] | AX [EG [[[~ [E [[p90<=1 & 1<=p90] U [[p129<=1 & 1<=p129] & [p513<=1 & 1<=p513]]]] & [p81<=0 & 0<=p81]] & [[[p158<=0 & 0<=p158] | [p355<=0 & 0<=p355]] & [[p208<=0 & 0<=p208] & [[p489<=0 & 0<=p489] | [p535<=0 & 0<=p535]]]]]]]]
normalized: [~ [EX [~ [EG [[[[p81<=0 & 0<=p81] & ~ [E [[p90<=1 & 1<=p90] U [[p513<=1 & 1<=p513] & [p129<=1 & 1<=p129]]]]] & [[[p158<=0 & 0<=p158] | [p355<=0 & 0<=p355]] & [[[p489<=0 & 0<=p489] | [p535<=0 & 0<=p535]] & [p208<=0 & 0<=p208]]]]]]]] | EX [[~ [EG [EX [EG [[p179<=1 & 1<=p179]]]]] & ~ [E [EX [EG [[p179<=1 & 1<=p179]]] U [EX [EG [[p179<=1 & 1<=p179]]] & E [true U [[p341<=1 & 1<=p341] & [p65<=1 & 1<=p65]]]]]]]]]

abstracting: (1<=p65)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p65<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p341)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p341<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
MC time: 2m19.739sec

checking: A [~ [AG [A [[p3<=1 & 1<=p3] U AG [[[p158<=1 & 1<=p158] & [p403<=1 & 1<=p403]]]]]] U AG [~ [[[A [[[p144<=1 & 1<=p144] & [p401<=1 & 1<=p401]] U [p156<=1 & 1<=p156]] & AF [[p74<=1 & 1<=p74]]] & [[[[p7<=1 & 1<=p7] & [p380<=1 & 1<=p380]] | [[p21<=1 & 1<=p21] & [p309<=1 & 1<=p309]]] & A [[[p449<=1 & 1<=p449] & [p535<=1 & 1<=p535]] U E [[[p6<=1 & 1<=p6] & [p429<=1 & 1<=p429]] U [p6<=1 & 1<=p6]]]]]]]]
normalized: [~ [EG [E [true U [[[[[p309<=1 & 1<=p309] & [p21<=1 & 1<=p21]] | [[p380<=1 & 1<=p380] & [p7<=1 & 1<=p7]]] & [~ [EG [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]] & ~ [E [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]] U [~ [[[p535<=1 & 1<=p535] & [p449<=1 & 1<=p449]]] & ~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]]]]] & [~ [EG [~ [[p74<=1 & 1<=p74]]]] & [~ [EG [~ [[p156<=1 & 1<=p156]]]] & ~ [E [~ [[p156<=1 & 1<=p156]] U [~ [[[p401<=1 & 1<=p401] & [p144<=1 & 1<=p144]]] & ~ [[p156<=1 & 1<=p156]]]]]]]]]]] & ~ [E [E [true U [[[[[p309<=1 & 1<=p309] & [p21<=1 & 1<=p21]] | [[p380<=1 & 1<=p380] & [p7<=1 & 1<=p7]]] & [~ [EG [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]] & ~ [E [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]] U [~ [[[p535<=1 & 1<=p535] & [p449<=1 & 1<=p449]]] & ~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]]]]] & [~ [EG [~ [[p74<=1 & 1<=p74]]]] & [~ [EG [~ [[p156<=1 & 1<=p156]]]] & ~ [E [~ [[p156<=1 & 1<=p156]] U [~ [[[p401<=1 & 1<=p401] & [p144<=1 & 1<=p144]]] & ~ [[p156<=1 & 1<=p156]]]]]]]]] U [~ [E [true U ~ [[~ [EG [E [true U ~ [[[p403<=1 & 1<=p403] & [p158<=1 & 1<=p158]]]]]] & ~ [E [E [true U ~ [[[p403<=1 & 1<=p403] & [p158<=1 & 1<=p158]]]] U [~ [[p3<=1 & 1<=p3]] & E [true U ~ [[[p403<=1 & 1<=p403] & [p158<=1 & 1<=p158]]]]]]]]]]] & E [true U [[[[[p309<=1 & 1<=p309] & [p21<=1 & 1<=p21]] | [[p380<=1 & 1<=p380] & [p7<=1 & 1<=p7]]] & [~ [EG [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]] & ~ [E [~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]] U [~ [[[p535<=1 & 1<=p535] & [p449<=1 & 1<=p449]]] & ~ [E [[[p429<=1 & 1<=p429] & [p6<=1 & 1<=p6]] U [p6<=1 & 1<=p6]]]]]]]] & [~ [EG [~ [[p74<=1 & 1<=p74]]]] & [~ [EG [~ [[p156<=1 & 1<=p156]]]] & ~ [E [~ [[p156<=1 & 1<=p156]] U [~ [[[p401<=1 & 1<=p401] & [p144<=1 & 1<=p144]]] & ~ [[p156<=1 & 1<=p156]]]]]]]]]]]]]

abstracting: (1<=p156)
states: 48,625,895,604,782,713,768,426,661,216,256 (31)
abstracting: (p156<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p144)
states: 148,559,689,786,909,964,678,404,667,080,704 (32)
abstracting: (p144<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p401)
states: 79,496,847,203,390,844,133,441,536 (25)
abstracting: (p401<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p156)
states: 48,625,895,604,782,713,768,426,661,216,256 (31)
abstracting: (p156<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p156)
states: 48,625,895,604,782,713,768,426,661,216,256 (31)
abstracting: (p156<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
.
EG iterations: 1
abstracting: (1<=p74)
states: 49,510,529,411,225,288,289,321,259,892,736 (31)
abstracting: (p74<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
.
EG iterations: 1
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p429)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p429<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p449)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p449<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p535)
states: 147,221,430,941,857,569,975,964,929,097,728 (32)
abstracting: (p535<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p429)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p429<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p6)
states: 49,520,850,557,803,095,582,931,156,992,000 (31)
abstracting: (p6<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
abstracting: (1<=p429)
states: 1,338,258,845,052,394,702,439,737,982,976 (30)
abstracting: (p429<=1)
states: 148,559,689,786,909,964,678,404,667,080,705 (32)
.....
before gc: list nodes free: 7389812

after gc: idd nodes used:516781, unused:63483219; list nodes free:303745174
.
before gc: list nodes free: 4065604

after gc: idd nodes used:1404835, unused:62595165; list nodes free:299441650
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5800028 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099340 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.014sec


iterations count:77349 (165), effective:4645 (9)

initing FirstDep: 0m 0.001sec


net_ddint.h:600: Timeout: after 275 sec


iterations count:480 (1), effective:1 (0)

sat_reach.icc:155: Timeout: after 275 sec


iterations count:553 (1), effective:9 (0)

sat_reach.icc:155: Timeout: after 272 sec


sat_reach.icc:155: Timeout: after 247 sec


sat_reach.icc:155: Timeout: after 223 sec


iterations count:2634 (5), effective:101 (0)

iterations count:468 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 202 sec


iterations count:469 (1), effective:1 (0)

iterations count:468 (1), effective:0 (0)

sat_reach.icc:155: Timeout: after 184 sec


sat_reach.icc:155: Timeout: after 167 sec


iterations count:470 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 151 sec


sat_reach.icc:155: Timeout: after 138 sec


iterations count:473 (1), effective:1 (0)

iterations count:468 (1), effective:0 (0)

iterations count:468 (1), effective:0 (0)

iterations count:481 (1), effective:1 (0)

iterations count:468 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 125 sec

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="AutoFlight-PT-24a"
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 AutoFlight-PT-24a, 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 r010-oct2-167813599100482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24a.tgz
mv AutoFlight-PT-24a 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 ;