About the Execution of Marcie+red for AutonomousCar-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.283 | 10935.00 | 18563.00 | 29.90 | TTFTFFFTFTTTFFTF | normal |
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-167813599200545.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutonomousCar-PT-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200545
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678698705574
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-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:11:48] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-13 09:11:48] [INFO ] Transformed 33 places.
[2023-03-13 09:11:48] [INFO ] Transformed 69 transitions.
[2023-03-13 09:11:48] [INFO ] Found NUPN structural information;
[2023-03-13 09:11:48] [INFO ] Parsed PT model containing 33 places and 69 transitions and 368 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02a-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-13 09:11:48] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 33 cols
[2023-03-13 09:11:48] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-13 09:11:48] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-13 09:11:48] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
[2023-03-13 09:11:48] [INFO ] Invariant cache hit.
[2023-03-13 09:11:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 09:11:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-13 09:11:48] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
[2023-03-13 09:11:48] [INFO ] Invariant cache hit.
[2023-03-13 09:11:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 33/33 places, 46/46 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:11:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-02a-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 640 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 58) seen :55
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 09:11:49] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
[2023-03-13 09:11:49] [INFO ] Invariant cache hit.
[2023-03-13 09:11:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 09:11:49] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-02a-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 31 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 31 transition count 40
Applied a total of 4 rules in 4 ms. Remains 31 /33 variables (removed 2) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 31/33 places, 40/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 31 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 31 transition count 42
Applied a total of 4 rules in 1 ms. Remains 31 /33 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/33 places, 42/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 33 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 31 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 31 transition count 42
Applied a total of 4 rules in 12 ms. Remains 31 /33 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 31/33 places, 42/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 45
Applied a total of 2 rules in 15 ms. Remains 32 /33 variables (removed 1) and now considering 45/46 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 32/33 places, 45/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 31 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 31 transition count 42
Applied a total of 4 rules in 0 ms. Remains 31 /33 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/33 places, 42/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 30 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 30 transition count 39
Applied a total of 6 rules in 1 ms. Remains 30 /33 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/33 places, 39/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 31 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 31 transition count 42
Applied a total of 4 rules in 1 ms. Remains 31 /33 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/33 places, 42/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 31 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 28 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 28 transition count 37
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 14 place count 26 transition count 35
Applied a total of 14 rules in 4 ms. Remains 26 /33 variables (removed 7) and now considering 35/46 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 26/33 places, 35/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 43
Applied a total of 2 rules in 0 ms. Remains 32 /33 variables (removed 1) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/33 places, 43/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 44
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 4 place count 31 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 30 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 30 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 29 transition count 40
Applied a total of 8 rules in 4 ms. Remains 29 /33 variables (removed 4) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 29/33 places, 40/46 transitions.
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:49] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 46/46 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 33 transition count 43
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 30 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 27 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 27 transition count 36
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 16 place count 25 transition count 34
Applied a total of 16 rules in 3 ms. Remains 25 /33 variables (removed 8) and now considering 34/46 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 25/33 places, 34/46 transitions.
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:50] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 30 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 30 transition count 39
Applied a total of 6 rules in 0 ms. Remains 30 /33 variables (removed 3) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/33 places, 39/46 transitions.
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:11:50] [INFO ] Input system was already deterministic with 39 transitions.
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:11:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:11:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 46 transitions and 226 arcs took 0 ms.
Total runtime 2046 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: 33 NrTr: 46 NrArc: 226)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.013sec
RS generation: 0m 0.007sec
-> reachability set: #nodes 448 (4.5e+02) #states 2,314 (3)
starting MCC model checker
--------------------------
checking: AF [AG [EX [EG [[p5<=1 & 1<=p5]]]]]
normalized: ~ [EG [E [true U ~ [EX [EG [[p5<=1 & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
.....
EG iterations: 5
..
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.056sec
checking: EX [AF [[[p19<=0 & 0<=p19] & [p14<=1 & 1<=p14]]]]
normalized: EX [~ [EG [~ [[[p19<=0 & 0<=p19] & [p14<=1 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (0<=p19)
states: 2,314 (3)
abstracting: (p19<=0)
states: 1,876 (3)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [A [AF [~ [[p12<=1 & 1<=p12]]] U E [[p12<=1 & 1<=p12] U [p13<=0 & 0<=p13]]]]
normalized: EG [[~ [EG [~ [E [[p12<=1 & 1<=p12] U [p13<=0 & 0<=p13]]]]] & ~ [E [~ [E [[p12<=1 & 1<=p12] U [p13<=0 & 0<=p13]]] U [EG [[p12<=1 & 1<=p12]] & ~ [E [[p12<=1 & 1<=p12] U [p13<=0 & 0<=p13]]]]]]]]
abstracting: (0<=p13)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
.......
EG iterations: 7
abstracting: (0<=p13)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (0<=p13)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
...
EG iterations: 3
.......
EG iterations: 7
-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: EF [[E [EX [[0<=p3 & p3<=0]] U ~ [[EF [[p21<=1 & 1<=p21]] | ~ [[p23<=0 & 0<=p23]]]]] & EG [AF [[p7<=0 & 0<=p7]]]]]
normalized: E [true U [EG [~ [EG [~ [[p7<=0 & 0<=p7]]]]] & E [EX [[0<=p3 & p3<=0]] U ~ [[~ [[p23<=0 & 0<=p23]] | E [true U [p21<=1 & 1<=p21]]]]]]]
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p23)
states: 2,314 (3)
abstracting: (p23<=0)
states: 2,078 (3)
abstracting: (p3<=0)
states: 1,775 (3)
abstracting: (0<=p3)
states: 2,314 (3)
.abstracting: (0<=p7)
states: 2,314 (3)
abstracting: (p7<=0)
states: 2,024 (3)
........
EG iterations: 8
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: AF [[EG [[p30<=0 & 0<=p30]] & [AG [[[p25<=0 & 0<=p25] & [p32<=1 & 1<=p32]]] | [p20<=0 & 0<=p20]]]]
normalized: ~ [EG [~ [[[[p20<=0 & 0<=p20] | ~ [E [true U ~ [[[p32<=1 & 1<=p32] & [p25<=0 & 0<=p25]]]]]] & EG [[p30<=0 & 0<=p30]]]]]]
abstracting: (0<=p30)
states: 2,314 (3)
abstracting: (p30<=0)
states: 1,876 (3)
.........................
EG iterations: 25
abstracting: (0<=p25)
states: 2,314 (3)
abstracting: (p25<=0)
states: 1,396 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p32<=1)
states: 2,314 (3)
abstracting: (0<=p20)
states: 2,314 (3)
abstracting: (p20<=0)
states: 2,216 (3)
..........................
EG iterations: 26
-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.082sec
checking: [AF [[EF [[p4<=1 & 1<=p4]] | [p8<=1 & 1<=p8]]] & AX [[[p0<=1 & 1<=p0] | E [EG [[[p17<=0 & 0<=p17] | [p15<=1 & 1<=p15]]] U EG [[p26<=0 & 0<=p26]]]]]]
normalized: [~ [EX [~ [[E [EG [[[p15<=1 & 1<=p15] | [p17<=0 & 0<=p17]]] U EG [[p26<=0 & 0<=p26]]] | [p0<=1 & 1<=p0]]]]] & ~ [EG [~ [[[p8<=1 & 1<=p8] | E [true U [p4<=1 & 1<=p4]]]]]]]
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p8<=1)
states: 2,314 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
........
EG iterations: 8
abstracting: (0<=p17)
states: 2,314 (3)
abstracting: (p17<=0)
states: 2,024 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p15<=1)
states: 2,314 (3)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.044sec
checking: AG [E [AX [EF [[[p8<=0 & 0<=p8] | [p18<=1 & 1<=p18]]]] U AF [[[p9<=1 & 1<=p9] & [[p32<=1 & 1<=p32] & ~ [[[p5<=0 & 0<=p5] | [p30<=1 & 1<=p30]]]]]]]]
normalized: ~ [E [true U ~ [E [~ [EX [~ [E [true U [[p18<=1 & 1<=p18] | [p8<=0 & 0<=p8]]]]]] U ~ [EG [~ [[[~ [[[p30<=1 & 1<=p30] | [p5<=0 & 0<=p5]]] & [p32<=1 & 1<=p32]] & [p9<=1 & 1<=p9]]]]]]]]]
abstracting: (1<=p9)
states: 437
abstracting: (p9<=1)
states: 2,314 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p32<=1)
states: 2,314 (3)
abstracting: (0<=p5)
states: 2,314 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (1<=p30)
states: 438
abstracting: (p30<=1)
states: 2,314 (3)
......
EG iterations: 6
abstracting: (0<=p8)
states: 2,314 (3)
abstracting: (p8<=0)
states: 2,036 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
.-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AF [AX [[[p10<=1 & 1<=p10] & [EX [[[p29<=0 & 0<=p29] & [p31<=1 & 1<=p31]]] | [E [[[p14<=0 & 0<=p14] | [p20<=1 & 1<=p20]] U [p10<=1 & 1<=p10]] & AG [[p24<=0 & 0<=p24]]]]]]]
normalized: ~ [EG [EX [~ [[[[~ [E [true U ~ [[p24<=0 & 0<=p24]]]] & E [[[p20<=1 & 1<=p20] | [p14<=0 & 0<=p14]] U [p10<=1 & 1<=p10]]] | EX [[[p31<=1 & 1<=p31] & [p29<=0 & 0<=p29]]]] & [p10<=1 & 1<=p10]]]]]]
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (0<=p29)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
.abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (0<=p14)
states: 2,314 (3)
abstracting: (p14<=0)
states: 2,024 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
abstracting: (0<=p24)
states: 2,314 (3)
abstracting: (p24<=0)
states: 2,078 (3)
........................
EG iterations: 23
-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: EX [E [[p8<=0 & 0<=p8] U [[EF [~ [[[p13<=0 & 0<=p13] | [p23<=1 & 1<=p23]]]] & [p32<=0 & 0<=p32]] & [AF [[[p20<=0 & 0<=p20] | [p6<=1 & 1<=p6]]] & E [~ [[p9<=0 & 0<=p9]] U EG [[[p1<=0 & 0<=p1] | [p11<=1 & 1<=p11]]]]]]]]
normalized: EX [E [[p8<=0 & 0<=p8] U [[E [~ [[p9<=0 & 0<=p9]] U EG [[[p11<=1 & 1<=p11] | [p1<=0 & 0<=p1]]]] & ~ [EG [~ [[[p6<=1 & 1<=p6] | [p20<=0 & 0<=p20]]]]]] & [[p32<=0 & 0<=p32] & E [true U ~ [[[p23<=1 & 1<=p23] | [p13<=0 & 0<=p13]]]]]]]]
abstracting: (0<=p13)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p23)
states: 236
abstracting: (p23<=1)
states: 2,314 (3)
abstracting: (0<=p32)
states: 2,314 (3)
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (0<=p20)
states: 2,314 (3)
abstracting: (p20<=0)
states: 2,216 (3)
abstracting: (1<=p6)
states: 290
abstracting: (p6<=1)
states: 2,314 (3)
.......
EG iterations: 7
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p9)
states: 2,314 (3)
abstracting: (p9<=0)
states: 1,877 (3)
abstracting: (0<=p8)
states: 2,314 (3)
abstracting: (p8<=0)
states: 2,036 (3)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: AG [A [[AF [E [[[p27<=0 & 0<=p27] | [p28<=1 & 1<=p28]] U [p15<=0 & 0<=p15]]] & [~ [EF [[[p16<=0 & 0<=p16] | [p32<=1 & 1<=p32]]]] | [A [[p29<=1 & 1<=p29] U [p32<=0 & 0<=p32]] & EG [[p4<=1 & 1<=p4]]]]] U A [~ [[~ [[[p1<=0 & 0<=p1] | [p14<=1 & 1<=p14]]] | [p29<=0 & 0<=p29]]] U AF [[[[p18<=0 & 0<=p18] | [p21<=1 & 1<=p21]] & [[p26<=0 & 0<=p26] | [p31<=1 & 1<=p31]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [EG [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]] & ~ [E [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]] U [[[p29<=0 & 0<=p29] | ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]] & EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]]]]]]] & ~ [E [~ [[~ [EG [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]] & ~ [E [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]] U [[[p29<=0 & 0<=p29] | ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]] & EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]]]]] U [~ [[[[[~ [EG [~ [[p32<=0 & 0<=p32]]]] & ~ [E [~ [[p32<=0 & 0<=p32]] U [~ [[p29<=1 & 1<=p29]] & ~ [[p32<=0 & 0<=p32]]]]]] & EG [[p4<=1 & 1<=p4]]] | ~ [E [true U [[p32<=1 & 1<=p32] | [p16<=0 & 0<=p16]]]]] & ~ [EG [~ [E [[[p28<=1 & 1<=p28] | [p27<=0 & 0<=p27]] U [p15<=0 & 0<=p15]]]]]]] & ~ [[~ [EG [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]] & ~ [E [EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]] U [[[p29<=0 & 0<=p29] | ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]] & EG [~ [[[[p31<=1 & 1<=p31] | [p26<=0 & 0<=p26]] & [[p21<=1 & 1<=p21] | [p18<=0 & 0<=p18]]]]]]]]]]]]]]]]]
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (0<=p29)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (0<=p15)
states: 2,314 (3)
abstracting: (p15<=0)
states: 2,036 (3)
abstracting: (0<=p27)
states: 2,314 (3)
abstracting: (p27<=0)
states: 1,876 (3)
abstracting: (1<=p28)
states: 1,875 (3)
abstracting: (p28<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p16)
states: 2,314 (3)
abstracting: (p16<=0)
states: 1,877 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p32<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
.........
EG iterations: 9
abstracting: (0<=p32)
states: 2,314 (3)
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (0<=p32)
states: 2,314 (3)
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (0<=p32)
states: 2,314 (3)
abstracting: (p32<=0)
states: 2,047 (3)
...........
EG iterations: 11
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (0<=p29)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p14)
states: 290
abstracting: (p14<=1)
states: 2,314 (3)
abstracting: (0<=p29)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (0<=p26)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: [AG [EF [[p27<=1 & 1<=p27]]] | ~ [E [AF [~ [[p19<=1 & 1<=p19]]] U [~ [[E [[[p18<=0 & 0<=p18] | [p30<=1 & 1<=p30]] U [[p21<=0 & 0<=p21] | [p27<=1 & 1<=p27]]] & EF [[[p29<=0 & 0<=p29] | [p25<=1 & 1<=p25]]]]] & [AG [[[p6<=0 & 0<=p6] | [p17<=1 & 1<=p17]]] & [[AF [[p20<=1 & 1<=p20]] | [[[p26<=1 & 1<=p26] & ~ [[[p13<=0 & 0<=p13] | [p26<=1 & 1<=p26]]]] | [p25<=0 & 0<=p25]]] | [[p31<=1 & 1<=p31] | [[p9<=0 & 0<=p9] | [p3<=1 & 1<=p3]]]]]]]]]
normalized: [~ [E [~ [EG [[p19<=1 & 1<=p19]]] U [[[[[[p3<=1 & 1<=p3] | [p9<=0 & 0<=p9]] | [p31<=1 & 1<=p31]] | [[[p25<=0 & 0<=p25] | [~ [[[p26<=1 & 1<=p26] | [p13<=0 & 0<=p13]]] & [p26<=1 & 1<=p26]]] | ~ [EG [~ [[p20<=1 & 1<=p20]]]]]] & ~ [E [true U ~ [[[p17<=1 & 1<=p17] | [p6<=0 & 0<=p6]]]]]] & ~ [[E [true U [[p25<=1 & 1<=p25] | [p29<=0 & 0<=p29]]] & E [[[p30<=1 & 1<=p30] | [p18<=0 & 0<=p18]] U [[p27<=1 & 1<=p27] | [p21<=0 & 0<=p21]]]]]]]] | ~ [E [true U ~ [E [true U [p27<=1 & 1<=p27]]]]]]
abstracting: (1<=p27)
states: 438
abstracting: (p27<=1)
states: 2,314 (3)
abstracting: (0<=p21)
states: 2,314 (3)
abstracting: (p21<=0)
states: 2,216 (3)
abstracting: (1<=p27)
states: 438
abstracting: (p27<=1)
states: 2,314 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p30)
states: 438
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (0<=p29)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (0<=p6)
states: 2,314 (3)
abstracting: (p6<=0)
states: 2,024 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
.
EG iterations: 1
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (0<=p13)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (0<=p25)
states: 2,314 (3)
abstracting: (p25<=0)
states: 1,396 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p31<=1)
states: 2,314 (3)
abstracting: (0<=p9)
states: 2,314 (3)
abstracting: (p9<=0)
states: 1,877 (3)
abstracting: (1<=p3)
states: 539
abstracting: (p3<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (p19<=1)
states: 2,314 (3)
.......
EG iterations: 7
-> the formula is FALSE
FORMULA AutonomousCar-PT-02a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: [A [AF [[[~ [[p20<=1 & 1<=p20]] | [[p31<=0 & 0<=p31] | [p30<=1 & 1<=p30]]] & [A [[p1<=0 & 0<=p1] U [[p28<=0 & 0<=p28] | [p7<=1 & 1<=p7]]] & EF [[p24<=1 & 1<=p24]]]]] U EG [~ [EG [~ [[[p22<=0 & 0<=p22] | [p20<=1 & 1<=p20]]]]]]] & AF [[[[[[[[p2<=0 & 0<=p2] & [p4<=1 & 1<=p4]] | [p8<=0 & 0<=p8]] & [p32<=1 & 1<=p32]] & [[[p23<=0 & 0<=p23] | [p2<=1 & 1<=p2]] & [[p12<=1 & 1<=p12] & [p18<=0 & 0<=p18]]]] | [AF [[p9<=1 & 1<=p9]] & E [[p5<=1 & 1<=p5] U [[p5<=0 & 0<=p5] | [p10<=1 & 1<=p10]]]]] & [[E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]] | [[p11<=0 & 0<=p11] | [p25<=1 & 1<=p25]]] & AX [EX [0<=0]]]]]]
normalized: [~ [EG [~ [[[~ [EX [~ [EX [0<=0]]]] & [[[p25<=1 & 1<=p25] | [p11<=0 & 0<=p11]] | E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]]]] & [[E [[p5<=1 & 1<=p5] U [[p10<=1 & 1<=p10] | [p5<=0 & 0<=p5]]] & ~ [EG [~ [[p9<=1 & 1<=p9]]]]] | [[[[p18<=0 & 0<=p18] & [p12<=1 & 1<=p12]] & [[p2<=1 & 1<=p2] | [p23<=0 & 0<=p23]]] & [[p32<=1 & 1<=p32] & [[p8<=0 & 0<=p8] | [[p4<=1 & 1<=p4] & [p2<=0 & 0<=p2]]]]]]]]]] & [~ [EG [~ [EG [~ [EG [~ [[[p20<=1 & 1<=p20] | [p22<=0 & 0<=p22]]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[[p20<=1 & 1<=p20] | [p22<=0 & 0<=p22]]]]]]] U [EG [~ [[[E [true U [p24<=1 & 1<=p24]] & [~ [EG [~ [[[p7<=1 & 1<=p7] | [p28<=0 & 0<=p28]]]]] & ~ [E [~ [[[p7<=1 & 1<=p7] | [p28<=0 & 0<=p28]]] U [~ [[p1<=0 & 0<=p1]] & ~ [[[p7<=1 & 1<=p7] | [p28<=0 & 0<=p28]]]]]]]] & [[[p30<=1 & 1<=p30] | [p31<=0 & 0<=p31]] | ~ [[p20<=1 & 1<=p20]]]]]] & ~ [EG [~ [EG [~ [[[p20<=1 & 1<=p20] | [p22<=0 & 0<=p22]]]]]]]]]]]]
abstracting: (0<=p22)
states: 2,314 (3)
abstracting: (p22<=0)
states: 2,216 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
.......
EG iterations: 7
EG iterations: 0
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
abstracting: (0<=p31)
states: 2,314 (3)
abstracting: (p31<=0)
states: 1,144 (3)
abstracting: (1<=p30)
states: 438
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (0<=p28)
states: 2,314 (3)
abstracting: (p28<=0)
states: 439
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (0<=p1)
states: 2,314 (3)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p28)
states: 2,314 (3)
abstracting: (p28<=0)
states: 439
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (0<=p28)
states: 2,314 (3)
abstracting: (p28<=0)
states: 439
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
.......
EG iterations: 7
abstracting: (1<=p24)
states: 236
abstracting: (p24<=1)
states: 2,314 (3)
.....
EG iterations: 5
abstracting: (0<=p22)
states: 2,314 (3)
abstracting: (p22<=0)
states: 2,216 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
.......
EG iterations: 7
EG iterations: 0
abstracting: (0<=p22)
states: 2,314 (3)
abstracting: (p22<=0)
states: 2,216 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p20<=1)
states: 2,314 (3)
.......
EG iterations: 7
EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p2)
states: 2,314 (3)
abstracting: (p2<=0)
states: 1,738 (3)
abstracting: (1<=p4)
states: 605
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (0<=p8)
states: 2,314 (3)
abstracting: (p8<=0)
states: 2,036 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p32<=1)
states: 2,314 (3)
abstracting: (0<=p23)
states: 2,314 (3)
abstracting: (p23<=0)
states: 2,078 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (0<=p18)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p9)
states: 437
abstracting: (p9<=1)
states: 2,314 (3)
........
EG iterations: 8
abstracting: (0<=p5)
states: 2,314 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p5)
states: 593
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (1<=p11)
states: 290
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (0<=p11)
states: 2,314 (3)
abstracting: (p11<=0)
states: 2,024 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p25<=1)
states: 2,314 (3)
abstracting: (0<=0)
states: 2,314 (3)
.......
EG iterations: 5
-> the formula is TRUE
FORMULA AutonomousCar-PT-02a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
totally nodes used: 235170 (2.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 364859 822338 1187197
used/not used/entry size/cache size: 1016995 66091869 16 1024MB
basic ops cache: hits/miss/sum: 99322 184488 283810
used/not used/entry size/cache size: 354532 16422684 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: 2902 6312 9214
used/not used/entry size/cache size: 6310 8382298 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 66879625
1 223656
2 5253
3 313
4 16
5 1
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.173sec
BK_STOP 1678698716509
--------------------
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.003sec
iterations count:1515 (32), effective:167 (3)
initing FirstDep: 0m 0.012sec
iterations count:703 (15), effective:58 (1)
iterations count:77 (1), effective:3 (0)
iterations count:77 (1), effective:3 (0)
iterations count:117 (2), effective:9 (0)
iterations count:77 (1), effective:3 (0)
iterations count:1264 (27), effective:113 (2)
iterations count:795 (17), effective:64 (1)
iterations count:75 (1), effective:6 (0)
iterations count:276 (6), effective:22 (0)
iterations count:896 (19), effective:83 (1)
iterations count:446 (9), effective:46 (1)
iterations count:89 (1), effective:4 (0)
iterations count:362 (7), effective:24 (0)
iterations count:533 (11), effective:38 (0)
iterations count:537 (11), effective:43 (0)
iterations count:924 (20), effective:90 (1)
iterations count:406 (8), effective:37 (0)
iterations count:46 (1), effective:0 (0)
iterations count:389 (8), effective:40 (0)
iterations count:48 (1), effective:1 (0)
iterations count:108 (2), effective:4 (0)
iterations count:375 (8), effective:31 (0)
iterations count:46 (1), effective:0 (0)
iterations count:48 (1), effective:1 (0)
iterations count:161 (3), effective:13 (0)
iterations count:48 (1), effective:1 (0)
iterations count:848 (18), effective:62 (1)
iterations count:1246 (27), effective:109 (2)
iterations count:793 (17), effective:63 (1)
iterations count:46 (1), effective:0 (0)
iterations count:276 (6), effective:22 (0)
iterations count:444 (9), effective:36 (0)
iterations count:1300 (28), effective:109 (2)
iterations count:46 (1), effective:0 (0)
iterations count:924 (20), effective:90 (1)
iterations count:422 (9), effective:29 (0)
iterations count:48 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02a"
export BK_EXAMINATION="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-02a, 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-167813599200545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02a.tgz
mv AutonomousCar-PT-02a execution
cd execution
if [ "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 '
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 ;