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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 276K 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-07a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678699966317

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-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:32:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:32:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:32:48] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-13 09:32:48] [INFO ] Transformed 73 places.
[2023-03-13 09:32:48] [INFO ] Transformed 593 transitions.
[2023-03-13 09:32:48] [INFO ] Found NUPN structural information;
[2023-03-13 09:32:48] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
Support contains 51 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 379
Applied a total of 2 rules in 44 ms. Remains 72 /73 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 72 cols
[2023-03-13 09:32:49] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-13 09:32:49] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-13 09:32:49] [INFO ] Invariant cache hit.
[2023-03-13 09:32:49] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-13 09:32:50] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 990 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/73 places, 379/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1040 ms. Remains : 70/73 places, 379/380 transitions.
Support contains 51 out of 70 places after structural reductions.
[2023-03-13 09:32:50] [INFO ] Flatten gal took : 167 ms
[2023-03-13 09:32:50] [INFO ] Flatten gal took : 47 ms
[2023-03-13 09:32:50] [INFO ] Input system was already deterministic with 379 transitions.
Incomplete random walk after 10000 steps, including 540 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 69) seen :40
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :2
Running SMT prover for 18 properties.
// Phase 1: matrix 379 rows 70 cols
[2023-03-13 09:32:51] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-13 09:32:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:52] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:14
[2023-03-13 09:32:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 09:32:53] [INFO ] After 969ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :14
[2023-03-13 09:32:53] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-13 09:32:54] [INFO ] After 789ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :4 sat :14
[2023-03-13 09:32:55] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :14
Attempting to minimize the solution found.
Minimization took 1060 ms.
[2023-03-13 09:32:56] [INFO ] After 3986ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :14
Fused 18 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 29 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 379/379 transitions.
Graph (complete) has 670 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 rules applied. Total rules applied 7 place count 69 transition count 372
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 11 place count 66 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 65 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 65 transition count 368
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 62 transition count 368
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 21 place count 59 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 59 transition count 351
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 26 place count 58 transition count 350
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 33 place count 58 transition count 343
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 61 place count 51 transition count 322
Applied a total of 61 rules in 69 ms. Remains 51 /70 variables (removed 19) and now considering 322/379 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 51/70 places, 322/379 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 322 rows 51 cols
[2023-03-13 09:32:57] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 09:32:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:58] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 09:32:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 09:32:58] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 09:32:58] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-13 09:32:59] [INFO ] After 358ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 09:32:59] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-13 09:33:00] [INFO ] After 1892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 106 ms.
Support contains 12 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 322/322 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 320
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 49 transition count 318
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 22 place count 47 transition count 304
Applied a total of 22 rules in 28 ms. Remains 47 /51 variables (removed 4) and now considering 304/322 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 47/51 places, 304/322 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 304 rows 47 cols
[2023-03-13 09:33:00] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 09:33:00] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-13 09:33:00] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 09:33:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:33:01] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 09:33:01] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-13 09:33:01] [INFO ] After 307ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 09:33:02] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-13 09:33:02] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 11 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 304/304 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 303
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 46 transition count 296
Applied a total of 9 rules in 33 ms. Remains 46 /47 variables (removed 1) and now considering 296/304 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 46/47 places, 296/304 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1106792 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :{1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 1106792 steps, saw 148171 distinct states, run finished after 3005 ms. (steps per millisecond=368 ) properties seen :4
Running SMT prover for 2 properties.
// Phase 1: matrix 296 rows 46 cols
[2023-03-13 09:33:05] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 09:33:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 09:33:05] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:33:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:33:06] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:33:06] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-13 09:33:06] [INFO ] After 67ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:33:06] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-13 09:33:06] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 296/296 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 272
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 43 transition count 271
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 15 place count 42 transition count 264
Applied a total of 15 rules in 41 ms. Remains 42 /46 variables (removed 4) and now considering 264/296 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 42/46 places, 264/296 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 481531 steps, run visited all 2 properties in 1289 ms. (steps per millisecond=373 )
Probabilistic random walk after 481531 steps, saw 66031 distinct states, run finished after 1289 ms. (steps per millisecond=373 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:33:07] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:33:07] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 379 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 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 70 transition count 374
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 65 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 55 transition count 329
Applied a total of 30 rules in 56 ms. Remains 55 /70 variables (removed 15) and now considering 329/379 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 55/70 places, 329/379 transitions.
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 16 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 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 70 transition count 373
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 64 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
Applied a total of 28 rules in 29 ms. Remains 56 /70 variables (removed 14) and now considering 330/379 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 56/70 places, 330/379 transitions.
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 29 ms
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 323
Applied a total of 14 rules in 4 ms. Remains 63 /70 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/70 places, 323/379 transitions.
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 52 ms
[2023-03-13 09:33:08] [INFO ] Flatten gal took : 55 ms
[2023-03-13 09:33:08] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 5 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 68 transition count 370
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 60 transition count 370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 60 transition count 369
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 19 place count 59 transition count 369
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 52 transition count 313
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 52 transition count 313
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 2 with 4 rules applied. Total rules applied 37 place count 50 transition count 311
Applied a total of 37 rules in 27 ms. Remains 50 /70 variables (removed 20) and now considering 311/379 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 50/70 places, 311/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 70 transition count 372
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
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 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
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 30 place count 55 transition count 329
Applied a total of 30 rules in 29 ms. Remains 55 /70 variables (removed 15) and now considering 329/379 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 55/70 places, 329/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 66 transition count 347
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 66 transition count 347
Applied a total of 8 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 347/379 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/70 places, 347/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 66 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 323
Applied a total of 14 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/70 places, 323/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 339
Applied a total of 10 rules in 3 ms. Remains 65 /70 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/70 places, 339/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 45 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:09] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:33:09] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 339
Applied a total of 10 rules in 2 ms. Remains 65 /70 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/70 places, 339/379 transitions.
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 50 ms
[2023-03-13 09:33:10] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 355
Applied a total of 6 rules in 1 ms. Remains 67 /70 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/70 places, 355/379 transitions.
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:33:10] [INFO ] Input system was already deterministic with 355 transitions.
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:33:10] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:33:10] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:33:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 379 transitions and 3746 arcs took 3 ms.
Total runtime 21681 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: 70 NrTr: 379 NrArc: 3746)

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

net check time: 0m 0.000sec

init dd package: 0m 2.976sec


RS generation: 0m19.341sec


-> reachability set: #nodes 40608 (4.1e+04) #states 124,045,181 (8)



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

checking: EG [[p54<=0 & 0<=p54]]
normalized: EG [[p54<=0 & 0<=p54]]

abstracting: (0<=p54)
states: 124,045,181 (8)
abstracting: (p54<=0)
states: 106,758,404 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 3.204sec

checking: AF [AX [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p41<=1 & 1<=p41] & [p65<=1 & 1<=p65]]]]]
normalized: ~ [EG [EX [~ [[[[p65<=1 & 1<=p65] & [p41<=1 & 1<=p41]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p41)
states: 17,112,441 (7)
abstracting: (p41<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.............................................................................................................
EG iterations: 108
-> the formula is FALSE

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

MC time: 1m34.180sec

checking: EX [AX [AX [EF [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p29<=1 & 1<=p29] & [p65<=1 & 1<=p65]]]]]]]
normalized: EX [~ [EX [EX [~ [E [true U [[[p65<=1 & 1<=p65] & [p29<=1 & 1<=p29]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p29)
states: 17,286,777 (7)
abstracting: (p29<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
...-> the formula is FALSE

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

MC time: 0m35.635sec

checking: A [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p58<=1 & 1<=p58] & [p65<=1 & 1<=p65]]] U EX [AX [AX [AF [[p64<=1 & 1<=p64]]]]]]
normalized: [~ [EG [~ [EX [~ [EX [EX [EG [~ [[p64<=1 & 1<=p64]]]]]]]]]] & ~ [E [~ [EX [~ [EX [EX [EG [~ [[p64<=1 & 1<=p64]]]]]]]] U [~ [EX [~ [EX [EX [EG [~ [[p64<=1 & 1<=p64]]]]]]]] & ~ [[[[p65<=1 & 1<=p65] & [p58<=1 & 1<=p58]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p58)
states: 17,286,777 (7)
abstracting: (p58<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p64)
states: 25,607,764 (7)
abstracting: (p64<=1)
states: 124,045,181 (8)
................
EG iterations: 16
...abstracting: (1<=p64)
states: 25,607,764 (7)
abstracting: (p64<=1)
states: 124,045,181 (8)
................
EG iterations: 16
...abstracting: (1<=p64)
states: 25,607,764 (7)
abstracting: (p64<=1)
states: 124,045,181 (8)
................
EG iterations: 16
...............................
before gc: list nodes free: 1325066

after gc: idd nodes used:481783, unused:63518217; list nodes free:310268414
..............................................................................
EG iterations: 106
-> the formula is FALSE

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

MC time: 2m40.793sec

checking: EF [[[AF [AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p20<=1 & 1<=p20] & [p65<=1 & 1<=p65]]]]] & [p1<=1 & 1<=p1]] & [[p5<=1 & 1<=p5] & [[p16<=1 & 1<=p16] & [p65<=1 & 1<=p65]]]]]
normalized: E [true U [[~ [EG [EX [~ [[[[p65<=1 & 1<=p65] & [p20<=1 & 1<=p20]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] & [p1<=1 & 1<=p1]] & [[[p65<=1 & 1<=p65] & [p16<=1 & 1<=p16]] & [p5<=1 & 1<=p5]]]]

abstracting: (1<=p5)
states: 15,298,985 (7)
abstracting: (p5<=1)
states: 124,045,181 (8)
abstracting: (1<=p16)
states: 17,286,777 (7)
abstracting: (p16<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p2)
states: 9,338,910 (6)
abstracting: (p2<=1)
states: 124,045,181 (8)
abstracting: (1<=p20)
states: 17,112,441 (7)
abstracting: (p20<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.................................................................................................
before gc: list nodes free: 926332

after gc: idd nodes used:289128, unused:63710872; list nodes free:313235691
............
EG iterations: 108
-> the formula is TRUE

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

MC time: 3m25.799sec

checking: A [AF [[AF [[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p23<=1 & 1<=p23] & [p65<=1 & 1<=p65]]]] | EX [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p30<=1 & 1<=p30] & [p65<=1 & 1<=p65]]]]]] U [p55<=1 & 1<=p55]]
normalized: [~ [EG [~ [[p55<=1 & 1<=p55]]]] & ~ [E [~ [[p55<=1 & 1<=p55]] U [EG [~ [[EX [[[[p65<=1 & 1<=p65] & [p30<=1 & 1<=p30]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] | ~ [EG [~ [[[[p65<=1 & 1<=p65] & [p23<=1 & 1<=p23]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [[p55<=1 & 1<=p55]]]]]]

abstracting: (1<=p55)
states: 17,112,441 (7)
abstracting: (p55<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p23)
states: 17,286,777 (7)
abstracting: (p23<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..........
EG iterations: 10
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p30)
states: 17,286,777 (7)
abstracting: (p30<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..........
EG iterations: 9
abstracting: (1<=p55)
states: 17,112,441 (7)
abstracting: (p55<=1)
states: 124,045,181 (8)
abstracting: (1<=p55)
states: 17,112,441 (7)
abstracting: (p55<=1)
states: 124,045,181 (8)
..........
EG iterations: 10
-> the formula is FALSE

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

MC time: 0m17.773sec

checking: [EF [~ [E [[[[[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]] & [[p28<=1 & 1<=p28] & [p35<=1 & 1<=p35]]] & [[[p45<=1 & 1<=p45] & [p52<=1 & 1<=p52]] & [[p56<=1 & 1<=p56] & [p66<=1 & 1<=p66]]]] U ~ [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p25<=1 & 1<=p25] & [p65<=1 & 1<=p65]]]]]]] | EX [[p19<=1 & 1<=p19]]]
normalized: [E [true U ~ [E [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p52<=1 & 1<=p52] & [p45<=1 & 1<=p45]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]] U ~ [[[[p65<=1 & 1<=p65] & [p25<=1 & 1<=p25]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]] | EX [[p19<=1 & 1<=p19]]]

abstracting: (1<=p19)
states: 17,286,777 (7)
abstracting: (p19<=1)
states: 124,045,181 (8)
.abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p25)
states: 17,286,777 (7)
abstracting: (p25<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
-> the formula is TRUE

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

MC time: 0m34.184sec

checking: AX [EF [[EX [[[[[p17<=0 & 0<=p17] | [p24<=0 & 0<=p24]] | [[p31<=0 & 0<=p31] | [p38<=0 & 0<=p38]]] | [[[p42<=0 & 0<=p42] | [p52<=0 & 0<=p52]] | [[p59<=0 & 0<=p59] | [p66<=0 & 0<=p66]]]]] & [AG [EF [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p53<=1 & 1<=p53] & [p65<=1 & 1<=p65]]]]] | [EX [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p13<=1 & 1<=p13] & [p65<=1 & 1<=p65]]]] & AG [[p23<=1 & 1<=p23]]]]]]]
normalized: ~ [EX [~ [E [true U [[[~ [E [true U ~ [[p23<=1 & 1<=p23]]]] & EX [[[[p65<=1 & 1<=p65] & [p13<=1 & 1<=p13]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]] | ~ [E [true U ~ [E [true U [[[p65<=1 & 1<=p65] & [p53<=1 & 1<=p53]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]] & EX [[[[[p66<=0 & 0<=p66] | [p59<=0 & 0<=p59]] | [[p52<=0 & 0<=p52] | [p42<=0 & 0<=p42]]] | [[[p38<=0 & 0<=p38] | [p31<=0 & 0<=p31]] | [[p24<=0 & 0<=p24] | [p17<=0 & 0<=p17]]]]]]]]]]

abstracting: (0<=p17)
states: 124,045,181 (8)
abstracting: (p17<=0)
states: 105,152,365 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p31)
states: 124,045,181 (8)
abstracting: (p31<=0)
states: 105,152,365 (8)
abstracting: (0<=p38)
states: 124,045,181 (8)
abstracting: (p38<=0)
states: 105,152,365 (8)
abstracting: (0<=p42)
states: 124,045,181 (8)
abstracting: (p42<=0)
states: 105,152,366 (8)
abstracting: (0<=p52)
states: 124,045,181 (8)
abstracting: (p52<=0)
states: 105,152,365 (8)
abstracting: (0<=p59)
states: 124,045,181 (8)
abstracting: (p59<=0)
states: 105,152,365 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
.abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p5)
states: 15,298,985 (7)
abstracting: (p5<=1)
states: 124,045,181 (8)
abstracting: (1<=p53)
states: 17,286,777 (7)
abstracting: (p53<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p13)
states: 17,112,441 (7)
abstracting: (p13<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.abstracting: (1<=p23)
states: 17,286,777 (7)
abstracting: (p23<=1)
states: 124,045,181 (8)
.-> the formula is FALSE

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

MC time: 0m58.256sec

checking: AF [[EF [EG [[[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p27<=1 & 1<=p27] & [p65<=1 & 1<=p65]]] | [[[[[p14<=1 & 1<=p14] & [p24<=1 & 1<=p24]] & [[p28<=1 & 1<=p28] & [p38<=1 & 1<=p38]]] & [[[p45<=1 & 1<=p45] & [p52<=1 & 1<=p52]] & [[p59<=1 & 1<=p59] & [p66<=1 & 1<=p66]]]] | [p37<=1 & 1<=p37]]]]] | [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p50<=1 & 1<=p50] & [p65<=1 & 1<=p65]]]]]
normalized: ~ [EG [~ [[[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]] | E [true U EG [[[[p37<=1 & 1<=p37] | [[[[p66<=1 & 1<=p66] & [p59<=1 & 1<=p59]] & [[p52<=1 & 1<=p52] & [p45<=1 & 1<=p45]]] & [[[p38<=1 & 1<=p38] & [p28<=1 & 1<=p28]] & [[p24<=1 & 1<=p24] & [p14<=1 & 1<=p14]]]]] | [[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p2)
states: 9,338,910 (6)
abstracting: (p2<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p14)
states: 18,892,815 (7)
abstracting: (p14<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p38)
states: 18,892,816 (7)
abstracting: (p38<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p59)
states: 18,892,816 (7)
abstracting: (p59<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p37)
states: 17,286,777 (7)
abstracting: (p37<=1)
states: 124,045,181 (8)
...........................................................................................................
EG iterations: 107
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 2m 5.909sec

checking: E [~ [[EG [~ [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p27<=1 & 1<=p27] & [p65<=1 & 1<=p65]]]]] & [EF [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p50<=1 & 1<=p50] & [p65<=1 & 1<=p65]]]] & AG [[[[[p17<=1 & 1<=p17] & [p21<=1 & 1<=p21]] & [[p28<=1 & 1<=p28] & [p35<=1 & 1<=p35]]] & [[[p42<=1 & 1<=p42] & [p52<=1 & 1<=p52]] & [[p59<=1 & 1<=p59] & [p66<=1 & 1<=p66]]]]]]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p29<=1 & 1<=p29] & [p65<=1 & 1<=p65]]]]
normalized: E [~ [[[~ [E [true U ~ [[[[[p66<=1 & 1<=p66] & [p59<=1 & 1<=p59]] & [[p52<=1 & 1<=p52] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p21<=1 & 1<=p21] & [p17<=1 & 1<=p17]]]]]]] & E [true U [[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]] & EG [~ [[[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]] U [[[p65<=1 & 1<=p65] & [p29<=1 & 1<=p29]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p5)
states: 15,298,985 (7)
abstracting: (p5<=1)
states: 124,045,181 (8)
abstracting: (1<=p29)
states: 17,286,777 (7)
abstracting: (p29<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..........
EG iterations: 10
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p59)
states: 18,892,816 (7)
abstracting: (p59<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
-> the formula is TRUE

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

MC time: 1m21.709sec

checking: AX [AF [[AG [[[[[p17<=0 & 0<=p17] | [p24<=0 & 0<=p24]] | [[p31<=0 & 0<=p31] | [p35<=0 & 0<=p35]]] | [[[p42<=0 & 0<=p42] | [p49<=0 & 0<=p49]] | [[p56<=0 & 0<=p56] | [p66<=0 & 0<=p66]]]]] & EF [[[[[p14<=0 & 0<=p14] | [p24<=0 & 0<=p24]] | [[p28<=0 & 0<=p28] | [p38<=0 & 0<=p38]]] | [[[p45<=0 & 0<=p45] | [p52<=0 & 0<=p52]] | [[p56<=0 & 0<=p56] | [[p66<=0 & 0<=p66] | [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p15<=1 & 1<=p15] & [p65<=1 & 1<=p65]]]]]]]]]]]
normalized: ~ [EX [EG [~ [[E [true U [[[[[[[p65<=1 & 1<=p65] & [p15<=1 & 1<=p15]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [p66<=0 & 0<=p66]] | [p56<=0 & 0<=p56]] | [[p52<=0 & 0<=p52] | [p45<=0 & 0<=p45]]] | [[[p38<=0 & 0<=p38] | [p28<=0 & 0<=p28]] | [[p24<=0 & 0<=p24] | [p14<=0 & 0<=p14]]]]] & ~ [E [true U ~ [[[[[p66<=0 & 0<=p66] | [p56<=0 & 0<=p56]] | [[p49<=0 & 0<=p49] | [p42<=0 & 0<=p42]]] | [[[p35<=0 & 0<=p35] | [p31<=0 & 0<=p31]] | [[p24<=0 & 0<=p24] | [p17<=0 & 0<=p17]]]]]]]]]]]]

abstracting: (0<=p17)
states: 124,045,181 (8)
abstracting: (p17<=0)
states: 105,152,365 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p31)
states: 124,045,181 (8)
abstracting: (p31<=0)
states: 105,152,365 (8)
abstracting: (0<=p35)
states: 124,045,181 (8)
abstracting: (p35<=0)
states: 105,152,366 (8)
abstracting: (0<=p42)
states: 124,045,181 (8)
abstracting: (p42<=0)
states: 105,152,366 (8)
abstracting: (0<=p49)
states: 124,045,181 (8)
abstracting: (p49<=0)
states: 105,152,366 (8)
abstracting: (0<=p56)
states: 124,045,181 (8)
abstracting: (p56<=0)
states: 105,152,366 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
abstracting: (0<=p14)
states: 124,045,181 (8)
abstracting: (p14<=0)
states: 105,152,366 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p28)
states: 124,045,181 (8)
abstracting: (p28<=0)
states: 105,152,366 (8)
abstracting: (0<=p38)
states: 124,045,181 (8)
abstracting: (p38<=0)
states: 105,152,365 (8)
abstracting: (0<=p45)
states: 124,045,181 (8)
abstracting: (p45<=0)
states: 105,152,365 (8)
abstracting: (0<=p52)
states: 124,045,181 (8)
abstracting: (p52<=0)
states: 105,152,365 (8)
abstracting: (0<=p56)
states: 124,045,181 (8)
abstracting: (p56<=0)
states: 105,152,366 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p15)
states: 17,286,777 (7)
abstracting: (p15<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..................................................................................................
EG iterations: 98
.-> the formula is FALSE

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

MC time: 0m20.731sec

checking: AX [AX [[EF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p23<=1 & 1<=p23] & [p65<=1 & 1<=p65]]]] | [A [[[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p13<=1 & 1<=p13] & [p65<=1 & 1<=p65]]] & [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p44<=1 & 1<=p44] & [p65<=1 & 1<=p65]]]] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p50<=1 & 1<=p50] & [p65<=1 & 1<=p65]]]] & [EX [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p37<=0 & 0<=p37] | [p65<=0 & 0<=p65]]]] | AF [[[[[p14<=1 & 1<=p14] & [p24<=1 & 1<=p24]] & [[p31<=1 & 1<=p31] & [p35<=1 & 1<=p35]]] & [[[p45<=1 & 1<=p45] & [p49<=1 & 1<=p49]] & [[p59<=1 & 1<=p59] & [p66<=1 & 1<=p66]]]]]]]]]]
normalized: ~ [EX [EX [~ [[[[~ [EG [~ [[[[[p66<=1 & 1<=p66] & [p59<=1 & 1<=p59]] & [[p49<=1 & 1<=p49] & [p45<=1 & 1<=p45]]] & [[[p35<=1 & 1<=p35] & [p31<=1 & 1<=p31]] & [[p24<=1 & 1<=p24] & [p14<=1 & 1<=p14]]]]]]] | EX [[[[p65<=0 & 0<=p65] | [p37<=0 & 0<=p37]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]] & [~ [EG [~ [[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] U [~ [[[[[p65<=1 & 1<=p65] & [p44<=1 & 1<=p44]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]] & [[[p65<=1 & 1<=p65] & [p13<=1 & 1<=p13]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]] & ~ [[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]] | E [true U [[[p65<=1 & 1<=p65] & [p23<=1 & 1<=p23]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p23)
states: 17,286,777 (7)
abstracting: (p23<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p13)
states: 17,112,441 (7)
abstracting: (p13<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p44)
states: 17,286,777 (7)
abstracting: (p44<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.
EG iterations: 1
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 124,045,181 (8)
abstracting: (p7<=0)
states: 108,746,196 (8)
abstracting: (0<=p37)
states: 124,045,181 (8)
abstracting: (p37<=0)
states: 106,758,404 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)
.abstracting: (1<=p14)
states: 18,892,815 (7)
abstracting: (p14<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p31)
states: 18,892,816 (7)
abstracting: (p31<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p49)
states: 18,892,815 (7)
abstracting: (p49<=1)
states: 124,045,181 (8)
abstracting: (1<=p59)
states: 18,892,816 (7)
abstracting: (p59<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
......
EG iterations: 6
..-> the formula is TRUE

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

MC time: 0m42.994sec

checking: AG [[[~ [A [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p41<=1 & 1<=p41] & [p65<=1 & 1<=p65]]] U [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p27<=1 & 1<=p27] & [p65<=1 & 1<=p65]]]]] & [[[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]] | [[p27<=0 & 0<=p27] | [p65<=0 & 0<=p65]]]] & [[AG [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p34<=0 & 0<=p34] | [p65<=0 & 0<=p65]]]] | AF [[[[[p14<=0 & 0<=p14] | [p24<=0 & 0<=p24]] | [[p28<=0 & 0<=p28] | [p38<=0 & 0<=p38]]] | [[[p45<=0 & 0<=p45] | [p52<=0 & 0<=p52]] | [[p56<=0 & 0<=p56] | [p66<=0 & 0<=p66]]]]]] & [AX [E [AF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p39<=1 & 1<=p39] & [p65<=1 & 1<=p65]]]] U [[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p27<=1 & 1<=p27] & [p65<=1 & 1<=p65]]]]] | AG [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p50<=1 & 1<=p50] & [p65<=1 & 1<=p65]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U ~ [[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] | ~ [EX [~ [E [~ [EG [~ [[[[p65<=1 & 1<=p65] & [p39<=1 & 1<=p39]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] U [[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]]]] & [~ [EG [~ [[[[[p66<=0 & 0<=p66] | [p56<=0 & 0<=p56]] | [[p52<=0 & 0<=p52] | [p45<=0 & 0<=p45]]] | [[[p38<=0 & 0<=p38] | [p28<=0 & 0<=p28]] | [[p24<=0 & 0<=p24] | [p14<=0 & 0<=p14]]]]]]] | ~ [E [true U ~ [[[[p65<=0 & 0<=p65] | [p34<=0 & 0<=p34]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]]] & [[[[p65<=0 & 0<=p65] | [p27<=0 & 0<=p27]] | [[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]]] & ~ [[~ [EG [~ [[[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]] U [~ [[[[p65<=1 & 1<=p65] & [p41<=1 & 1<=p41]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] & ~ [[[[p65<=1 & 1<=p65] & [p27<=1 & 1<=p27]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p41)
states: 17,112,441 (7)
abstracting: (p41<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..........
EG iterations: 10
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p8)
states: 124,045,181 (8)
abstracting: (p8<=0)
states: 108,746,196 (8)
abstracting: (0<=p27)
states: 124,045,181 (8)
abstracting: (p27<=0)
states: 106,932,740 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 124,045,181 (8)
abstracting: (p7<=0)
states: 108,746,196 (8)
abstracting: (0<=p34)
states: 124,045,181 (8)
abstracting: (p34<=0)
states: 106,932,740 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)

before gc: list nodes free: 9750790

after gc: idd nodes used:414413, unused:63585587; list nodes free:312612684
abstracting: (0<=p14)
states: 124,045,181 (8)
abstracting: (p14<=0)
states: 105,152,366 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p28)
states: 124,045,181 (8)
abstracting: (p28<=0)
states: 105,152,366 (8)
abstracting: (0<=p38)
states: 124,045,181 (8)
abstracting: (p38<=0)
states: 105,152,365 (8)
abstracting: (0<=p45)
states: 124,045,181 (8)
abstracting: (p45<=0)
states: 105,152,365 (8)
abstracting: (0<=p52)
states: 124,045,181 (8)
abstracting: (p52<=0)
states: 105,152,365 (8)
abstracting: (0<=p56)
states: 124,045,181 (8)
abstracting: (p56<=0)
states: 105,152,366 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
...
EG iterations: 3
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p27)
states: 17,112,441 (7)
abstracting: (p27<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p39)
states: 17,286,777 (7)
abstracting: (p39<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p7)
states: 15,298,985 (7)
abstracting: (p7<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
-> the formula is FALSE

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

MC time: 2m 4.050sec

checking: EG [AG [[[~ [E [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p65<=1 & 1<=p65] & [p69<=1 & 1<=p69]]] U [p51<=1 & 1<=p51]]] | AF [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p51<=0 & 0<=p51] | [p65<=0 & 0<=p65]]]]] | [[[EX [[[[[p17<=1 & 1<=p17] & [p21<=1 & 1<=p21]] & [[p31<=1 & 1<=p31] & [p38<=1 & 1<=p38]]] & [[[p45<=1 & 1<=p45] & [p52<=1 & 1<=p52]] & [[p56<=1 & 1<=p56] & [p66<=1 & 1<=p66]]]]] | [[[[p14<=1 & 1<=p14] & [p21<=1 & 1<=p21]] & [[p31<=1 & 1<=p31] & [p35<=1 & 1<=p35]]] & [[[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]] & [[p56<=1 & 1<=p56] & [p66<=1 & 1<=p66]]]]] & [AG [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p36<=1 & 1<=p36] & [p65<=1 & 1<=p65]]]] | [AF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p57<=1 & 1<=p57] & [p65<=1 & 1<=p65]]]] | EG [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p51<=1 & 1<=p51] & [p65<=1 & 1<=p65]]]]]]] | [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p41<=1 & 1<=p41] & [[p65<=1 & 1<=p65] & [p57<=1 & 1<=p57]]]]]]]]
normalized: EG [~ [E [true U ~ [[[[[[[p57<=1 & 1<=p57] & [p65<=1 & 1<=p65]] & [p41<=1 & 1<=p41]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]] | [[[EG [[[[p65<=1 & 1<=p65] & [p51<=1 & 1<=p51]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]] | ~ [EG [~ [[[[p65<=1 & 1<=p65] & [p57<=1 & 1<=p57]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] | ~ [E [true U ~ [[[[p65<=1 & 1<=p65] & [p36<=1 & 1<=p36]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]] & [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p31<=1 & 1<=p31]] & [[p21<=1 & 1<=p21] & [p14<=1 & 1<=p14]]]] | EX [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p52<=1 & 1<=p52] & [p45<=1 & 1<=p45]]] & [[[p38<=1 & 1<=p38] & [p31<=1 & 1<=p31]] & [[p21<=1 & 1<=p21] & [p17<=1 & 1<=p17]]]]]]]] | [~ [EG [~ [[[[p65<=0 & 0<=p65] | [p51<=0 & 0<=p51]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]] | ~ [E [[[[p69<=1 & 1<=p69] & [p65<=1 & 1<=p65]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]] U [p51<=1 & 1<=p51]]]]]]]]]

abstracting: (1<=p51)
states: 17,286,777 (7)
abstracting: (p51<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p4)
states: 15,298,985 (7)
abstracting: (p4<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p69)
states: 20,252,918 (7)
abstracting: (p69<=1)
states: 124,045,181 (8)
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 124,045,181 (8)
abstracting: (p2<=0)
states: 114,706,271 (8)
abstracting: (0<=p51)
states: 124,045,181 (8)
abstracting: (p51<=0)
states: 106,758,404 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)
..............
EG iterations: 14
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p31)
states: 18,892,816 (7)
abstracting: (p31<=1)
states: 124,045,181 (8)
abstracting: (1<=p38)
states: 18,892,816 (7)
abstracting: (p38<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
.abstracting: (1<=p14)
states: 18,892,815 (7)
abstracting: (p14<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p31)
states: 18,892,816 (7)
abstracting: (p31<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p49)
states: 18,892,815 (7)
abstracting: (p49<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p5)
states: 15,298,985 (7)
abstracting: (p5<=1)
states: 124,045,181 (8)
abstracting: (1<=p36)
states: 17,286,777 (7)
abstracting: (p36<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p2)
states: 9,338,910 (6)
abstracting: (p2<=1)
states: 124,045,181 (8)
abstracting: (1<=p57)
states: 17,286,777 (7)
abstracting: (p57<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
.
EG iterations: 1
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p51)
states: 17,286,777 (7)
abstracting: (p51<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..............
EG iterations: 14
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p41)
states: 17,112,441 (7)
abstracting: (p41<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p57)
states: 17,286,777 (7)
abstracting: (p57<=1)
states: 124,045,181 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m42.542sec

checking: ~ [E [[[~ [[~ [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p37<=1 & 1<=p37] & [p65<=1 & 1<=p65]]]] | A [[[[[p17<=1 & 1<=p17] & [p21<=1 & 1<=p21]] & [[p31<=1 & 1<=p31] & [p35<=1 & 1<=p35]]] & [[[p45<=1 & 1<=p45] & [p49<=1 & 1<=p49]] & [[p59<=1 & 1<=p59] & [p66<=1 & 1<=p66]]]] U [[[[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]] & [[p28<=1 & 1<=p28] & [p35<=1 & 1<=p35]]] & [[[p42<=1 & 1<=p42] & [p52<=1 & 1<=p52]] & [[p56<=1 & 1<=p56] & [p66<=1 & 1<=p66]]]]]]] | [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p50<=1 & 1<=p50] & [p65<=1 & 1<=p65]]]] & ~ [[[[[[1<=p66 & p66<=1] & [1<=p59 & p59<=1]] & [1<=p52 & p52<=1]] & [[1<=p45 & p45<=1] & [p38<=1 & 1<=p38]]] & [[[1<=p31 & p31<=1] & [1<=p21 & p21<=1]] & [[p17<=1 & 1<=p17] & ~ [[[[p1<=1 & 1<=p1] & [1<=p8 & p8<=1]] & [[1<=p65 & p65<=1] & [p36<=1 & 1<=p36]]]]]]]]] U AG [EF [~ [E [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p36<=1 & 1<=p36] & [p65<=1 & 1<=p65]]] U [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p16<=1 & 1<=p16] & [p65<=1 & 1<=p65]]]]]]]]]
normalized: ~ [E [[~ [[[[~ [[[[p36<=1 & 1<=p36] & [1<=p65 & p65<=1]] & [[1<=p8 & p8<=1] & [p1<=1 & 1<=p1]]]] & [p17<=1 & 1<=p17]] & [[1<=p21 & p21<=1] & [1<=p31 & p31<=1]]] & [[[p38<=1 & 1<=p38] & [1<=p45 & p45<=1]] & [[1<=p52 & p52<=1] & [[1<=p59 & p59<=1] & [1<=p66 & p66<=1]]]]]] & [[[[p65<=1 & 1<=p65] & [p50<=1 & 1<=p50]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]] | ~ [[[~ [EG [~ [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p52<=1 & 1<=p52] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]]]] & ~ [E [~ [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p52<=1 & 1<=p52] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]] U [~ [[[[[p66<=1 & 1<=p66] & [p59<=1 & 1<=p59]] & [[p49<=1 & 1<=p49] & [p45<=1 & 1<=p45]]] & [[[p35<=1 & 1<=p35] & [p31<=1 & 1<=p31]] & [[p21<=1 & 1<=p21] & [p17<=1 & 1<=p17]]]]] & ~ [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p52<=1 & 1<=p52] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]]]]]] | ~ [[[[p65<=1 & 1<=p65] & [p37<=1 & 1<=p37]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]] U ~ [E [true U ~ [E [true U ~ [E [[[[p65<=1 & 1<=p65] & [p36<=1 & 1<=p36]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] U [[[p65<=1 & 1<=p65] & [p16<=1 & 1<=p16]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p16)
states: 17,286,777 (7)
abstracting: (p16<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p36)
states: 17,286,777 (7)
abstracting: (p36<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p37)
states: 17,286,777 (7)
abstracting: (p37<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p31)
states: 18,892,816 (7)
abstracting: (p31<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p49)
states: 18,892,815 (7)
abstracting: (p49<=1)
states: 124,045,181 (8)
abstracting: (1<=p59)
states: 18,892,816 (7)
abstracting: (p59<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p24)
states: 18,892,816 (7)
abstracting: (p24<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p35)
states: 18,892,815 (7)
abstracting: (p35<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p6)
states: 15,298,985 (7)
abstracting: (p6<=1)
states: 124,045,181 (8)
abstracting: (1<=p50)
states: 17,286,777 (7)
abstracting: (p50<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p59<=1)
states: 124,045,181 (8)
abstracting: (1<=p59)
states: 18,892,816 (7)
abstracting: (p52<=1)
states: 124,045,181 (8)
abstracting: (1<=p52)
states: 18,892,816 (7)
abstracting: (p45<=1)
states: 124,045,181 (8)
abstracting: (1<=p45)
states: 18,892,816 (7)
abstracting: (1<=p38)
states: 18,892,816 (7)
abstracting: (p38<=1)
states: 124,045,181 (8)
abstracting: (p31<=1)
states: 124,045,181 (8)
abstracting: (1<=p31)
states: 18,892,816 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (1<=p17)
states: 18,892,816 (7)
abstracting: (p17<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (p8<=1)
states: 124,045,181 (8)
abstracting: (1<=p8)
states: 15,298,985 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (1<=p36)
states: 17,286,777 (7)
abstracting: (p36<=1)
states: 124,045,181 (8)
-> the formula is FALSE

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

MC time: 0m 1.691sec

checking: EG [[E [[[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p29<=1 & 1<=p29] & [p65<=1 & 1<=p65]]] | [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p29<=1 & 1<=p29] & [p65<=1 & 1<=p65]]]] U AG [A [[[[[p14<=1 & 1<=p14] & [p21<=1 & 1<=p21]] & [[p28<=1 & 1<=p28] & [p38<=1 & 1<=p38]]] & [[[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]] & [[p56<=1 & 1<=p56] & [p66<=1 & 1<=p66]]]] U [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p30<=1 & 1<=p30] & [p65<=1 & 1<=p65]]]]]] | [EG [[[[[[[p17<=0 & 0<=p17] | [p24<=0 & 0<=p24]] | [[p28<=0 & 0<=p28] | [p35<=0 & 0<=p35]]] | [[[p45<=0 & 0<=p45] | [p49<=0 & 0<=p49]] | [[p56<=0 & 0<=p56] | [p66<=0 & 0<=p66]]]] & [[[p1<=0 & 0<=p1] | [p9<=0 & 0<=p9]] | [[p41<=0 & 0<=p41] | [p65<=0 & 0<=p65]]]] | EG [[[[p1<=0 & 0<=p1] | [p10<=0 & 0<=p10]] | [[p51<=0 & 0<=p51] | [p65<=0 & 0<=p65]]]]]] | EX [[[[[p17<=0 & 0<=p17] | [p24<=0 & 0<=p24]] | [[p28<=0 & 0<=p28] | [p35<=0 & 0<=p35]]] | [[[p45<=0 & 0<=p45] | [p52<=0 & 0<=p52]] | [[p56<=0 & 0<=p56] | [p66<=0 & 0<=p66]]]]]]]]
normalized: EG [[[EX [[[[[p66<=0 & 0<=p66] | [p56<=0 & 0<=p56]] | [[p52<=0 & 0<=p52] | [p45<=0 & 0<=p45]]] | [[[p35<=0 & 0<=p35] | [p28<=0 & 0<=p28]] | [[p24<=0 & 0<=p24] | [p17<=0 & 0<=p17]]]]] | EG [[EG [[[[p65<=0 & 0<=p65] | [p51<=0 & 0<=p51]] | [[p10<=0 & 0<=p10] | [p1<=0 & 0<=p1]]]] | [[[[p65<=0 & 0<=p65] | [p41<=0 & 0<=p41]] | [[p9<=0 & 0<=p9] | [p1<=0 & 0<=p1]]] & [[[[p66<=0 & 0<=p66] | [p56<=0 & 0<=p56]] | [[p49<=0 & 0<=p49] | [p45<=0 & 0<=p45]]] | [[[p35<=0 & 0<=p35] | [p28<=0 & 0<=p28]] | [[p24<=0 & 0<=p24] | [p17<=0 & 0<=p17]]]]]]]] | E [[[[[p65<=1 & 1<=p65] & [p29<=1 & 1<=p29]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [[[p65<=1 & 1<=p65] & [p29<=1 & 1<=p29]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]] U ~ [E [true U ~ [[~ [EG [~ [[[[p65<=1 & 1<=p65] & [p30<=1 & 1<=p30]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p65<=1 & 1<=p65] & [p30<=1 & 1<=p30]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]] U [~ [[[[[p66<=1 & 1<=p66] & [p56<=1 & 1<=p56]] & [[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]]] & [[[p38<=1 & 1<=p38] & [p28<=1 & 1<=p28]] & [[p21<=1 & 1<=p21] & [p14<=1 & 1<=p14]]]]] & ~ [[[[p65<=1 & 1<=p65] & [p30<=1 & 1<=p30]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p30)
states: 17,286,777 (7)
abstracting: (p30<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p14)
states: 18,892,815 (7)
abstracting: (p14<=1)
states: 124,045,181 (8)
abstracting: (1<=p21)
states: 18,892,815 (7)
abstracting: (p21<=1)
states: 124,045,181 (8)
abstracting: (1<=p28)
states: 18,892,815 (7)
abstracting: (p28<=1)
states: 124,045,181 (8)
abstracting: (1<=p38)
states: 18,892,816 (7)
abstracting: (p38<=1)
states: 124,045,181 (8)
abstracting: (1<=p42)
states: 18,892,815 (7)
abstracting: (p42<=1)
states: 124,045,181 (8)
abstracting: (1<=p49)
states: 18,892,815 (7)
abstracting: (p49<=1)
states: 124,045,181 (8)
abstracting: (1<=p56)
states: 18,892,815 (7)
abstracting: (p56<=1)
states: 124,045,181 (8)
abstracting: (1<=p66)
states: 32,196,109 (7)
abstracting: (p66<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p30)
states: 17,286,777 (7)
abstracting: (p30<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p30)
states: 17,286,777 (7)
abstracting: (p30<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
..........
EG iterations: 10
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p10)
states: 13,853,387 (7)
abstracting: (p10<=1)
states: 124,045,181 (8)
abstracting: (1<=p29)
states: 17,286,777 (7)
abstracting: (p29<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (1<=p1)
states: 124,045,180 (8)
abstracting: (p1<=1)
states: 124,045,181 (8)
abstracting: (1<=p9)
states: 15,298,985 (7)
abstracting: (p9<=1)
states: 124,045,181 (8)
abstracting: (1<=p29)
states: 17,286,777 (7)
abstracting: (p29<=1)
states: 124,045,181 (8)
abstracting: (1<=p65)
states: 35,692,285 (7)
abstracting: (p65<=1)
states: 124,045,181 (8)
abstracting: (0<=p17)
states: 124,045,181 (8)
abstracting: (p17<=0)
states: 105,152,365 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p28)
states: 124,045,181 (8)
abstracting: (p28<=0)
states: 105,152,366 (8)
abstracting: (0<=p35)
states: 124,045,181 (8)
abstracting: (p35<=0)
states: 105,152,366 (8)
abstracting: (0<=p45)
states: 124,045,181 (8)
abstracting: (p45<=0)
states: 105,152,365 (8)
abstracting: (0<=p49)
states: 124,045,181 (8)
abstracting: (p49<=0)
states: 105,152,366 (8)
abstracting: (0<=p56)
states: 124,045,181 (8)
abstracting: (p56<=0)
states: 105,152,366 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p9)
states: 124,045,181 (8)
abstracting: (p9<=0)
states: 108,746,196 (8)
abstracting: (0<=p41)
states: 124,045,181 (8)
abstracting: (p41<=0)
states: 106,932,740 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)
abstracting: (0<=p1)
states: 124,045,181 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p10)
states: 124,045,181 (8)
abstracting: (p10<=0)
states: 110,191,794 (8)
abstracting: (0<=p51)
states: 124,045,181 (8)
abstracting: (p51<=0)
states: 106,758,404 (8)
abstracting: (0<=p65)
states: 124,045,181 (8)
abstracting: (p65<=0)
states: 88,352,896 (7)
..........
EG iterations: 10

EG iterations: 0
abstracting: (0<=p17)
states: 124,045,181 (8)
abstracting: (p17<=0)
states: 105,152,365 (8)
abstracting: (0<=p24)
states: 124,045,181 (8)
abstracting: (p24<=0)
states: 105,152,365 (8)
abstracting: (0<=p28)
states: 124,045,181 (8)
abstracting: (p28<=0)
states: 105,152,366 (8)
abstracting: (0<=p35)
states: 124,045,181 (8)
abstracting: (p35<=0)
states: 105,152,366 (8)
abstracting: (0<=p45)
states: 124,045,181 (8)
abstracting: (p45<=0)
states: 105,152,365 (8)
abstracting: (0<=p52)
states: 124,045,181 (8)
abstracting: (p52<=0)
states: 105,152,365 (8)
abstracting: (0<=p56)
states: 124,045,181 (8)
abstracting: (p56<=0)
states: 105,152,366 (8)
abstracting: (0<=p66)
states: 124,045,181 (8)
abstracting: (p66<=0)
states: 91,849,072 (7)
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 7.120sec

totally nodes used: 205780752 (2.1e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 1302663643 2613772381 3916436024
used/not used/entry size/cache size: 66310244 798620 16 1024MB
basic ops cache: hits/miss/sum: 70771511 94413855 165185366
used/not used/entry size/cache size: 12271309 4505907 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: 436518 910690 1347208
used/not used/entry size/cache size: 354768 8033840 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 54144846
1 11197676
2 1554653
3 189749
4 20014
5 1778
6 136
7 11
8 1
9 0
>= 10 0

Total processing time: 18m 2.697sec


BK_STOP 1678701073423

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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

36153 49396 37046 38846 38935 40127 40549 40607 40600 40748
iterations count:1029211 (2715), effective:18787 (49)

initing FirstDep: 0m 0.000sec

14874 16584 20285 17518 24467 27290 21412 21482
iterations count:866858 (2287), effective:10576 (27)

iterations count:1561 (4), effective:38 (0)
12310 14242 19145 21601 17200 23498 29570 29046 33319 31030 33795 22950
iterations count:1213918 (3202), effective:13745 (36)

iterations count:56274 (148), effective:961 (2)

iterations count:379 (1), effective:0 (0)
13536 15226 18404 18939 22125 19760 25712 22070
iterations count:865109 (2282), effective:10449 (27)
12811 17765 19006 19271 22370 28434 25935 25865
iterations count:828067 (2184), effective:10581 (27)
47838 46497
iterations count:282512 (745), effective:4957 (13)

iterations count:421 (1), effective:1 (0)
25947 29711 31864 34854 35459 40977 37746 41203 38330 46583 49690 48528 47215 46087 48939 50249 49805 48637 48270
iterations count:1951016 (5147), effective:21616 (57)
11324 17084 18854 21166 24807 25948 27011 24039
iterations count:854235 (2253), effective:10624 (28)

iterations count:604 (1), effective:1 (0)
11482 13105 15717 15237 21096 19847 21786 23364
iterations count:864257 (2280), effective:10525 (27)
7387 7216
iterations count:296877 (783), effective:4268 (11)

iterations count:725 (1), effective:1 (0)
10935 11873 15432 15440 20048 20383 18386 22138 19036
iterations count:917486 (2420), effective:10999 (29)

iterations count:736 (1), effective:10 (0)

iterations count:2581 (6), effective:27 (0)
9597 17239 19379 20239 25360 26124 28864 25889 29627 36421 36874 37076 38064 44638 46924 41065 39406 33955
iterations count:1862126 (4913), effective:21161 (55)

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

iterations count:3010 (7), effective:29 (0)

iterations count:18787 (49), effective:64 (0)

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

iterations count:2245 (5), effective:25 (0)
11179 14974 16255 14969 20271 18868 24606 21420
iterations count:840648 (2218), effective:10471 (27)

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

iterations count:466 (1), effective:5 (0)

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

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

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

iterations count:541 (1), effective:7 (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-07a"
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-07a, 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-167813599300626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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