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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 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 11K 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-01a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-01a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678698546794

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:09:09] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-13 09:09:09] [INFO ] Transformed 25 places.
[2023-03-13 09:09:09] [INFO ] Transformed 35 transitions.
[2023-03-13 09:09:09] [INFO ] Found NUPN structural information;
[2023-03-13 09:09:09] [INFO ] Parsed PT model containing 25 places and 35 transitions and 143 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA AutonomousCar-PT-01a-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-13 09:09:09] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 25 cols
[2023-03-13 09:09:09] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-13 09:09:09] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-13 09:09:09] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-13 09:09:09] [INFO ] Invariant cache hit.
[2023-03-13 09:09:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 09:09:09] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-13 09:09:10] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-13 09:09:10] [INFO ] Invariant cache hit.
[2023-03-13 09:09:10] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 25/25 places, 26/26 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-13 09:09:10] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:09:10] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:09:10] [INFO ] Input system was already deterministic with 26 transitions.
Incomplete random walk after 10000 steps, including 879 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 46) seen :44
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:09:10] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-13 09:09:10] [INFO ] Invariant cache hit.
[2023-03-13 09:09:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 09:09:11] [INFO ] After 56ms 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 14 simplifications.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 3 place count 23 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 23
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 19 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 20
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 13 place count 17 transition count 18
Applied a total of 13 rules in 9 ms. Remains 17 /25 variables (removed 8) and now considering 18/26 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 17/25 places, 18/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 24
Applied a total of 2 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 24/26 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 24/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Applied a total of 2 rules in 0 ms. Remains 24 /25 variables (removed 1) and now considering 25/26 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 25/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Applied a total of 2 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 25/26 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 25/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 23
Applied a total of 4 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 23/26 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/25 places, 23/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 26/26 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 25 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 23 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 21 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 21 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 19 transition count 19
Applied a total of 12 rules in 4 ms. Remains 19 /25 variables (removed 6) and now considering 19/26 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 19/25 places, 19/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 26/26 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 25 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 23 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 23 transition count 24
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 6 place count 22 transition count 23
Applied a total of 6 rules in 4 ms. Remains 22 /25 variables (removed 3) and now considering 23/26 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 22/25 places, 23/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 26/26 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 25 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 24 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 23 transition count 24
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 24/26 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 23/25 places, 24/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 25/25 places, 26/26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:09:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:09:11] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-13 09:09:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 26 transitions and 101 arcs took 1 ms.
Total runtime 2096 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 25 NrTr: 26 NrArc: 101)

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

net check time: 0m 0.000sec

init dd package: 0m 2.825sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 198 (2.0e+02) #states 227



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

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

abstracting: (p22<=0)
states: 186
abstracting: (0<=p22)
states: 227
..............
EG iterations: 14
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EX [[p22<=1 & 1<=p22]]
normalized: EX [[p22<=1 & 1<=p22]]

abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [AX [EG [AF [[EX [[p7<=1 & 1<=p7]] | [p16<=1 & 1<=p16]]]]] | AG [[p13<=0 & 0<=p13]]]
normalized: [~ [E [true U ~ [[p13<=0 & 0<=p13]]]] | ~ [EX [~ [EG [~ [EG [~ [[[p16<=1 & 1<=p16] | EX [[p7<=1 & 1<=p7]]]]]]]]]]]

abstracting: (1<=p7)
states: 27
abstracting: (p7<=1)
states: 227
.abstracting: (1<=p16)
states: 10
abstracting: (p16<=1)
states: 227
....
EG iterations: 4
.....
EG iterations: 5
.abstracting: (0<=p13)
states: 227
abstracting: (p13<=0)
states: 213
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: E [EF [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]]]] U A [[p22<=1 & 1<=p22] U [p22<=1 & 1<=p22]]]
normalized: E [E [true U [[[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]] U [~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[p22<=1 & 1<=p22]] & ~ [[p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
..............
EG iterations: 14
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p24)
states: 20
abstracting: (p24<=1)
states: 227
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AF [[[p15<=1 & 1<=p15] & [AF [[p0<=1 & 1<=p0]] | [AF [[p9<=0 & 0<=p9]] | [[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[p0<=1 & 1<=p0]]]] | [[[[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]] | ~ [EG [~ [[p9<=0 & 0<=p9]]]]]] & [p15<=1 & 1<=p15]]]]]

abstracting: (1<=p15)
states: 10
abstracting: (p15<=1)
states: 227
abstracting: (0<=p9)
states: 227
abstracting: (p9<=0)
states: 199
...
EG iterations: 3
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p24)
states: 20
abstracting: (p24<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
.
EG iterations: 1
.....
EG iterations: 5
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [EG [[[p21<=0 & 0<=p21] | EG [~ [E [[p22<=1 & 1<=p22] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p17<=1 & 1<=p17]]]]]]]] | AX [AF [AX [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p7<=0 & 0<=p7] | [p17<=0 & 0<=p17]]]]]]]
normalized: [~ [EX [EG [EX [~ [[[[p17<=0 & 0<=p17] | [p7<=0 & 0<=p7]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]]]] | EG [[EG [~ [E [[p22<=1 & 1<=p22] U [[[p17<=1 & 1<=p17] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | [p21<=0 & 0<=p21]]]]

abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 186
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
...
EG iterations: 3
.
EG iterations: 1
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 200
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
...
EG iterations: 2
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [E [[AG [[[p12<=1 & 1<=p12] & [p20<=1 & 1<=p20]]] | [E [[p22<=1 & 1<=p22] U [[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p17<=1 & 1<=p17] & [p22<=1 & 1<=p22]]]] | [p16<=1 & 1<=p16]]] U EF [[[p13<=1 & 1<=p13] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p9<=1 & 1<=p9] & [p17<=1 & 1<=p17]]]]]]]
normalized: ~ [E [true U ~ [E [[~ [E [true U ~ [[[p20<=1 & 1<=p20] & [p12<=1 & 1<=p12]]]]] | [[p16<=1 & 1<=p16] | E [[p22<=1 & 1<=p22] U [[[p22<=1 & 1<=p22] & [p17<=1 & 1<=p17]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]] U E [true U [[[[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | [p13<=1 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 14
abstracting: (p13<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p16)
states: 10
abstracting: (p16<=1)
states: 227
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 227
abstracting: (1<=p20)
states: 185
abstracting: (p20<=1)
states: 227
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [EG [[AF [[p14<=1 & 1<=p14]] & EX [EF [[p0<=0 & 0<=p0]]]]] & AF [[[AX [[p13<=0 & 0<=p13]] | [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p7<=1 & 1<=p7] & [p17<=1 & 1<=p17]]] | [[p6<=0 & 0<=p6] & [[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p10<=0 & 0<=p10] | [p17<=0 & 0<=p17]]]]]] & [p9<=0 & 0<=p9]]]]
normalized: [~ [EG [~ [[[~ [EX [~ [[p13<=0 & 0<=p13]]]] | [[[[[p17<=0 & 0<=p17] | [p10<=0 & 0<=p10]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]] & [p6<=0 & 0<=p6]] | [[[p17<=1 & 1<=p17] & [p7<=1 & 1<=p7]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] & [p9<=0 & 0<=p9]]]]] & EG [[EX [E [true U [p0<=0 & 0<=p0]]] & ~ [EG [~ [[p14<=1 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
.........
EG iterations: 9
abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
............
EG iterations: 11
abstracting: (0<=p9)
states: 227
abstracting: (p9<=0)
states: 199
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p7)
states: 27
abstracting: (p7<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 199
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (0<=p13)
states: 227
abstracting: (p13<=0)
states: 213
....
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: EX [[AX [[p0<=0 & 0<=p0]] & [AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p5<=1 & 1<=p5] & [p17<=1 & 1<=p17]]]] | A [[[EF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p17<=1 & 1<=p17]]]] & [[p13<=1 & 1<=p13] & [p10<=1 & 1<=p10]]] | AX [[p22<=1 & 1<=p22]]] U [AF [[p14<=1 & 1<=p14]] & ~ [EG [[p22<=1 & 1<=p22]]]]]]]]
normalized: EX [[[[~ [EG [~ [[~ [EG [[p22<=1 & 1<=p22]]] & ~ [EG [~ [[p14<=1 & 1<=p14]]]]]]]] & ~ [E [~ [[~ [EG [[p22<=1 & 1<=p22]]] & ~ [EG [~ [[p14<=1 & 1<=p14]]]]]] U [~ [[[E [true U [[[p17<=1 & 1<=p17] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & [[p10<=1 & 1<=p10] & [p13<=1 & 1<=p13]]] | ~ [EX [~ [[p22<=1 & 1<=p22]]]]]] & ~ [[~ [EG [[p22<=1 & 1<=p22]]] & ~ [EG [~ [[p14<=1 & 1<=p14]]]]]]]]]] | ~ [EX [~ [[[[p17<=1 & 1<=p17] & [p5<=1 & 1<=p5]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] & ~ [EX [~ [[p0<=0 & 0<=p0]]]]]]

abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
.abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (p5<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
.abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
.........
EG iterations: 9
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.............
EG iterations: 13
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.abstracting: (1<=p13)
states: 14
abstracting: (p13<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
.........
EG iterations: 9
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.............
EG iterations: 13
abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
.........
EG iterations: 9
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.............
EG iterations: 13
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EG [EX [[EX [[[p12<=0 & 0<=p12] | [p20<=0 & 0<=p20]]] & [EG [[p6<=0 & 0<=p6]] & [A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p5<=1 & 1<=p5] & [p17<=1 & 1<=p17]]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p9<=1 & 1<=p9] & [p17<=1 & 1<=p17]]]] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p17<=1 & 1<=p17]]]]]]]]
normalized: EG [EX [[[[[[[p17<=1 & 1<=p17] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | [~ [EG [~ [[[[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[[p17<=1 & 1<=p17] & [p5<=1 & 1<=p5]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]] & EG [[p6<=0 & 0<=p6]]] & EX [[[p20<=0 & 0<=p20] | [p12<=0 & 0<=p12]]]]]]

abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 213
abstracting: (0<=p20)
states: 227
abstracting: (p20<=0)
states: 42
.abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 199
.
EG iterations: 1
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (p5<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
....
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EG [[[[[p1<=0 & 0<=p1] | [p4<=0 & 0<=p4]] | [[p17<=0 & 0<=p17] | [p22<=0 & 0<=p22]]] & [AX [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p7<=0 & 0<=p7] | [p17<=0 & 0<=p17]]]] | [[E [[[p19<=1 & 1<=p19] & [p23<=1 & 1<=p23]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p17<=1 & 1<=p17]]]] & [p16<=1 & 1<=p16]] | [EX [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p17<=1 & 1<=p17] & [p22<=1 & 1<=p22]]]] & [p14<=0 & 0<=p14]]]]]]
normalized: EG [[[[[[p14<=0 & 0<=p14] & EX [[[[p22<=1 & 1<=p22] & [p17<=1 & 1<=p17]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]] | [[p16<=1 & 1<=p16] & E [[[p23<=1 & 1<=p23] & [p19<=1 & 1<=p19]] U [[[p17<=1 & 1<=p17] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] | ~ [EX [~ [[[[p17<=0 & 0<=p17] | [p7<=0 & 0<=p7]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]]] & [[[p22<=0 & 0<=p22] | [p17<=0 & 0<=p17]] | [[p4<=0 & 0<=p4] | [p1<=0 & 0<=p1]]]]]

abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p4)
states: 227
abstracting: (p4<=0)
states: 162
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (0<=p22)
states: 227
abstracting: (p22<=0)
states: 186
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 200
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
.abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p19)
states: 41
abstracting: (p19<=1)
states: 227
abstracting: (1<=p23)
states: 124
abstracting: (p23<=1)
states: 227
abstracting: (1<=p16)
states: 10
abstracting: (p16<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
.abstracting: (0<=p14)
states: 227
abstracting: (p14<=0)
states: 213
....
EG iterations: 4
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EG [[[AX [[[EF [[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]] & EG [[p16<=1 & 1<=p16]]] & [[p19<=1 & 1<=p19] & [p23<=1 & 1<=p23]]]] | [EX [[E [[p10<=1 & 1<=p10] U [p14<=1 & 1<=p14]] & E [[p21<=1 & 1<=p21] U [p13<=1 & 1<=p13]]]] & EG [[AX [[p3<=1 & 1<=p3]] | [[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]] | [p14<=1 & 1<=p14]]]]]] | [[EG [[p0<=0 & 0<=p0]] & EG [[p16<=0 & 0<=p16]]] | [AF [[p16<=0 & 0<=p16]] & [[p0<=1 & 1<=p0] | EG [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p9<=0 & 0<=p9] | [p17<=0 & 0<=p17]]]]]]]]]
normalized: EG [[[[[EG [[[[p17<=0 & 0<=p17] | [p9<=0 & 0<=p9]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]] | [p0<=1 & 1<=p0]] & ~ [EG [~ [[p16<=0 & 0<=p16]]]]] | [EG [[p16<=0 & 0<=p16]] & EG [[p0<=0 & 0<=p0]]]] | [[EG [[[[p14<=1 & 1<=p14] | [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]] | ~ [EX [~ [[p3<=1 & 1<=p3]]]]]] & EX [[E [[p21<=1 & 1<=p21] U [p13<=1 & 1<=p13]] & E [[p10<=1 & 1<=p10] U [p14<=1 & 1<=p14]]]]] | ~ [EX [~ [[[[p23<=1 & 1<=p23] & [p19<=1 & 1<=p19]] & [EG [[p16<=1 & 1<=p16]] & E [true U [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 44
abstracting: (p11<=1)
states: 227
abstracting: (1<=p18)
states: 67
abstracting: (p18<=1)
states: 227
abstracting: (1<=p16)
states: 10
abstracting: (p16<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p19)
states: 41
abstracting: (p19<=1)
states: 227
abstracting: (1<=p23)
states: 124
abstracting: (p23<=1)
states: 227
.abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p13)
states: 14
abstracting: (p13<=1)
states: 227
abstracting: (1<=p21)
states: 41
abstracting: (p21<=1)
states: 227
.abstracting: (1<=p3)
states: 77
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p11)
states: 44
abstracting: (p11<=1)
states: 227
abstracting: (1<=p18)
states: 67
abstracting: (p18<=1)
states: 227
abstracting: (1<=p14)
states: 14
abstracting: (p14<=1)
states: 227
.....
EG iterations: 5
abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
.
EG iterations: 1
abstracting: (0<=p16)
states: 227
abstracting: (p16<=0)
states: 217
....
EG iterations: 4
abstracting: (0<=p16)
states: 227
abstracting: (p16<=0)
states: 217
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p9)
states: 227
abstracting: (p9<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EG [[AF [[[[[p10<=0 & 0<=p10] | [[p11<=0 & 0<=p11] | [p18<=0 & 0<=p18]]] & [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p10<=0 & 0<=p10] | [p17<=0 & 0<=p17]]] & [p1<=1 & 1<=p1]]] & [[p4<=1 & 1<=p4] & [[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]]]]] | [AF [[[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p9<=0 & 0<=p9] | [p17<=0 & 0<=p17]]] & [p10<=0 & 0<=p10]]] | AF [[[~ [E [[p7<=1 & 1<=p7] U [p21<=1 & 1<=p21]]] & [[[p15<=1 & 1<=p15] | [p10<=1 & 1<=p10]] & [[p6<=1 & 1<=p6] | [p13<=1 & 1<=p13]]]] | AG [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p10<=0 & 0<=p10] | [p17<=0 & 0<=p17]]]]]]]]]
normalized: EG [[~ [EG [~ [[[[[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]] & [p4<=1 & 1<=p4]] & [[[p1<=1 & 1<=p1] & [[[p17<=0 & 0<=p17] | [p10<=0 & 0<=p10]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]] & [[[p18<=0 & 0<=p18] | [p11<=0 & 0<=p11]] | [p10<=0 & 0<=p10]]]]]]] | [~ [EG [~ [[~ [E [true U ~ [[[[p17<=0 & 0<=p17] | [p10<=0 & 0<=p10]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]] | [[[[p13<=1 & 1<=p13] | [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] | [p15<=1 & 1<=p15]]] & ~ [E [[p7<=1 & 1<=p7] U [p21<=1 & 1<=p21]]]]]]]] | ~ [EG [~ [[[p10<=0 & 0<=p10] & [[[p17<=0 & 0<=p17] | [p9<=0 & 0<=p9]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]]]]]]

abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p9)
states: 227
abstracting: (p9<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
....
EG iterations: 4
abstracting: (1<=p21)
states: 41
abstracting: (p21<=1)
states: 227
abstracting: (1<=p7)
states: 27
abstracting: (p7<=1)
states: 227
abstracting: (1<=p15)
states: 10
abstracting: (p15<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p10<=1)
states: 227
abstracting: (1<=p6)
states: 28
abstracting: (p6<=1)
states: 227
abstracting: (1<=p13)
states: 14
abstracting: (p13<=1)
states: 227
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
.....
EG iterations: 5
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
abstracting: (0<=p11)
states: 227
abstracting: (p11<=0)
states: 183
abstracting: (0<=p18)
states: 227
abstracting: (p18<=0)
states: 160
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p24)
states: 20
abstracting: (p24<=1)
states: 227
......
EG iterations: 6
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AF [[AF [[E [~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p9<=1 & 1<=p9] & [p17<=1 & 1<=p17]]]] U [[p9<=1 & 1<=p9] | [p3<=1 & 1<=p3]]] & [[[[p12<=0 & 0<=p12] | [[p20<=0 & 0<=p20] | [p1<=0 & 0<=p1]]] | [[p2<=0 & 0<=p2] | [[p5<=0 & 0<=p5] | [p17<=0 & 0<=p17]]]] & [[p6<=0 & 0<=p6] | [p22<=0 & 0<=p22]]]]] & [AX [[AX [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p10<=0 & 0<=p10] | [p17<=0 & 0<=p17]]]] & [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p5<=0 & 0<=p5] | [p17<=0 & 0<=p17]]] & [p13<=0 & 0<=p13]]]] & [AF [[[p3<=1 & 1<=p3] | [[p12<=1 & 1<=p12] & [p20<=1 & 1<=p20]]]] | [EX [[[p22<=1 & 1<=p22] & [[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]]] | [[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p17<=1 & 1<=p17] & [p22<=1 & 1<=p22]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[p22<=1 & 1<=p22] & [p17<=1 & 1<=p17]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]] | EX [[[[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]] & [p22<=1 & 1<=p22]]]] | ~ [EG [~ [[[[p20<=1 & 1<=p20] & [p12<=1 & 1<=p12]] | [p3<=1 & 1<=p3]]]]]] & ~ [EX [~ [[[[p13<=0 & 0<=p13] & [[[p17<=0 & 0<=p17] | [p5<=0 & 0<=p5]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]] & ~ [EX [~ [[[[p17<=0 & 0<=p17] | [p10<=0 & 0<=p10]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]]]]]]] & ~ [EG [~ [[[[[p22<=0 & 0<=p22] | [p6<=0 & 0<=p6]] & [[[[p17<=0 & 0<=p17] | [p5<=0 & 0<=p5]] | [p2<=0 & 0<=p2]] | [[[p1<=0 & 0<=p1] | [p20<=0 & 0<=p20]] | [p12<=0 & 0<=p12]]]] & E [~ [[[[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [[p3<=1 & 1<=p3] | [p9<=1 & 1<=p9]]]]]]]]]]]

abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p3)
states: 77
abstracting: (p3<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 213
abstracting: (0<=p20)
states: 227
abstracting: (p20<=0)
states: 42
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p5)
states: 227
abstracting: (p5<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 199
abstracting: (0<=p22)
states: 227
abstracting: (p22<=0)
states: 186
...
EG iterations: 3
abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p10)
states: 227
abstracting: (p10<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
.abstracting: (0<=p1)
states: 227
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 143
abstracting: (0<=p5)
states: 227
abstracting: (p5<=0)
states: 199
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 130
abstracting: (0<=p13)
states: 227
abstracting: (p13<=0)
states: 213
.abstracting: (1<=p3)
states: 77
abstracting: (p3<=1)
states: 227
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 227
abstracting: (1<=p20)
states: 185
abstracting: (p20<=1)
states: 227
.........
EG iterations: 9
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
abstracting: (1<=p11)
states: 44
abstracting: (p11<=1)
states: 227
abstracting: (1<=p18)
states: 67
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p1)
states: 226
abstracting: (p1<=1)
states: 227
abstracting: (1<=p4)
states: 65
abstracting: (p4<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p17<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (p22<=1)
states: 227
...
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.005sec

totally nodes used: 33576 (3.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34148 84047 118195
used/not used/entry size/cache size: 110048 66998816 16 1024MB
basic ops cache: hits/miss/sum: 13286 31687 44973
used/not used/entry size/cache size: 59248 16717968 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: 909 1396 2305
used/not used/entry size/cache size: 1396 8387212 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 67075729
1 32703
2 423
3 9
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.652sec


BK_STOP 1678698556238

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

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


initing FirstDep: 0m 0.000sec


iterations count:274 (10), effective:38 (1)

initing FirstDep: 0m 0.000sec


iterations count:204 (7), effective:27 (1)

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

iterations count:123 (4), effective:12 (0)

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

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

iterations count:212 (8), effective:29 (1)

iterations count:154 (5), effective:20 (0)

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

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

iterations count:158 (6), effective:24 (0)

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

iterations count:110 (4), effective:15 (0)

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

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

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

iterations count:95 (3), effective:14 (0)

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

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

iterations count:62 (2), effective:5 (0)

iterations count:110 (4), effective:15 (0)

iterations count:193 (7), effective:26 (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-01a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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