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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 23K 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 AutonomousCar-PT-02a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-02a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678698717098

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=AutonomousCar-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:11:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:11:59] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-13 09:11:59] [INFO ] Transformed 33 places.
[2023-03-13 09:11:59] [INFO ] Transformed 69 transitions.
[2023-03-13 09:11:59] [INFO ] Found NUPN structural information;
[2023-03-13 09:11:59] [INFO ] Parsed PT model containing 33 places and 69 transitions and 368 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
Support contains 29 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-13 09:11:59] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 33 cols
[2023-03-13 09:11:59] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-13 09:11:59] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-13 09:11:59] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
[2023-03-13 09:11:59] [INFO ] Invariant cache hit.
[2023-03-13 09:12:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 09:12:00] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 543 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 32/33 places, 46/46 transitions.
Support contains 29 out of 32 places after structural reductions.
[2023-03-13 09:12:00] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:12:00] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:12:00] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 637 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 57) seen :49
Incomplete Best-First random walk after 10001 steps, including 588 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 09:12:01] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 32 cols
[2023-03-13 09:12:01] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 09:12:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 09:12:01] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-02a-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 46/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 45
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 31 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 30 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 29 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 26 transition count 36
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 26 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 25 transition count 35
Applied a total of 14 rules in 12 ms. Remains 25 /32 variables (removed 7) and now considering 35/46 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 25/32 places, 35/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 45
Applied a total of 2 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 45/46 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 45/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 1 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/32 places, 39/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 30 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 42
Applied a total of 4 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/32 places, 42/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 46/46 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 32 transition count 42
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 28 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 28 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 26 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 26 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 25 transition count 39
Applied a total of 14 rules in 5 ms. Remains 25 /32 variables (removed 7) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 25/32 places, 39/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 45
Applied a total of 2 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 45/46 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 45/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 1 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/32 places, 39/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 28 transition count 38
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 26 transition count 36
Applied a total of 12 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 36/46 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 26/32 places, 36/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 30 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 42
Applied a total of 4 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/32 places, 42/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 45
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 31 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 30 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 28 transition count 40
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 28 transition count 40
Applied a total of 8 rules in 4 ms. Remains 28 /32 variables (removed 4) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 28/32 places, 40/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 1 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/32 places, 39/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 0 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 29/32 places, 39/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 43
Applied a total of 2 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 43/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 46/46 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 32 transition count 44
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 30 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 29 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 28 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 27 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 27 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 26 transition count 40
Applied a total of 12 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 26/32 places, 40/46 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:12:01] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-13 09:12:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 46 transitions and 223 arcs took 2 ms.
Total runtime 2250 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: 32 NrTr: 46 NrArc: 223)

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

net check time: 0m 0.000sec

init dd package: 0m 2.858sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 434 (4.3e+02) #states 2,314 (3)



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

checking: EG [EX [EF [AX [[p18<=0 & 0<=p18]]]]]
normalized: EG [EX [E [true U ~ [EX [~ [[p18<=0 & 0<=p18]]]]]]]

abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
.........................
EG iterations: 23
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AX [AG [[p0<=0 & 0<=p0]]]
normalized: ~ [EX [E [true U ~ [[p0<=0 & 0<=p0]]]]]

abstracting: (0<=p0)
states: 2,314 (3)
abstracting: (p0<=0)
states: 2,313 (3)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
..-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AG [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]]] U ~ [EX [0<=0]]]
normalized: E [~ [E [true U ~ [[[[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] U ~ [EX [0<=0]]]

abstracting: (0<=0)
states: 2,314 (3)
.abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[EG [[p8<=0 & 0<=p8]] | AF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p17<=1 & 1<=p17] & [p25<=1 & 1<=p25]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[[p25<=1 & 1<=p25] & [p17<=1 & 1<=p17]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | EG [[p8<=0 & 0<=p8]]]]]]

abstracting: (0<=p8)
states: 2,314 (3)
abstracting: (p8<=0)
states: 2,036 (3)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.
EG iterations: 1
......................
EG iterations: 22
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [~ [A [[[p14<=1 & 1<=p14] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]]] U ~ [AG [[[p27<=1 & 1<=p27] & [p30<=1 & 1<=p30]]]]]]]
normalized: E [true U ~ [[~ [EG [~ [E [true U ~ [[[p30<=1 & 1<=p30] & [p27<=1 & 1<=p27]]]]]]] & ~ [E [~ [E [true U ~ [[[p30<=1 & 1<=p30] & [p27<=1 & 1<=p27]]]]] U [~ [[[[[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]] & [[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]]] | [p14<=1 & 1<=p14]]] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] & [p27<=1 & 1<=p27]]]]]]]]]]]

abstracting: (1<=p27)
states: 438
abstracting: (p27<=1)
states: 2,314 (3)
abstracting: (1<=p30)
states: 1,170 (3)
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p27)
states: 438
abstracting: (p27<=1)
states: 2,314 (3)
abstracting: (1<=p30)
states: 1,170 (3)
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (1<=p27)
states: 438
abstracting: (p27<=1)
states: 2,314 (3)
abstracting: (1<=p30)
states: 1,170 (3)
abstracting: (p30<=1)
states: 2,314 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [EX [[E [[p8<=1 & 1<=p8] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p13<=1 & 1<=p13] & [p25<=1 & 1<=p25]]]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]]]]]]
normalized: ~ [EG [~ [EX [[[[[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | E [[p8<=1 & 1<=p8] U [[[p25<=1 & 1<=p25] & [p13<=1 & 1<=p13]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.....
EG iterations: 4
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [EF [[[E [[p22<=1 & 1<=p22] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]]] | AG [[p14<=0 & 0<=p14]]] | [[p7<=1 & 1<=p7] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]]]]]]
normalized: EG [E [true U [[~ [E [true U ~ [[p14<=0 & 0<=p14]]]] | E [[p22<=1 & 1<=p22] U [[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] | [[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] | [p7<=1 & 1<=p7]]]]]

abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p22)
states: 98
abstracting: (p22<=1)
states: 2,314 (3)
abstracting: (0<=p14)
states: 2,314 (3)
abstracting: (p14<=0)
states: 2,024 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: E [AG [A [EF [~ [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p10<=1 & 1<=p10] & [p25<=1 & 1<=p25]]]]] U EX [E [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p10<=1 & 1<=p10] & [p25<=1 & 1<=p25]]] U [[p9<=1 & 1<=p9] & [[p19<=1 & 1<=p19] & [1<=p26 & p26<=1]]]]]]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]]]
normalized: E [~ [E [true U ~ [[~ [EG [~ [EX [E [[[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U [[[1<=p26 & p26<=1] & [p19<=1 & 1<=p19]] & [p9<=1 & 1<=p9]]]]]]] & ~ [E [~ [EX [E [[[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U [[[1<=p26 & p26<=1] & [p19<=1 & 1<=p19]] & [p9<=1 & 1<=p9]]]]] U [~ [E [true U ~ [[[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] & ~ [EX [E [[[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U [[[1<=p26 & p26<=1] & [p19<=1 & 1<=p19]] & [p9<=1 & 1<=p9]]]]]]]]]]]] U [[[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p9)
states: 437
abstracting: (p9<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p9)
states: 437
abstracting: (p9<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.abstracting: (1<=p9)
states: 437
abstracting: (p9<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
......
EG iterations: 5
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EG [AF [[[EX [E [[p23<=1 & 1<=p23] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] & [p0<=0 & 0<=p0]] & [[p29<=1 & 1<=p29] & [[EX [[p3<=1 & 1<=p3]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p13<=1 & 1<=p13] & [[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]]]]] & [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]]]]]]]]
normalized: EG [~ [EG [~ [[[[[[[[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | [[[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] & [[[[[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]] & [p13<=1 & 1<=p13]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | EX [[p3<=1 & 1<=p3]]]] & [p29<=1 & 1<=p29]] & [[p0<=0 & 0<=p0] & EX [E [[p23<=1 & 1<=p23] U [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p23)
states: 236
abstracting: (p23<=1)
states: 2,314 (3)
.abstracting: (0<=p0)
states: 2,314 (3)
abstracting: (p0<=0)
states: 2,313 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (1<=p3)
states: 539
abstracting: (p3<=1)
states: 2,314 (3)
.abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [E [[[p21<=1 & 1<=p21] | EF [~ [AG [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]]]]]]] U [p14<=1 & 1<=p14]] U [A [[E [[p7<=1 & 1<=p7] U [[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p25<=1 & 1<=p25] & [p29<=1 & 1<=p29]]]] | AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] U ~ [AF [[[p12<=1 & 1<=p12] & [[p19<=1 & 1<=p19] & [p26<=1 & 1<=p26]]]]]] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] U [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] & ~ [[~ [EX [~ [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | E [[p7<=1 & 1<=p7] U [[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]]]]]] | [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[~ [EG [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] U [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] & ~ [[~ [EX [~ [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | E [[p7<=1 & 1<=p7] U [[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]]]]]] | [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] U [~ [[[~ [EG [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] U [~ [EG [~ [[[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]]]]] & ~ [[~ [EX [~ [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | E [[p7<=1 & 1<=p7] U [[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]]]]]] | [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & ~ [E [[E [true U E [true U ~ [[[[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | [p21<=1 & 1<=p21]] U [p14<=1 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
.......
EG iterations: 7
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
.......
EG iterations: 7
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
......
EG iterations: 6
.......
EG iterations: 7
.......
EG iterations: 7
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]] U ~ [[E [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]] U [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p25<=1 & 1<=p25] & [p29<=1 & 1<=p29]]] | [[[p23<=1 & 1<=p23] & [p18<=1 & 1<=p18]] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p13<=1 & 1<=p13] & [p25<=1 & 1<=p25]]]]]] | E [~ [[p8<=1 & 1<=p8]] U EG [[[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p10<=1 & 1<=p10] & [p25<=1 & 1<=p25]]] & [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]]]]]]
normalized: E [[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U ~ [[E [~ [[p8<=1 & 1<=p8]] U EG [[[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] & [[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] | E [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] U [[[[[p25<=1 & 1<=p25] & [p13<=1 & 1<=p13]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] | [[p18<=1 & 1<=p18] & [p23<=1 & 1<=p23]]] | [[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (1<=p23)
states: 236
abstracting: (p23<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[AF [AG [AF [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]]]]]] | [~ [A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p25<=1 & 1<=p25]]] U [~ [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]]]]] & [[~ [A [A [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p13<=1 & 1<=p13] & [p25<=1 & 1<=p25]]]] U EX [[p0<=1 & 1<=p0]]]] | [p1<=0 & 0<=p1]] | [[p5<=0 & 0<=p5] | [[p17<=0 & 0<=p17] | [p25<=0 & 0<=p25]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p25<=0 & 0<=p25] | [p17<=0 & 0<=p17]] | [p5<=0 & 0<=p5]] | [[p1<=0 & 0<=p1] | ~ [[~ [EG [~ [EX [[p0<=1 & 1<=p0]]]]] & ~ [E [~ [EX [[p0<=1 & 1<=p0]]] U [~ [[~ [EG [~ [[[[p25<=1 & 1<=p25] & [p13<=1 & 1<=p13]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p25<=1 & 1<=p25] & [p13<=1 & 1<=p13]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] U [~ [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] & ~ [[[[p25<=1 & 1<=p25] & [p13<=1 & 1<=p13]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [EX [[p0<=1 & 1<=p0]]]]]]]]]] & ~ [[~ [EG [~ [[[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | ~ [[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]] & ~ [E [~ [[[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | ~ [[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] U [~ [[[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | ~ [[[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]]]] | ~ [EG [E [true U EG [~ [[[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
.......
EG iterations: 7

EG iterations: 0
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
....
EG iterations: 4
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,314 (3)
.abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,314 (3)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,314 (3)
.
EG iterations: 0
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 2,314 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (0<=p17)
states: 2,314 (3)
abstracting: (p17<=0)
states: 2,024 (3)
abstracting: (0<=p25)
states: 2,314 (3)
abstracting: (p25<=0)
states: 1,396 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[[EF [[[[1<=p1 & p1<=1] & [p2<=1 & 1<=p2]] & [[p17<=1 & 1<=p17] & [p25<=1 & 1<=p25]]]] & [p1<=1 & 1<=p1]] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]] & [[[p25<=1 & 1<=p25] & [EG [[p14<=0 & 0<=p14]] | AF [[p17<=0 & 0<=p17]]]] & [[EG [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p18<=1 & 1<=p18] & [[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]]]]] | [[p13<=1 & 1<=p13] & AF [[p21<=1 & 1<=p21]]]] & [[E [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [p25<=1 & 1<=p25]]]] | EX [[p18<=0 & 0<=p18]]] & [[[p1<=0 & 0<=p1] | [p5<=0 & 0<=p5]] | [[p17<=0 & 0<=p17] | [p25<=0 & 0<=p25]]]]]]]]
normalized: E [true U [[[[[[[p25<=0 & 0<=p25] | [p17<=0 & 0<=p17]] | [[p5<=0 & 0<=p5] | [p1<=0 & 0<=p1]]] & [EX [[p18<=0 & 0<=p18]] | E [[[[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] U [[[p25<=1 & 1<=p25] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & [[~ [EG [~ [[p21<=1 & 1<=p21]]]] & [p13<=1 & 1<=p13]] | EG [[[[[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]] & [p18<=1 & 1<=p18]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & [[~ [EG [~ [[p17<=0 & 0<=p17]]]] | EG [[p14<=0 & 0<=p14]]] & [p25<=1 & 1<=p25]]] & [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [[p1<=1 & 1<=p1] & E [true U [[[p25<=1 & 1<=p25] & [p17<=1 & 1<=p17]] & [[p2<=1 & 1<=p2] & [1<=p1 & p1<=1]]]]]]]]

abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (0<=p14)
states: 2,314 (3)
abstracting: (p14<=0)
states: 2,024 (3)
.
EG iterations: 1
abstracting: (0<=p17)
states: 2,314 (3)
abstracting: (p17<=0)
states: 2,024 (3)
........
EG iterations: 8
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
..
EG iterations: 2
abstracting: (1<=p13)
states: 290
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
.abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 2,314 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (0<=p17)
states: 2,314 (3)
abstracting: (p17<=0)
states: 2,024 (3)
abstracting: (0<=p25)
states: 2,314 (3)
abstracting: (p25<=0)
states: 1,396 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [~ [E [[[[[[p22<=1 & 1<=p22] & [[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]]] & [[[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]] & [[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]]]] & [[[p15<=1 & 1<=p15] & [[p25<=1 & 1<=p25] & [p1<=1 & 1<=p1]]] & [[[p2<=1 & 1<=p2] & [p6<=1 & 1<=p6]] & [[p25<=1 & 1<=p25] & [p7<=1 & 1<=p7]]]]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p17<=1 & 1<=p17] & [p25<=1 & 1<=p25]]]] U [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]]] | AG [[[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p11<=1 & 1<=p11] & [p25<=1 & 1<=p25]]] & [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p17<=1 & 1<=p17] & [p25<=1 & 1<=p25]]]]]]]]]
normalized: EG [~ [E [[[[[p25<=1 & 1<=p25] & [p17<=1 & 1<=p17]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | [[[[[p7<=1 & 1<=p7] & [p25<=1 & 1<=p25]] & [[p6<=1 & 1<=p6] & [p2<=1 & 1<=p2]]] & [[[p1<=1 & 1<=p1] & [p25<=1 & 1<=p25]] & [p15<=1 & 1<=p15]]] & [[[[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]] & [[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]]] & [[[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]] & [p22<=1 & 1<=p22]]]]] U [~ [E [true U ~ [[[[[p25<=1 & 1<=p25] & [p17<=1 & 1<=p17]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] & [[[p25<=1 & 1<=p25] & [p11<=1 & 1<=p11]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]] | [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p22)
states: 98
abstracting: (p22<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p1<=1)
states: 2,314 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
....
EG iterations: 4
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 85143 (8.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 124152 288680 412832
used/not used/entry size/cache size: 371223 66737641 16 1024MB
basic ops cache: hits/miss/sum: 29114 65805 94919
used/not used/entry size/cache size: 120650 16656566 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: 1688 3052 4740
used/not used/entry size/cache size: 3052 8385556 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 67024845
1 82917
2 1080
3 22
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.475sec


BK_STOP 1678698727416

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

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


initing FirstDep: 0m 0.000sec


iterations count:1345 (29), effective:164 (3)

initing FirstDep: 0m 0.000sec


iterations count:102 (2), effective:12 (0)

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

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

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

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

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

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

iterations count:51 (1), effective:3 (0)

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

iterations count:442 (9), effective:41 (0)

iterations count:443 (9), effective:44 (0)

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

iterations count:99 (2), effective:4 (0)

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

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

iterations count:149 (3), effective:17 (0)

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

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

iterations count:146 (3), effective:6 (0)

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

iterations count:442 (9), effective:41 (0)

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

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

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

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

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

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

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

iterations count:396 (8), effective:47 (1)

iterations count:67 (1), effective:6 (0)

iterations count:236 (5), effective:19 (0)

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

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

iterations count:94 (2), effective:4 (0)

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

iterations count:635 (13), effective:69 (1)

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

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

iterations count:46 (1), effective:0 (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="AutonomousCar-PT-02a"
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 AutonomousCar-PT-02a, 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-167813599200546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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