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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K 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-03a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678698880430

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:14:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:14:42] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-13 09:14:42] [INFO ] Transformed 41 places.
[2023-03-13 09:14:42] [INFO ] Transformed 121 transitions.
[2023-03-13 09:14:42] [INFO ] Found NUPN structural information;
[2023-03-13 09:14:42] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Applied a total of 0 rules in 9 ms. Remains 41 /41 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-13 09:14:42] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2023-03-13 09:14:42] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-13 09:14:42] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-13 09:14:42] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-13 09:14:42] [INFO ] Invariant cache hit.
[2023-03-13 09:14:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-13 09:14:42] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 456 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/41 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 40/41 places, 76/76 transitions.
Support contains 37 out of 40 places after structural reductions.
[2023-03-13 09:14:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 40 ms
FORMULA AutonomousCar-PT-03a-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 76 transitions.
Support contains 36 out of 40 places (down from 37) after GAL structural reductions.
FORMULA AutonomousCar-PT-03a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 572 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 50) seen :47
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:14:43] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 40 cols
[2023-03-13 09:14:43] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 09:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:14:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 76 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 75
Applied a total of 2 rules in 4 ms. Remains 39 /40 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/40 places, 75/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 38 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 68
Applied a total of 4 rules in 2 ms. Remains 38 /40 variables (removed 2) and now considering 68/76 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/40 places, 68/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 34 transition count 70
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 11 place count 33 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 29 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 29 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 27 transition count 55
Applied a total of 23 rules in 13 ms. Remains 27 /40 variables (removed 13) and now considering 55/76 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 27/40 places, 55/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 1 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 37/40 places, 67/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 38 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 37 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 37 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 35 transition count 68
Applied a total of 10 rules in 7 ms. Remains 35 /40 variables (removed 5) and now considering 68/76 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 35/40 places, 68/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 38 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 68
Applied a total of 4 rules in 1 ms. Remains 38 /40 variables (removed 2) and now considering 68/76 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/40 places, 68/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 38 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 68
Applied a total of 4 rules in 2 ms. Remains 38 /40 variables (removed 2) and now considering 68/76 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/40 places, 68/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 2 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/40 places, 67/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 1 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 36/40 places, 63/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 40 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 37 transition count 72
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 8 place count 36 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 32 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 32 transition count 59
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 18 place count 31 transition count 58
Applied a total of 18 rules in 7 ms. Remains 31 /40 variables (removed 9) and now considering 58/76 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 31/40 places, 58/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 2 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/40 places, 63/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 1 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 36/40 places, 63/76 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:14:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:14:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 76 transitions and 436 arcs took 0 ms.
Total runtime 1745 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 40 NrTr: 76 NrArc: 436)

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

net check time: 0m 0.000sec

init dd package: 0m 2.771sec


RS generation: 0m 0.037sec


-> reachability set: #nodes 1201 (1.2e+03) #states 22,521 (4)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 22,521 (4)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

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

abstracting: (0<=p0)
states: 22,521 (4)
abstracting: (p0<=0)
states: 22,520 (4)
...
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [AF [EG [EF [[[p14<=0 & 0<=p14] & [p17<=1 & 1<=p17]]]]]]
normalized: ~ [E [true U EG [~ [EG [E [true U [[p17<=1 & 1<=p17] & [p14<=0 & 0<=p14]]]]]]]]

abstracting: (0<=p14)
states: 22,521 (4)
abstracting: (p14<=0)
states: 19,604 (4)
abstracting: (1<=p17)
states: 4,015 (3)
abstracting: (p17<=1)
states: 22,521 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [AX [AF [[~ [[p1<=0 & 0<=p1]] & ~ [[p18<=1 & 1<=p18]]]]]]
normalized: ~ [E [true U EX [EG [~ [[~ [[p18<=1 & 1<=p18]] & ~ [[p1<=0 & 0<=p1]]]]]]]]

abstracting: (0<=p1)
states: 22,521 (4)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p18)
states: 2,917 (3)
abstracting: (p18<=1)
states: 22,521 (4)
..........
EG iterations: 10
.-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: EF [[[p2<=1 & 1<=p2] & ~ [E [[[p15<=0 & 0<=p15] | [p6<=1 & 1<=p6]] U [~ [AG [[p22<=1 & 1<=p22]]] | AG [[p2<=0 & 0<=p2]]]]]]]
normalized: E [true U [~ [E [[[p6<=1 & 1<=p6] | [p15<=0 & 0<=p15]] U [~ [E [true U ~ [[p2<=0 & 0<=p2]]]] | E [true U ~ [[p22<=1 & 1<=p22]]]]]] & [p2<=1 & 1<=p2]]]

abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p22<=1)
states: 22,521 (4)
abstracting: (0<=p2)
states: 22,521 (4)
abstracting: (p2<=0)
states: 18,531 (4)
abstracting: (0<=p15)
states: 22,521 (4)
abstracting: (p15<=0)
states: 19,604 (4)
abstracting: (1<=p6)
states: 4,787 (3)
abstracting: (p6<=1)
states: 22,521 (4)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AF [AX [[[p32<=0 & 0<=p32] & [~ [A [[[p34<=0 & 0<=p34] | [p20<=1 & 1<=p20]] U [p2<=1 & 1<=p2]]] & EG [[[p32<=0 & 0<=p32] & [p16<=1 & 1<=p16]]]]]]]
normalized: ~ [EG [EX [~ [[[EG [[[p16<=1 & 1<=p16] & [p32<=0 & 0<=p32]]] & ~ [[~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[[p20<=1 & 1<=p20] | [p34<=0 & 0<=p34]]] & ~ [[p2<=1 & 1<=p2]]]]]]]] & [p32<=0 & 0<=p32]]]]]]

abstracting: (0<=p32)
states: 22,521 (4)
abstracting: (p32<=0)
states: 19,317 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (0<=p34)
states: 22,521 (4)
abstracting: (p34<=0)
states: 16,572 (4)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
............
EG iterations: 12
abstracting: (0<=p32)
states: 22,521 (4)
abstracting: (p32<=0)
states: 19,317 (4)
abstracting: (1<=p16)
states: 2,821 (3)
abstracting: (p16<=1)
states: 22,521 (4)
.......
EG iterations: 7
.....................................
EG iterations: 36
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.183sec

checking: A [[[p0<=0 & 0<=p0] | [[p3<=1 & 1<=p3] | [p10<=1 & 1<=p10]]] U EX [[AG [[EX [0<=0] | ~ [[p37<=1 & 1<=p37]]]] & [[p7<=0 & 0<=p7] | [p14<=1 & 1<=p14]]]]]
normalized: [~ [EG [~ [EX [[[[p14<=1 & 1<=p14] | [p7<=0 & 0<=p7]] & ~ [E [true U ~ [[~ [[p37<=1 & 1<=p37]] | EX [0<=0]]]]]]]]]] & ~ [E [~ [EX [[[[p14<=1 & 1<=p14] | [p7<=0 & 0<=p7]] & ~ [E [true U ~ [[~ [[p37<=1 & 1<=p37]] | EX [0<=0]]]]]]]] U [~ [[[[p10<=1 & 1<=p10] | [p3<=1 & 1<=p3]] | [p0<=0 & 0<=p0]]] & ~ [EX [[[[p14<=1 & 1<=p14] | [p7<=0 & 0<=p7]] & ~ [E [true U ~ [[~ [[p37<=1 & 1<=p37]] | EX [0<=0]]]]]]]]]]]]

abstracting: (0<=0)
states: 22,521 (4)
.abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (0<=p7)
states: 22,521 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p14<=1)
states: 22,521 (4)
.abstracting: (0<=p0)
states: 22,521 (4)
abstracting: (p0<=0)
states: 22,520 (4)
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p10<=1)
states: 22,521 (4)
abstracting: (0<=0)
states: 22,521 (4)
.abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (0<=p7)
states: 22,521 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p14<=1)
states: 22,521 (4)
.abstracting: (0<=0)
states: 22,521 (4)
.abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (0<=p7)
states: 22,521 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p14<=1)
states: 22,521 (4)
.......
EG iterations: 6
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [[AF [[[[p21<=0 & 0<=p21] & [p16<=1 & 1<=p16]] | [[p4<=0 & 0<=p4] & [[p36<=1 & 1<=p36] & [p5<=0 & 0<=p5]]]]] & [A [E [~ [[p35<=1 & 1<=p35]] U AG [[p8<=1 & 1<=p8]]] U [p20<=1 & 1<=p20]] | [EG [EX [0<=0]] & [p4<=1 & 1<=p4]]]]]
normalized: E [true U [[[[p4<=1 & 1<=p4] & EG [EX [0<=0]]] | [~ [EG [~ [[p20<=1 & 1<=p20]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [~ [E [~ [[p35<=1 & 1<=p35]] U ~ [E [true U ~ [[p8<=1 & 1<=p8]]]]]] & ~ [[p20<=1 & 1<=p20]]]]]]] & ~ [EG [~ [[[[[p5<=0 & 0<=p5] & [p36<=1 & 1<=p36]] & [p4<=0 & 0<=p4]] | [[p16<=1 & 1<=p16] & [p21<=0 & 0<=p21]]]]]]]]

abstracting: (0<=p21)
states: 22,521 (4)
abstracting: (p21<=0)
states: 19,604 (4)
abstracting: (1<=p16)
states: 2,821 (3)
abstracting: (p16<=1)
states: 22,521 (4)
abstracting: (0<=p4)
states: 22,521 (4)
abstracting: (p4<=0)
states: 17,536 (4)
abstracting: (1<=p36)
states: 4,363 (3)
abstracting: (p36<=1)
states: 22,521 (4)
abstracting: (0<=p5)
states: 22,521 (4)
abstracting: (p5<=0)
states: 17,536 (4)
.........
EG iterations: 9
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p8<=1)
states: 22,521 (4)
abstracting: (1<=p35)
states: 4,363 (3)
abstracting: (p35<=1)
states: 22,521 (4)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p20<=1)
states: 22,521 (4)
....
EG iterations: 4
abstracting: (0<=0)
states: 22,521 (4)
.....................................
EG iterations: 36
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

checking: [AG [AF [AX [[[p19<=0 & 0<=p19] | [[p36<=1 & 1<=p36] | [p9<=1 & 1<=p9]]]]]] | AF [[[AG [[[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]]] & [p2<=1 & 1<=p2]] & [EX [[[p39<=0 & 0<=p39] | [p22<=1 & 1<=p22]]] & [AF [[p1<=1 & 1<=p1]] | AG [[[p27<=0 & 0<=p27] & [p21<=1 & 1<=p21]]]]]]]]
normalized: [~ [EG [~ [[[[~ [E [true U ~ [[[p21<=1 & 1<=p21] & [p27<=0 & 0<=p27]]]]] | ~ [EG [~ [[p1<=1 & 1<=p1]]]]] & EX [[[p22<=1 & 1<=p22] | [p39<=0 & 0<=p39]]]] & [[p2<=1 & 1<=p2] & ~ [E [true U ~ [[[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]]] | ~ [E [true U EG [EX [~ [[[[p9<=1 & 1<=p9] | [p36<=1 & 1<=p36]] | [p19<=0 & 0<=p19]]]]]]]]

abstracting: (0<=p19)
states: 22,521 (4)
abstracting: (p19<=0)
states: 19,604 (4)
abstracting: (1<=p36)
states: 4,363 (3)
abstracting: (p36<=1)
states: 22,521 (4)
abstracting: (1<=p9)
states: 2,821 (3)
abstracting: (p9<=1)
states: 22,521 (4)
..............
EG iterations: 13
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p10<=1)
states: 22,521 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (0<=p39)
states: 22,521 (4)
abstracting: (p39<=0)
states: 19,511 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p22<=1)
states: 22,521 (4)
.abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p1<=1)
states: 22,521 (4)
..
EG iterations: 2
abstracting: (0<=p27)
states: 22,521 (4)
abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: E [~ [[[[EG [[[[p29<=0 & 0<=p29] | [p12<=1 & 1<=p12]] & [p10<=1 & 1<=p10]]] & ~ [EG [[p6<=0 & 0<=p6]]]] & [[p37<=1 & 1<=p37] & [[p10<=1 & 1<=p10] & [[p3<=1 & 1<=p3] | [[p23<=0 & 0<=p23] | [p21<=1 & 1<=p21]]]]]] | A [EX [~ [[p37<=0 & 0<=p37]]] U ~ [[p12<=1 & 1<=p12]]]]] U ~ [EF [~ [EG [~ [[p30<=1 & 1<=p30]]]]]]]
normalized: E [~ [[[~ [EG [[p12<=1 & 1<=p12]]] & ~ [E [[p12<=1 & 1<=p12] U [~ [EX [~ [[p37<=0 & 0<=p37]]]] & [p12<=1 & 1<=p12]]]]] | [[[[[[p21<=1 & 1<=p21] | [p23<=0 & 0<=p23]] | [p3<=1 & 1<=p3]] & [p10<=1 & 1<=p10]] & [p37<=1 & 1<=p37]] & [~ [EG [[p6<=0 & 0<=p6]]] & EG [[[p10<=1 & 1<=p10] & [[p12<=1 & 1<=p12] | [p29<=0 & 0<=p29]]]]]]]] U ~ [E [true U ~ [EG [~ [[p30<=1 & 1<=p30]]]]]]]

abstracting: (1<=p30)
states: 686
abstracting: (p30<=1)
states: 22,521 (4)
.............
EG iterations: 13
abstracting: (0<=p29)
states: 22,521 (4)
abstracting: (p29<=0)
states: 21,835 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p10<=1)
states: 22,521 (4)
.......
EG iterations: 7
abstracting: (0<=p6)
states: 22,521 (4)
abstracting: (p6<=0)
states: 17,734 (4)
........
EG iterations: 8
abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p10<=1)
states: 22,521 (4)
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (0<=p23)
states: 22,521 (4)
abstracting: (p23<=0)
states: 19,700 (4)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (0<=p37)
states: 22,521 (4)
abstracting: (p37<=0)
states: 18,158 (4)
.abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p12<=1)
states: 22,521 (4)
..........
EG iterations: 10
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.161sec

checking: E [~ [[[[AG [[p23<=0 & 0<=p23]] & [[p37<=1 & 1<=p37] & [[p14<=0 & 0<=p14] | [p27<=1 & 1<=p27]]]] | [AG [[p19<=1 & 1<=p19]] | [p5<=1 & 1<=p5]]] | [[p36<=0 & 0<=p36] | [[p28<=1 & 1<=p28] | [p4<=1 & 1<=p4]]]]] U EF [[E [[[p21<=1 & 1<=p21] | [p4<=1 & 1<=p4]] U EF [[p11<=1 & 1<=p11]]] & E [[p1<=1 & 1<=p1] U EG [[p11<=0 & 0<=p11]]]]]]
normalized: E [~ [[[[[p4<=1 & 1<=p4] | [p28<=1 & 1<=p28]] | [p36<=0 & 0<=p36]] | [[[p5<=1 & 1<=p5] | ~ [E [true U ~ [[p19<=1 & 1<=p19]]]]] | [[[[p27<=1 & 1<=p27] | [p14<=0 & 0<=p14]] & [p37<=1 & 1<=p37]] & ~ [E [true U ~ [[p23<=0 & 0<=p23]]]]]]]] U E [true U [E [[[p4<=1 & 1<=p4] | [p21<=1 & 1<=p21]] U E [true U [p11<=1 & 1<=p11]]] & E [[p1<=1 & 1<=p1] U EG [[p11<=0 & 0<=p11]]]]]]

abstracting: (0<=p11)
states: 22,521 (4)
abstracting: (p11<=0)
states: 19,604 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p1<=1)
states: 22,521 (4)
abstracting: (1<=p11)
states: 2,917 (3)
abstracting: (p11<=1)
states: 22,521 (4)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (0<=p23)
states: 22,521 (4)
abstracting: (p23<=0)
states: 19,700 (4)
abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (0<=p14)
states: 22,521 (4)
abstracting: (p14<=0)
states: 19,604 (4)
abstracting: (1<=p27)
states: 4,016 (3)
abstracting: (p27<=1)
states: 22,521 (4)
abstracting: (1<=p19)
states: 2,917 (3)
abstracting: (p19<=1)
states: 22,521 (4)
abstracting: (1<=p5)
states: 4,985 (3)
abstracting: (p5<=1)
states: 22,521 (4)
abstracting: (0<=p36)
states: 22,521 (4)
abstracting: (p36<=0)
states: 18,158 (4)
abstracting: (1<=p28)
states: 686
abstracting: (p28<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: [EX [[[[p8<=1 & 1<=p8] & [[p37<=1 & 1<=p37] & [[p17<=0 & 0<=p17] | [p22<=1 & 1<=p22]]]] | [EX [[[[p4<=1 & 1<=p4] & [p21<=0 & 0<=p21]] & [[[p18<=0 & 0<=p18] | [p12<=1 & 1<=p12]] & [p12<=0 & 0<=p12]]]] | A [[p32<=1 & 1<=p32] U EF [[[p38<=0 & 0<=p38] | [p4<=1 & 1<=p4]]]]]]] & [A [E [[EG [[p25<=1 & 1<=p25]] & EF [[[p17<=0 & 0<=p17] | [p11<=1 & 1<=p11]]]] U AX [[[p4<=1 & 1<=p4] | [p21<=1 & 1<=p21]]]] U [[p31<=0 & 0<=p31] | [p2<=1 & 1<=p2]]] & A [[[p22<=0 & 0<=p22] | [p6<=1 & 1<=p6]] U AF [[EG [[p3<=1 & 1<=p3]] & EG [[p21<=1 & 1<=p21]]]]]]]
normalized: [[[~ [EG [EG [~ [[EG [[p21<=1 & 1<=p21]] & EG [[p3<=1 & 1<=p3]]]]]]] & ~ [E [EG [~ [[EG [[p21<=1 & 1<=p21]] & EG [[p3<=1 & 1<=p3]]]]] U [~ [[[p6<=1 & 1<=p6] | [p22<=0 & 0<=p22]]] & EG [~ [[EG [[p21<=1 & 1<=p21]] & EG [[p3<=1 & 1<=p3]]]]]]]]] & [~ [EG [~ [[[p2<=1 & 1<=p2] | [p31<=0 & 0<=p31]]]]] & ~ [E [~ [[[p2<=1 & 1<=p2] | [p31<=0 & 0<=p31]]] U [~ [E [[E [true U [[p11<=1 & 1<=p11] | [p17<=0 & 0<=p17]]] & EG [[p25<=1 & 1<=p25]]] U ~ [EX [~ [[[p21<=1 & 1<=p21] | [p4<=1 & 1<=p4]]]]]]] & ~ [[[p2<=1 & 1<=p2] | [p31<=0 & 0<=p31]]]]]]]] & EX [[[[~ [EG [~ [E [true U [[p4<=1 & 1<=p4] | [p38<=0 & 0<=p38]]]]]] & ~ [E [~ [E [true U [[p4<=1 & 1<=p4] | [p38<=0 & 0<=p38]]]] U [~ [[p32<=1 & 1<=p32]] & ~ [E [true U [[p4<=1 & 1<=p4] | [p38<=0 & 0<=p38]]]]]]]] | EX [[[[p12<=0 & 0<=p12] & [[p12<=1 & 1<=p12] | [p18<=0 & 0<=p18]]] & [[p21<=0 & 0<=p21] & [p4<=1 & 1<=p4]]]]] | [[[[p22<=1 & 1<=p22] | [p17<=0 & 0<=p17]] & [p37<=1 & 1<=p37]] & [p8<=1 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p8<=1)
states: 22,521 (4)
abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (0<=p17)
states: 22,521 (4)
abstracting: (p17<=0)
states: 18,506 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p22<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (0<=p21)
states: 22,521 (4)
abstracting: (p21<=0)
states: 19,604 (4)
abstracting: (0<=p18)
states: 22,521 (4)
abstracting: (p18<=0)
states: 19,604 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (0<=p12)
states: 22,521 (4)
abstracting: (p12<=0)
states: 19,604 (4)
.abstracting: (0<=p38)
states: 22,521 (4)
abstracting: (p38<=0)
states: 11,737 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (1<=p32)
states: 3,204 (3)
abstracting: (p32<=1)
states: 22,521 (4)
abstracting: (0<=p38)
states: 22,521 (4)
abstracting: (p38<=0)
states: 11,737 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (0<=p38)
states: 22,521 (4)
abstracting: (p38<=0)
states: 11,737 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
.
EG iterations: 1
.abstracting: (0<=p31)
states: 22,521 (4)
abstracting: (p31<=0)
states: 19,317 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
.abstracting: (1<=p25)
states: 2,917 (3)
abstracting: (p25<=1)
states: 22,521 (4)
..........
EG iterations: 10
abstracting: (0<=p17)
states: 22,521 (4)
abstracting: (p17<=0)
states: 18,506 (4)
abstracting: (1<=p11)
states: 2,917 (3)
abstracting: (p11<=1)
states: 22,521 (4)
abstracting: (0<=p31)
states: 22,521 (4)
abstracting: (p31<=0)
states: 19,317 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (0<=p31)
states: 22,521 (4)
abstracting: (p31<=0)
states: 19,317 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p2<=1)
states: 22,521 (4)
......
EG iterations: 6
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p3<=1)
states: 22,521 (4)
............
EG iterations: 12
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
...
EG iterations: 3
......
EG iterations: 6
abstracting: (0<=p22)
states: 22,521 (4)
abstracting: (p22<=0)
states: 19,604 (4)
abstracting: (1<=p6)
states: 4,787 (3)
abstracting: (p6<=1)
states: 22,521 (4)
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p3<=1)
states: 22,521 (4)
............
EG iterations: 12
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
...
EG iterations: 3
......
EG iterations: 6
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p3<=1)
states: 22,521 (4)
............
EG iterations: 12
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p21<=1)
states: 22,521 (4)
...
EG iterations: 3
......
EG iterations: 6
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.152sec

totally nodes used: 620615 (6.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1209793 2731814 3941607
used/not used/entry size/cache size: 3237538 63871326 16 1024MB
basic ops cache: hits/miss/sum: 292575 500112 792687
used/not used/entry size/cache size: 916099 15861117 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: 7710 15977 23687
used/not used/entry size/cache size: 15964 8372644 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 66513370
1 572406
2 21172
3 1803
4 109
5 4
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.672sec


BK_STOP 1678698889733

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

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


initing FirstDep: 0m 0.000sec


iterations count:6300 (82), effective:591 (7)

initing FirstDep: 0m 0.000sec


iterations count:2512 (33), effective:162 (2)

iterations count:1782 (23), effective:78 (1)

iterations count:1301 (17), effective:66 (0)

iterations count:2197 (28), effective:128 (1)

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

iterations count:2480 (32), effective:229 (3)

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

iterations count:1779 (23), effective:130 (1)

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

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

iterations count:3751 (49), effective:283 (3)

iterations count:2307 (30), effective:136 (1)

iterations count:290 (3), effective:22 (0)

iterations count:270 (3), effective:4 (0)

iterations count:3622 (47), effective:305 (4)

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

iterations count:151 (1), effective:15 (0)

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

iterations count:1786 (23), effective:76 (1)

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

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

iterations count:3213 (42), effective:208 (2)

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

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

iterations count:2905 (38), effective:203 (2)

iterations count:2905 (38), effective:203 (2)

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

iterations count:2905 (38), effective:203 (2)

iterations count:1291 (16), effective:58 (0)

iterations count:226 (2), effective:8 (0)

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

iterations count:2075 (27), effective:103 (1)

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-03a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AutonomousCar-PT-03a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599200561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03a.tgz
mv AutonomousCar-PT-03a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;