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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-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:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 114K 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-05a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-05a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678699430176

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-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:23:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:23:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:23:52] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-13 09:23:52] [INFO ] Transformed 57 places.
[2023-03-13 09:23:52] [INFO ] Transformed 289 transitions.
[2023-03-13 09:23:52] [INFO ] Found NUPN structural information;
[2023-03-13 09:23:53] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
Support contains 45 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 57 /57 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-13 09:23:53] [INFO ] Flow matrix only has 175 transitions (discarded 1 similar events)
// Phase 1: matrix 175 rows 57 cols
[2023-03-13 09:23:53] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-13 09:23:53] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-13 09:23:53] [INFO ] Flow matrix only has 175 transitions (discarded 1 similar events)
[2023-03-13 09:23:53] [INFO ] Invariant cache hit.
[2023-03-13 09:23:53] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-13 09:23:53] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 520 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 541 ms. Remains : 56/57 places, 176/176 transitions.
Support contains 45 out of 56 places after structural reductions.
[2023-03-13 09:23:53] [INFO ] Flatten gal took : 111 ms
[2023-03-13 09:23:54] [INFO ] Flatten gal took : 76 ms
[2023-03-13 09:23:54] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 574 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 71) seen :60
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 09:23:54] [INFO ] Flow matrix only has 175 transitions (discarded 1 similar events)
// Phase 1: matrix 175 rows 56 cols
[2023-03-13 09:23:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-13 09:23:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 09:23:55] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:1
[2023-03-13 09:23:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-13 09:23:55] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-13 09:23:55] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-13 09:23:55] [INFO ] After 44ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-13 09:23:55] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-13 09:23:55] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 176/176 transitions.
Graph (complete) has 390 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 52 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 50 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 50 transition count 166
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 49 transition count 166
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 20 place count 43 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 43 transition count 135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 40 transition count 132
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 40 transition count 129
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 43 place count 37 transition count 124
Applied a total of 43 rules in 38 ms. Remains 37 /56 variables (removed 19) and now considering 124/176 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 37/56 places, 124/176 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57459 steps, run visited all 1 properties in 84 ms. (steps per millisecond=684 )
Probabilistic random walk after 57459 steps, saw 10430 distinct states, run finished after 84 ms. (steps per millisecond=684 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:23:55] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 151
Applied a total of 10 rules in 2 ms. Remains 51 /56 variables (removed 5) and now considering 151/176 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/56 places, 151/176 transitions.
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:23:55] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 151
Applied a total of 10 rules in 2 ms. Remains 51 /56 variables (removed 5) and now considering 151/176 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/56 places, 151/176 transitions.
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:23:55] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 170
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 50 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 45 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 45 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 42 transition count 142
Applied a total of 28 rules in 15 ms. Remains 42 /56 variables (removed 14) and now considering 142/176 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 42/56 places, 142/176 transitions.
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:23:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:23:55] [INFO ] Input system was already deterministic with 142 transitions.
Finished random walk after 182 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
FORMULA AutonomousCar-PT-05a-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 56 transition count 173
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 53 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 52 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 52 transition count 171
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 10 place count 51 transition count 171
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 16 place count 45 transition count 140
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 45 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 43 transition count 138
Applied a total of 26 rules in 12 ms. Remains 43 /56 variables (removed 13) and now considering 138/176 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 43/56 places, 138/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 169
Applied a total of 4 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 169/176 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/56 places, 169/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 157
Applied a total of 8 rules in 2 ms. Remains 52 /56 variables (removed 4) and now considering 157/176 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/56 places, 157/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 56 transition count 171
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 51 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 50 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 46 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 46 transition count 146
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 22 place count 45 transition count 145
Applied a total of 22 rules in 27 ms. Remains 45 /56 variables (removed 11) and now considering 145/176 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 45/56 places, 145/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 151
Applied a total of 10 rules in 2 ms. Remains 51 /56 variables (removed 5) and now considering 151/176 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/56 places, 151/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 56 transition count 171
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 51 transition count 171
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 45 transition count 140
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 45 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 42 transition count 137
Applied a total of 28 rules in 9 ms. Remains 42 /56 variables (removed 14) and now considering 137/176 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 42/56 places, 137/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 170
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 50 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 45 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 45 transition count 145
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 26 place count 43 transition count 143
Applied a total of 26 rules in 11 ms. Remains 43 /56 variables (removed 13) and now considering 143/176 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 43/56 places, 143/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 143 transitions.
Finished random walk after 254 steps, including 20 resets, run visited all 1 properties in 2 ms. (steps per millisecond=127 )
FORMULA AutonomousCar-PT-05a-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 170
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 50 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 45 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 45 transition count 145
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 26 place count 43 transition count 143
Applied a total of 26 rules in 10 ms. Remains 43 /56 variables (removed 13) and now considering 143/176 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 43/56 places, 143/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 143 transitions.
Finished random walk after 448 steps, including 30 resets, run visited all 1 properties in 3 ms. (steps per millisecond=149 )
FORMULA AutonomousCar-PT-05a-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 50 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 50 transition count 145
Applied a total of 12 rules in 2 ms. Remains 50 /56 variables (removed 6) and now considering 145/176 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/56 places, 145/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 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 56 transition count 172
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 52 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 50 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 46 transition count 151
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 46 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 44 transition count 149
Applied a total of 24 rules in 10 ms. Remains 44 /56 variables (removed 12) and now considering 149/176 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 44/56 places, 149/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 151
Applied a total of 10 rules in 1 ms. Remains 51 /56 variables (removed 5) and now considering 151/176 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 51/56 places, 151/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 56 transition count 171
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 51 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 51 transition count 170
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 12 place count 50 transition count 170
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 44 transition count 139
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 44 transition count 139
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 28 place count 42 transition count 137
Applied a total of 28 rules in 10 ms. Remains 42 /56 variables (removed 14) and now considering 137/176 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 42/56 places, 137/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 176/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 169
Applied a total of 4 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 169/176 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/56 places, 169/176 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:23:56] [INFO ] Input system was already deterministic with 169 transitions.
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:23:56] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:23:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-13 09:23:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 56 places, 176 transitions and 1293 arcs took 1 ms.
Total runtime 4221 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: 56 NrTr: 176 NrArc: 1293)

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

net check time: 0m 0.000sec

init dd package: 0m 2.903sec


RS generation: 0m 1.332sec


-> reachability set: #nodes 7460 (7.5e+03) #states 1,803,067 (6)



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

checking: AF [EX [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p41<=1 & 1<=p41] & [p49<=1 & 1<=p49]]]]]
normalized: ~ [EG [~ [EX [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p41<=1 & 1<=p41] & [p49<=1 & 1<=p49]]]]]]]

abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p41)
states: 245,135 (5)
abstracting: (p41<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
.........
EG iterations: 8
-> the formula is FALSE

FORMULA AutonomousCar-PT-05a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.455sec

checking: AF [[~ [[p48<=1 & 1<=p48]] & [AF [[p45<=1 & 1<=p45]] & [[~ [[p1<=1 & 1<=p1]] | ~ [[p2<=1 & 1<=p2]]] | [~ [[p25<=1 & 1<=p25]] | ~ [[p49<=1 & 1<=p49]]]]]]]
normalized: ~ [EG [~ [[~ [[p48<=1 & 1<=p48]] & [~ [EG [~ [[p45<=1 & 1<=p45]]]] & [[~ [[p25<=1 & 1<=p25]] | ~ [[p49<=1 & 1<=p49]]] | [~ [[p1<=1 & 1<=p1]] | ~ [[p2<=1 & 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p25)
states: 240,719 (5)
abstracting: (p25<=1)
states: 1,803,067 (6)
abstracting: (1<=p45)
states: 33,614 (4)
abstracting: (p45<=1)
states: 1,803,067 (6)
.
EG iterations: 1
abstracting: (1<=p48)
states: 335,120 (5)
abstracting: (p48<=1)
states: 1,803,067 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.120sec

checking: AG [EF [[[[p12<=0 & 0<=p12] | [[p19<=0 & 0<=p19] | [p26<=0 & 0<=p26]]] | [[p36<=0 & 0<=p36] | [[p43<=0 & 0<=p43] | [p50<=0 & 0<=p50]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[p50<=0 & 0<=p50] | [p43<=0 & 0<=p43]] | [p36<=0 & 0<=p36]] | [[[p26<=0 & 0<=p26] | [p19<=0 & 0<=p19]] | [p12<=0 & 0<=p12]]]]]]]

abstracting: (0<=p12)
states: 1,803,067 (6)
abstracting: (p12<=0)
states: 1,512,164 (6)
abstracting: (0<=p19)
states: 1,803,067 (6)
abstracting: (p19<=0)
states: 1,512,164 (6)
abstracting: (0<=p26)
states: 1,803,067 (6)
abstracting: (p26<=0)
states: 1,512,164 (6)
abstracting: (0<=p36)
states: 1,803,067 (6)
abstracting: (p36<=0)
states: 1,512,163 (6)
abstracting: (0<=p43)
states: 1,803,067 (6)
abstracting: (p43<=0)
states: 1,512,163 (6)
abstracting: (0<=p50)
states: 1,803,067 (6)
abstracting: (p50<=0)
states: 1,333,490 (6)
-> the formula is TRUE

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

MC time: 0m 0.135sec

checking: [AG [[[[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]] | [[p14<=0 & 0<=p14] | [p49<=0 & 0<=p49]]]] & EG [[[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p9<=0 & 0<=p9] | [p49<=0 & 0<=p49]]]]]
normalized: [EG [[[[p49<=0 & 0<=p49] | [p9<=0 & 0<=p9]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]]] & ~ [E [true U ~ [[[[p49<=0 & 0<=p49] | [p14<=0 & 0<=p14]] | [[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]]]]]]]

abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p8)
states: 1,803,067 (6)
abstracting: (p8<=0)
states: 1,534,592 (6)
abstracting: (0<=p14)
states: 1,803,067 (6)
abstracting: (p14<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 1,803,067 (6)
abstracting: (p6<=0)
states: 1,513,802 (6)
abstracting: (0<=p9)
states: 1,803,067 (6)
abstracting: (p9<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
..
EG iterations: 2
-> the formula is FALSE

FORMULA AutonomousCar-PT-05a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.182sec

checking: [EF [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p9<=1 & 1<=p9] & [p49<=1 & 1<=p49]]]] & ~ [A [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]] U AG [[[[p15<=1 & 1<=p15] & [[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]] & [[p36<=1 & 1<=p36] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]]]]]]
normalized: [~ [[~ [EG [E [true U ~ [[[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p36<=1 & 1<=p36]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p15<=1 & 1<=p15]]]]]]] & ~ [E [E [true U ~ [[[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p36<=1 & 1<=p36]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p15<=1 & 1<=p15]]]]] U [~ [[[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]] & E [true U ~ [[[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p36<=1 & 1<=p36]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p15<=1 & 1<=p15]]]]]]]]]] & E [true U [[[p49<=1 & 1<=p49] & [p9<=1 & 1<=p9]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]

abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p9)
states: 245,135 (5)
abstracting: (p9<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p35)
states: 245,135 (5)
abstracting: (p35<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.912sec

checking: [AG [[[p34<=1 & 1<=p34] | AF [[[[[[p1<=0 & 0<=p1] | [p5<=0 & 0<=p5]] | [[p35<=0 & 0<=p35] | [p49<=0 & 0<=p49]]] & [[p11<=0 & 0<=p11] & [p1<=1 & 1<=p1]]] & [[p2<=1 & 1<=p2] & [[p21<=1 & 1<=p21] & [p49<=1 & 1<=p49]]]]]]] | EG [EF [AG [[[[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]] | [[p32<=0 & 0<=p32] | [p49<=0 & 0<=p49]]]]]]]
normalized: [EG [E [true U ~ [E [true U ~ [[[[p49<=0 & 0<=p49] | [p32<=0 & 0<=p32]] | [[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[[[p49<=1 & 1<=p49] & [p21<=1 & 1<=p21]] & [p2<=1 & 1<=p2]] & [[[p1<=1 & 1<=p1] & [p11<=0 & 0<=p11]] & [[[p49<=0 & 0<=p49] | [p35<=0 & 0<=p35]] | [[p5<=0 & 0<=p5] | [p1<=0 & 0<=p1]]]]]]]] | [p34<=1 & 1<=p34]]]]]]

abstracting: (1<=p34)
states: 245,135 (5)
abstracting: (p34<=1)
states: 1,803,067 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 1,803,067 (6)
abstracting: (p5<=0)
states: 1,513,802 (6)
abstracting: (0<=p35)
states: 1,803,067 (6)
abstracting: (p35<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p11)
states: 1,803,067 (6)
abstracting: (p11<=0)
states: 1,562,348 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.....
EG iterations: 5
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p8)
states: 1,803,067 (6)
abstracting: (p8<=0)
states: 1,534,592 (6)
abstracting: (0<=p32)
states: 1,803,067 (6)
abstracting: (p32<=0)
states: 1,562,348 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 5.181sec

checking: EX [EF [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p27<=1 & 1<=p27] & [[p49<=1 & 1<=p49] & [AF [[[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p14<=0 & 0<=p14] | [p49<=0 & 0<=p49]]]] | AX [EX [[[[p12<=1 & 1<=p12] & [[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]] & [[p36<=1 & 1<=p36] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]]]]]]]]]]
normalized: EX [E [true U [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[[~ [EG [~ [[[[p14<=0 & 0<=p14] | [p49<=0 & 0<=p49]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]]]]] | ~ [EX [~ [EX [[[[p36<=1 & 1<=p36] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p12<=1 & 1<=p12]]]]]]]] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]]

abstracting: (1<=p27)
states: 245,135 (5)
abstracting: (p27<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
..abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 1,803,067 (6)
abstracting: (p6<=0)
states: 1,513,802 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p14)
states: 1,803,067 (6)
abstracting: (p14<=0)
states: 1,557,932 (6)
..........
EG iterations: 10
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
.-> the formula is TRUE

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

MC time: 0m 1.136sec

checking: EF [[~ [A [~ [[[[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]] & [[p14<=1 & 1<=p14] & [p49<=1 & 1<=p49]]]] U [~ [[[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p18<=1 & 1<=p18] & [[p49<=1 & 1<=p49] & [p12<=1 & 1<=p12]]]] & [[[p19<=1 & 1<=p19] & [p29<=1 & 1<=p29]] & [[p36<=1 & 1<=p36] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]]]] & [p48<=1 & 1<=p48]]]] & EX [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p21<=0 & 0<=p21] | [p49<=0 & 0<=p49]]]]]]
normalized: E [true U [~ [[~ [EG [~ [[~ [[[[[[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]] & [p36<=1 & 1<=p36]] & [[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]]] & [[[[p12<=1 & 1<=p12] & [p49<=1 & 1<=p49]] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & [p48<=1 & 1<=p48]]]]] & ~ [E [~ [[~ [[[[[[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]] & [p36<=1 & 1<=p36]] & [[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]]] & [[[[p12<=1 & 1<=p12] & [p49<=1 & 1<=p49]] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & [p48<=1 & 1<=p48]]] U [~ [[~ [[[[[[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]] & [p36<=1 & 1<=p36]] & [[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]]] & [[[[p12<=1 & 1<=p12] & [p49<=1 & 1<=p49]] & [p18<=1 & 1<=p18]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & [p48<=1 & 1<=p48]]] & [[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]] & [[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]]]]]]]] & EX [[[[p21<=0 & 0<=p21] | [p49<=0 & 0<=p49]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]

abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 1,803,067 (6)
abstracting: (p7<=0)
states: 1,513,802 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p21)
states: 1,803,067 (6)
abstracting: (p21<=0)
states: 1,557,932 (6)
.abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p14)
states: 245,135 (5)
abstracting: (p14<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p48)
states: 335,120 (5)
abstracting: (p48<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p18)
states: 240,719 (5)
abstracting: (p18<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p48)
states: 335,120 (5)
abstracting: (p48<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p18)
states: 240,719 (5)
abstracting: (p18<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p48)
states: 335,120 (5)
abstracting: (p48<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p18)
states: 240,719 (5)
abstracting: (p18<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
............
EG iterations: 12
-> the formula is TRUE

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

MC time: 0m 0.983sec

checking: EX [E [[~ [[[E [[[[p15<=1 & 1<=p15] & [[p19<=1 & 1<=p19] & [p29<=1 & 1<=p29]]] & [[p36<=1 & 1<=p36] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]] U [[[p15<=1 & 1<=p15] & [[p19<=1 & 1<=p19] & [p26<=1 & 1<=p26]]] & [[p36<=1 & 1<=p36] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]]] & [[p12<=1 & 1<=p12] & [p19<=1 & 1<=p19]]] & [[[p29<=1 & 1<=p29] & [p33<=1 & 1<=p33]] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]]] | EF [[EG [[p48<=1 & 1<=p48]] | ~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p9<=1 & 1<=p9] & [p49<=1 & 1<=p49]]]]]]] U [[[p12<=1 & 1<=p12] & [[p22<=1 & 1<=p22] & [p29<=1 & 1<=p29]]] & [[p36<=1 & 1<=p36] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]]]]
normalized: EX [E [[E [true U [~ [[[[p49<=1 & 1<=p49] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] | EG [[p48<=1 & 1<=p48]]]] | ~ [[[[[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]] & [[p33<=1 & 1<=p33] & [p29<=1 & 1<=p29]]] & [[[p19<=1 & 1<=p19] & [p12<=1 & 1<=p12]] & E [[[[[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]] & [p36<=1 & 1<=p36]] & [[[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]] & [p15<=1 & 1<=p15]]] U [[[[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]] & [p36<=1 & 1<=p36]] & [[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p15<=1 & 1<=p15]]]]]]]] U [[[[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]] & [p36<=1 & 1<=p36]] & [[[p29<=1 & 1<=p29] & [p22<=1 & 1<=p22]] & [p12<=1 & 1<=p12]]]]]

abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p12)
states: 290,903 (5)
abstracting: (p12<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p33)
states: 290,903 (5)
abstracting: (p33<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p48)
states: 335,120 (5)
abstracting: (p48<=1)
states: 1,803,067 (6)
..........
EG iterations: 10
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p9)
states: 245,135 (5)
abstracting: (p9<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.-> the formula is TRUE

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

MC time: 0m 0.808sec

checking: [AX [EG [[[[~ [A [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p20<=1 & 1<=p20] & [p49<=1 & 1<=p49]]] U [p21<=1 & 1<=p21]]] | AF [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p30<=0 & 0<=p30] | [p49<=0 & 0<=p49]]]]] | [[p1<=0 & 0<=p1] | [[p2<=0 & 0<=p2] | [p23<=0 & 0<=p23]]]] | [[[p49<=0 & 0<=p49] | [p1<=0 & 0<=p1]] | [[p2<=0 & 0<=p2] | [[p30<=0 & 0<=p30] | [p49<=0 & 0<=p49]]]]]]] | EX [EF [[[EG [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p20<=0 & 0<=p20] | [p49<=0 & 0<=p49]]]] & [[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p30<=0 & 0<=p30] | [p49<=0 & 0<=p49]]]] & [[[[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]] | [[p14<=0 & 0<=p14] | [p49<=0 & 0<=p49]]] & [[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p39<=0 & 0<=p39] | [p49<=0 & 0<=p49]]]]]]]]
normalized: [EX [E [true U [[[[[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]] | [[p49<=0 & 0<=p49] | [p30<=0 & 0<=p30]]] & EG [[[[p49<=0 & 0<=p49] | [p20<=0 & 0<=p20]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]] & [[[[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]] | [[p39<=0 & 0<=p39] | [p49<=0 & 0<=p49]]] & [[[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]] | [[p14<=0 & 0<=p14] | [p49<=0 & 0<=p49]]]]]]] | ~ [EX [~ [EG [[[[[[p49<=0 & 0<=p49] | [p30<=0 & 0<=p30]] | [p2<=0 & 0<=p2]] | [[p1<=0 & 0<=p1] | [p49<=0 & 0<=p49]]] | [[[[p23<=0 & 0<=p23] | [p2<=0 & 0<=p2]] | [p1<=0 & 0<=p1]] | [~ [EG [~ [[[[p49<=0 & 0<=p49] | [p30<=0 & 0<=p30]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]] | ~ [[~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[[[p49<=1 & 1<=p49] & [p20<=1 & 1<=p20]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] & ~ [[p21<=1 & 1<=p21]]]]]]]]]]]]]]]

abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p20)
states: 245,135 (5)
abstracting: (p20<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
........
EG iterations: 8
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 1,803,067 (6)
abstracting: (p2<=0)
states: 1,610,413 (6)
abstracting: (0<=p30)
states: 1,803,067 (6)
abstracting: (p30<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
..........
EG iterations: 10
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 1,803,067 (6)
abstracting: (p2<=0)
states: 1,610,413 (6)
abstracting: (0<=p23)
states: 1,803,067 (6)
abstracting: (p23<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 1,803,067 (6)
abstracting: (p2<=0)
states: 1,610,413 (6)
abstracting: (0<=p30)
states: 1,803,067 (6)
abstracting: (p30<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
.
EG iterations: 1
.abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p14)
states: 1,803,067 (6)
abstracting: (p14<=0)
states: 1,557,932 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p8)
states: 1,803,067 (6)
abstracting: (p8<=0)
states: 1,534,592 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p39)
states: 1,803,067 (6)
abstracting: (p39<=0)
states: 1,562,348 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 1,803,067 (6)
abstracting: (p2<=0)
states: 1,610,413 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 1,803,067 (6)
abstracting: (p2<=0)
states: 1,610,413 (6)
abstracting: (0<=p20)
states: 1,803,067 (6)
abstracting: (p20<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
.
EG iterations: 1
abstracting: (0<=p30)
states: 1,803,067 (6)
abstracting: (p30<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 1,803,067 (6)
abstracting: (p6<=0)
states: 1,513,802 (6)
.-> the formula is TRUE

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

MC time: 0m 0.632sec

checking: [A [AG [EF [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p30<=1 & 1<=p30] & [p49<=1 & 1<=p49]]]]] U ~ [[p21<=1 & 1<=p21]]] & [~ [E [AF [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p37<=1 & 1<=p37] & [p49<=1 & 1<=p49]]]] U [[[[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p16<=1 & 1<=p16] & [p49<=1 & 1<=p49]]] | [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p30<=1 & 1<=p30] & [p49<=1 & 1<=p49]]]] & [[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]]] & [[p14<=1 & 1<=p14] & [[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]]]]]] | [EX [[[p44<=1 & 1<=p44] & [p52<=1 & 1<=p52]]] & [AG [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p20<=1 & 1<=p20] & [[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]]]]] & AG [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p42<=0 & 0<=p42] | [[p49<=0 & 0<=p49] | [[[p47<=1 & 1<=p47] & [p1<=1 & 1<=p1]] & [[p8<=1 & 1<=p8] & [[p14<=1 & 1<=p14] & [p49<=1 & 1<=p49]]]]]]]]]]]]
normalized: [[[[~ [E [true U ~ [[[[[[[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]] & [p8<=1 & 1<=p8]] & [[p1<=1 & 1<=p1] & [p47<=1 & 1<=p47]]] | [p49<=0 & 0<=p49]] | [p42<=0 & 0<=p42]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]] & ~ [E [true U ~ [[[[[p28<=1 & 1<=p28] & [p49<=1 & 1<=p49]] & [p20<=1 & 1<=p20]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]] & EX [[[p52<=1 & 1<=p52] & [p44<=1 & 1<=p44]]]] | ~ [E [~ [EG [~ [[[[p49<=1 & 1<=p49] & [p37<=1 & 1<=p37]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] U [[[[p28<=1 & 1<=p28] & [p49<=1 & 1<=p49]] & [p14<=1 & 1<=p14]] & [[[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]] & [[[[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]] | [[[p49<=1 & 1<=p49] & [p16<=1 & 1<=p16]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]] & [~ [EG [[p21<=1 & 1<=p21]]] & ~ [E [[p21<=1 & 1<=p21] U [E [true U ~ [E [true U [[[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]] & [p21<=1 & 1<=p21]]]]]]

abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p30)
states: 245,135 (5)
abstracting: (p30<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
abstracting: (1<=p21)
states: 245,135 (5)
abstracting: (p21<=1)
states: 1,803,067 (6)
..............
EG iterations: 14
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p16)
states: 245,135 (5)
abstracting: (p16<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p30)
states: 245,135 (5)
abstracting: (p30<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p14)
states: 245,135 (5)
abstracting: (p14<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p37)
states: 245,135 (5)
abstracting: (p37<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
..
EG iterations: 2
abstracting: (1<=p44)
states: 33,614 (4)
abstracting: (p44<=1)
states: 1,803,067 (6)
abstracting: (1<=p52)
states: 1,446,573 (6)
abstracting: (p52<=1)
states: 1,803,067 (6)
.abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p20)
states: 245,135 (5)
abstracting: (p20<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 1,803,067 (6)
abstracting: (p7<=0)
states: 1,513,802 (6)
abstracting: (0<=p42)
states: 1,803,067 (6)
abstracting: (p42<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (1<=p47)
states: 335,120 (5)
abstracting: (p47<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p14)
states: 245,135 (5)
abstracting: (p14<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
-> the formula is TRUE

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

MC time: 0m 3.608sec

checking: EG [[[EG [[AG [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p27<=0 & 0<=p27] | [p49<=0 & 0<=p49]]]] | AF [[p41<=0 & 0<=p41]]]] | [[EG [[p10<=0 & 0<=p10]] & [[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]]] & [[[p28<=1 & 1<=p28] & [p49<=1 & 1<=p49]] & [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p34<=0 & 0<=p34] | [p49<=0 & 0<=p49]]] & [[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p14<=0 & 0<=p14] | [[p49<=0 & 0<=p49] | [p41<=0 & 0<=p41]]]]]]]] & [AF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p27<=1 & 1<=p27] & [p49<=1 & 1<=p49]]]] | [[[EX [AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p23<=1 & 1<=p23] & [p49<=1 & 1<=p49]]]]] & ~ [A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p27<=1 & 1<=p27] & [p49<=1 & 1<=p49]]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p28<=1 & 1<=p28] & [p49<=1 & 1<=p49]]]]]] & [EF [[[[p15<=0 & 0<=p15] | [[p22<=0 & 0<=p22] | [p26<=0 & 0<=p26]]] | [[p36<=0 & 0<=p36] | [[p43<=0 & 0<=p43] | [p50<=0 & 0<=p50]]]]] & [p1<=1 & 1<=p1]]] & [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p49<=1 & 1<=p49] & [[[p15<=0 & 0<=p15] | [[p22<=0 & 0<=p22] | [p29<=0 & 0<=p29]]] | [[p36<=0 & 0<=p36] | [[p40<=0 & 0<=p40] | [p50<=0 & 0<=p50]]]]]]]]]]
normalized: EG [[[[[[[[[[p50<=0 & 0<=p50] | [p40<=0 & 0<=p40]] | [p36<=0 & 0<=p36]] | [[[p29<=0 & 0<=p29] | [p22<=0 & 0<=p22]] | [p15<=0 & 0<=p15]]] & [p49<=1 & 1<=p49]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p1<=1 & 1<=p1] & E [true U [[[[p50<=0 & 0<=p50] | [p43<=0 & 0<=p43]] | [p36<=0 & 0<=p36]] | [[[p26<=0 & 0<=p26] | [p22<=0 & 0<=p22]] | [p15<=0 & 0<=p15]]]]] & [~ [[~ [EG [~ [[[[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[[p49<=1 & 1<=p49] & [p27<=1 & 1<=p27]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]] & EX [~ [EX [~ [[[[p49<=1 & 1<=p49] & [p23<=1 & 1<=p23]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]] | ~ [EG [~ [[[[p49<=1 & 1<=p49] & [p27<=1 & 1<=p27]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]] & [[[[[[[[p41<=0 & 0<=p41] | [p49<=0 & 0<=p49]] | [p14<=0 & 0<=p14]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]] & [[[p49<=0 & 0<=p49] | [p34<=0 & 0<=p34]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]] & [[p49<=1 & 1<=p49] & [p28<=1 & 1<=p28]]] & [[[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]] & EG [[p10<=0 & 0<=p10]]]] | EG [[~ [EG [~ [[p41<=0 & 0<=p41]]]] | ~ [E [true U ~ [[[[p49<=0 & 0<=p49] | [p27<=0 & 0<=p27]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]]]]]]

abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 1,803,067 (6)
abstracting: (p7<=0)
states: 1,513,802 (6)
abstracting: (0<=p27)
states: 1,803,067 (6)
abstracting: (p27<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p41)
states: 1,803,067 (6)
abstracting: (p41<=0)
states: 1,557,932 (6)
..............
EG iterations: 14
.
EG iterations: 1
abstracting: (0<=p10)
states: 1,803,067 (6)
abstracting: (p10<=0)
states: 1,557,932 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 1,803,067 (6)
abstracting: (p7<=0)
states: 1,513,802 (6)
abstracting: (0<=p34)
states: 1,803,067 (6)
abstracting: (p34<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p1)
states: 1,803,067 (6)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 1,803,067 (6)
abstracting: (p6<=0)
states: 1,513,802 (6)
abstracting: (0<=p14)
states: 1,803,067 (6)
abstracting: (p14<=0)
states: 1,557,932 (6)
abstracting: (0<=p49)
states: 1,803,067 (6)
abstracting: (p49<=0)
states: 1,240,660 (6)
abstracting: (0<=p41)
states: 1,803,067 (6)
abstracting: (p41<=0)
states: 1,557,932 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p27)
states: 245,135 (5)
abstracting: (p27<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p23)
states: 245,135 (5)
abstracting: (p23<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
..abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p27)
states: 245,135 (5)
abstracting: (p27<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
......
EG iterations: 6
abstracting: (0<=p15)
states: 1,803,067 (6)
abstracting: (p15<=0)
states: 1,512,163 (6)
abstracting: (0<=p22)
states: 1,803,067 (6)
abstracting: (p22<=0)
states: 1,512,163 (6)
abstracting: (0<=p26)
states: 1,803,067 (6)
abstracting: (p26<=0)
states: 1,512,164 (6)
abstracting: (0<=p36)
states: 1,803,067 (6)
abstracting: (p36<=0)
states: 1,512,163 (6)
abstracting: (0<=p43)
states: 1,803,067 (6)
abstracting: (p43<=0)
states: 1,512,163 (6)
abstracting: (0<=p50)
states: 1,803,067 (6)
abstracting: (p50<=0)
states: 1,333,490 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p13)
states: 245,135 (5)
abstracting: (p13<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (0<=p15)
states: 1,803,067 (6)
abstracting: (p15<=0)
states: 1,512,163 (6)
abstracting: (0<=p22)
states: 1,803,067 (6)
abstracting: (p22<=0)
states: 1,512,163 (6)
abstracting: (0<=p29)
states: 1,803,067 (6)
abstracting: (p29<=0)
states: 1,512,163 (6)
abstracting: (0<=p36)
states: 1,803,067 (6)
abstracting: (p36<=0)
states: 1,512,163 (6)
abstracting: (0<=p40)
states: 1,803,067 (6)
abstracting: (p40<=0)
states: 1,512,164 (6)
abstracting: (0<=p50)
states: 1,803,067 (6)
abstracting: (p50<=0)
states: 1,333,490 (6)
..........
EG iterations: 10
-> the formula is FALSE

FORMULA AutonomousCar-PT-05a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.967sec

checking: [EF [[EG [[p28<=1 & 1<=p28]] & A [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p9<=1 & 1<=p9] & [p49<=1 & 1<=p49]]] U [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p20<=1 & 1<=p20] & [p49<=1 & 1<=p49]]]]]] | [~ [E [[~ [EX [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p34<=1 & 1<=p34] & [p49<=1 & 1<=p49]]]]] | ~ [[[[p15<=1 & 1<=p15] & [[p22<=1 & 1<=p22] & [p29<=1 & 1<=p29]]] & [[p36<=1 & 1<=p36] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]]]] U [E [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p32<=1 & 1<=p32] & [p49<=1 & 1<=p49]]] U [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p13<=1 & 1<=p13] & [p49<=1 & 1<=p49]]]] | [E [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]]]] & [~ [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]]] & ~ [[[[[p15<=1 & 1<=p15] & [[p19<=1 & 1<=p19] & [p26<=1 & 1<=p26]]] & [[p33<=1 & 1<=p33] & [[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]] | [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p39<=1 & 1<=p39] & [p49<=1 & 1<=p49]]]]]]]]]] & [EF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]]] | ~ [A [~ [[[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p9<=1 & 1<=p9] & [p49<=1 & 1<=p49]]] | [[[p15<=1 & 1<=p15] & [[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]] & [[p33<=1 & 1<=p33] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]]]] U EX [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p11<=1 & 1<=p11] & [p49<=1 & 1<=p49]]]]]]]]]
normalized: [[[~ [[~ [EG [~ [EX [[[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [EX [[[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] U [[[[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p33<=1 & 1<=p33]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p15<=1 & 1<=p15]]] | [[[p49<=1 & 1<=p49] & [p9<=1 & 1<=p9]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] & ~ [EX [[[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]] | E [true U [[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] & ~ [E [[~ [[[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p36<=1 & 1<=p36]] & [[[p29<=1 & 1<=p29] & [p22<=1 & 1<=p22]] & [p15<=1 & 1<=p15]]]] | ~ [EX [[[[p49<=1 & 1<=p49] & [p34<=1 & 1<=p34]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] U [[[~ [[[[[p49<=1 & 1<=p49] & [p39<=1 & 1<=p39]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[[[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]] & [p33<=1 & 1<=p33]] & [[[p26<=1 & 1<=p26] & [p19<=1 & 1<=p19]] & [p15<=1 & 1<=p15]]]]] & ~ [[[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] & E [[[[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]] U [[[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] | E [[[[p49<=1 & 1<=p49] & [p32<=1 & 1<=p32]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]] U [[[p49<=1 & 1<=p49] & [p13<=1 & 1<=p13]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]] | E [true U [[~ [EG [~ [[[[p49<=1 & 1<=p49] & [p20<=1 & 1<=p20]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p49<=1 & 1<=p49] & [p20<=1 & 1<=p20]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]] U [~ [[[[p49<=1 & 1<=p49] & [p9<=1 & 1<=p9]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]] & ~ [[[[p49<=1 & 1<=p49] & [p20<=1 & 1<=p20]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]] & EG [[p28<=1 & 1<=p28]]]]]

abstracting: (1<=p28)
states: 245,135 (5)
abstracting: (p28<=1)
states: 1,803,067 (6)
..............
EG iterations: 14
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p20)
states: 245,135 (5)
abstracting: (p20<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p9)
states: 245,135 (5)
abstracting: (p9<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p20)
states: 245,135 (5)
abstracting: (p20<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p20)
states: 245,135 (5)
abstracting: (p20<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p13)
states: 245,135 (5)
abstracting: (p13<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p8)
states: 268,475 (5)
abstracting: (p8<=1)
states: 1,803,067 (6)
abstracting: (1<=p32)
states: 240,719 (5)
abstracting: (p32<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p42)
states: 245,135 (5)
abstracting: (p42<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p42)
states: 245,135 (5)
abstracting: (p42<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p35)
states: 245,135 (5)
abstracting: (p35<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p19)
states: 290,903 (5)
abstracting: (p19<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p33)
states: 290,903 (5)
abstracting: (p33<=1)
states: 1,803,067 (6)
abstracting: (1<=p40)
states: 290,903 (5)
abstracting: (p40<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p39)
states: 240,719 (5)
abstracting: (p39<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p5)
states: 289,265 (5)
abstracting: (p5<=1)
states: 1,803,067 (6)
abstracting: (1<=p34)
states: 245,135 (5)
abstracting: (p34<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p29)
states: 290,904 (5)
abstracting: (p29<=1)
states: 1,803,067 (6)
abstracting: (1<=p36)
states: 290,904 (5)
abstracting: (p36<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p2)
states: 192,654 (5)
abstracting: (p2<=1)
states: 1,803,067 (6)
abstracting: (1<=p35)
states: 245,135 (5)
abstracting: (p35<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p11)
states: 240,719 (5)
abstracting: (p11<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p6)
states: 289,265 (5)
abstracting: (p6<=1)
states: 1,803,067 (6)
abstracting: (1<=p9)
states: 245,135 (5)
abstracting: (p9<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
abstracting: (1<=p15)
states: 290,904 (5)
abstracting: (p15<=1)
states: 1,803,067 (6)
abstracting: (1<=p22)
states: 290,904 (5)
abstracting: (p22<=1)
states: 1,803,067 (6)
abstracting: (1<=p26)
states: 290,903 (5)
abstracting: (p26<=1)
states: 1,803,067 (6)
abstracting: (1<=p33)
states: 290,903 (5)
abstracting: (p33<=1)
states: 1,803,067 (6)
abstracting: (1<=p43)
states: 290,904 (5)
abstracting: (p43<=1)
states: 1,803,067 (6)
abstracting: (1<=p50)
states: 469,577 (5)
abstracting: (p50<=1)
states: 1,803,067 (6)
abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p11)
states: 240,719 (5)
abstracting: (p11<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
.abstracting: (1<=p1)
states: 1,803,066 (6)
abstracting: (p1<=1)
states: 1,803,067 (6)
abstracting: (1<=p7)
states: 289,265 (5)
abstracting: (p7<=1)
states: 1,803,067 (6)
abstracting: (1<=p11)
states: 240,719 (5)
abstracting: (p11<=1)
states: 1,803,067 (6)
abstracting: (1<=p49)
states: 562,407 (5)
abstracting: (p49<=1)
states: 1,803,067 (6)
........
EG iterations: 7
-> the formula is TRUE

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

MC time: 0m 4.549sec

totally nodes used: 6212070 (6.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34122687 70678877 104801564
used/not used/entry size/cache size: 44772738 22336126 16 1024MB
basic ops cache: hits/miss/sum: 3909615 5016565 8926180
used/not used/entry size/cache size: 6827237 9949979 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: 52632 109962 162594
used/not used/entry size/cache size: 109308 8279300 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 61456244
1 5151324
2 448457
3 47900
4 4584
5 334
6 21
7 0
8 0
9 0
>= 10 0

Total processing time: 0m28.376sec


BK_STOP 1678699465594

--------------------
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:95273 (541), effective:3081 (17)

initing FirstDep: 0m 0.000sec


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

iterations count:75783 (430), effective:1739 (9)

iterations count:75612 (429), effective:1709 (9)

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

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

iterations count:377 (2), effective:10 (0)

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

iterations count:2667 (15), effective:35 (0)
7591
iterations count:145493 (826), effective:3177 (18)

iterations count:72719 (413), effective:1498 (8)

iterations count:68904 (391), effective:1599 (9)

iterations count:6326 (35), effective:122 (0)

iterations count:3336 (18), effective:76 (0)

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

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

iterations count:18083 (102), effective:573 (3)

iterations count:951 (5), effective:17 (0)

iterations count:1569 (8), effective:33 (0)

iterations count:68820 (391), effective:1632 (9)

iterations count:36401 (206), effective:855 (4)

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

iterations count:228 (1), effective:2 (0)

iterations count:248 (1), effective:4 (0)

iterations count:67890 (385), effective:1662 (9)

iterations count:68904 (391), effective:1599 (9)

iterations count:697 (3), effective:15 (0)

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

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

iterations count:35699 (202), effective:933 (5)

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

iterations count:176 (1), effective:0 (0)
5558
iterations count:106114 (602), effective:2438 (13)

iterations count:68079 (386), effective:1633 (9)

iterations count:76341 (433), effective:1734 (9)

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-05a"
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-05a, 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-167813599300594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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