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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 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.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 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 72K 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-04a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-04a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678699297948

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:21:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:21:39] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-13 09:21:39] [INFO ] Transformed 49 places.
[2023-03-13 09:21:39] [INFO ] Transformed 193 transitions.
[2023-03-13 09:21:39] [INFO ] Found NUPN structural information;
[2023-03-13 09:21:39] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 569 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 11) seen :6
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 09:21:40] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-13 09:21:40] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-13 09:21:40] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:21:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-13 09:21:40] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-13 09:21:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-13 09:21:40] [INFO ] After 24ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-13 09:21:41] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 6 ms to minimize.
[2023-03-13 09:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-13 09:21:41] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 09:21:41] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 14 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 118/118 transitions.
Graph (complete) has 285 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 rules applied. Total rules applied 5 place count 48 transition count 113
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 46 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 45 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 11 place count 43 transition count 102
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 43 transition count 102
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 3 with 4 rules applied. Total rules applied 17 place count 41 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 41 transition count 98
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 25 place count 39 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 39 transition count 94
Applied a total of 26 rules in 54 ms. Remains 39 /49 variables (removed 10) and now considering 94/118 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 39/49 places, 94/118 transitions.
Incomplete random walk after 10000 steps, including 531 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 39 cols
[2023-03-13 09:21:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-13 09:21:41] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:21:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 09:21:41] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:21:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 09:21:41] [INFO ] After 14ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:21:41] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 09:21:41] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 94/94 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 39 transition count 93
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 38 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 92
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 8 place count 37 transition count 88
Applied a total of 8 rules in 12 ms. Remains 37 /39 variables (removed 2) and now considering 88/94 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 37/39 places, 88/94 transitions.
Finished random walk after 564 steps, including 22 resets, run visited all 1 properties in 2 ms. (steps per millisecond=282 )
FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1776 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_04a
(NrP: 49 NrTr: 193 NrArc: 1306)

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

net check time: 0m 0.000sec

init dd package: 0m 2.868sec


RS generation: 0m 0.127sec


-> reachability set: #nodes 2756 (2.8e+03) #states 206,492 (5)



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

checking: AG [p31<=1]
normalized: ~ [E [true U ~ [p31<=1]]]

abstracting: (p31<=1)
states: 206,492 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p25<=1]
normalized: ~ [E [true U ~ [p25<=1]]]

abstracting: (p25<=1)
states: 206,492 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p43<=1]
normalized: ~ [E [true U ~ [p43<=1]]]

abstracting: (p43<=1)
states: 206,492 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [p36<=p34]
normalized: ~ [E [true U ~ [p36<=p34]]]

abstracting: (p36<=p34)
states: 202,376 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.170sec

checking: EF [~ [p10<=p14]]
normalized: E [true U ~ [p10<=p14]]

abstracting: (p10<=p14)
states: 179,660 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.182sec

checking: EF [[1<=p24 & [~ [p23<=p29] & p11<=0]]]
normalized: E [true U [1<=p24 & [p11<=0 & ~ [p23<=p29]]]]

abstracting: (p23<=p29)
states: 182,510 (5)
abstracting: (p11<=0)
states: 171,671 (5)
abstracting: (1<=p24)
states: 26,832 (4)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[p22<=p36 & ~ [p22<=p5]]]
normalized: E [true U [p22<=p36 & ~ [p22<=p5]]]

abstracting: (p22<=p5)
states: 183,973 (5)
abstracting: (p22<=p36)
states: 179,674 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

checking: EF [~ [[[p43<=p0 & [p25<=p44 | ~ [[p16<=p0 & [[1<=p35 | p26<=1] | [p26<=p20 | p27<=p40]]]]]] | 1<=p27]]]
normalized: E [true U ~ [[1<=p27 | [p43<=p0 & [p25<=p44 | ~ [[p16<=p0 & [[p26<=p20 | p27<=p40] | [1<=p35 | p26<=1]]]]]]]]]

abstracting: (p26<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p27<=p40)
states: 183,282 (5)
abstracting: (p26<=p20)
states: 182,510 (5)
abstracting: (p16<=p0)
states: 178,988 (5)
abstracting: (p25<=p44)
states: 199,632 (5)
abstracting: (p43<=p0)
states: 165,972 (5)
abstracting: (1<=p27)
states: 27,504 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.215sec

checking: AG [~ [[~ [p15<=p16] & [[[p0<=p42 & ~ [p18<=p11]] & ~ [[1<=p16 | ~ [p35<=p6]]]] & [[~ [p35<=p2] | ~ [[1<=p44 | [~ [1<=p20] & ~ [p27<=0]]]]] | 1<=p6]]]]]
normalized: ~ [E [true U [[[1<=p6 | [~ [[1<=p44 | [~ [p27<=0] & ~ [1<=p20]]]] | ~ [p35<=p2]]] & [~ [[1<=p16 | ~ [p35<=p6]]] & [p0<=p42 & ~ [p18<=p11]]]] & ~ [p15<=p16]]]]

abstracting: (p15<=p16)
states: 178,988 (5)
abstracting: (p18<=p11)
states: 176,666 (5)
abstracting: (p0<=p42)
states: 206,491 (5)
abstracting: (p35<=p6)
states: 178,530 (5)
abstracting: (1<=p16)
states: 27,504 (4)
abstracting: (p35<=p2)
states: 175,660 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p44)
states: 165,971 (5)
abstracting: (1<=p6)
states: 38,645 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[[[~ [p30<=p28] & ~ [p31<=p45]] | [1<=p30 & ~ [[~ [1<=p43] & [[p28<=p14 | ~ [[1<=p13 & 1<=p5]]] | 1<=p34]]]]] & ~ [[p24<=p44 & p34<=p26]]]]
normalized: E [true U [~ [[p24<=p44 & p34<=p26]] & [[1<=p30 & ~ [[[1<=p34 | [p28<=p14 | ~ [[1<=p13 & 1<=p5]]]] & ~ [1<=p43]]]] | [~ [p31<=p45] & ~ [p30<=p28]]]]]

abstracting: (p30<=p28)
states: 183,983 (5)
abstracting: (p31<=p45)
states: 185,020 (5)
abstracting: (1<=p43)
states: 40,520 (4)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p28<=p14)
states: 176,666 (5)
abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p34<=p26)
states: 182,510 (5)
abstracting: (p24<=p44)
states: 201,132 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.123sec

checking: EF [~ [[[[[~ [[~ [[1<=p47 & p23<=0]] | ~ [1<=p20]]] | ~ [p1<=0]] | 1<=p22] | ~ [p12<=p10]] | [[[[[p22<=p19 | p39<=0] & ~ [[~ [p39<=p13] & [p8<=0 & p2<=p18]]]] & [p4<=p9 | [[~ [p12<=p41] & p44<=0] & ~ [[1<=p18 | p9<=0]]]]] & p17<=p31] | ~ [p26<=p7]]]]]
normalized: E [true U ~ [[[[1<=p22 | [~ [[~ [1<=p20] | ~ [[1<=p47 & p23<=0]]]] | ~ [p1<=0]]] | ~ [p12<=p10]] | [~ [p26<=p7] | [p17<=p31 & [[p4<=p9 | [~ [[1<=p18 | p9<=0]] & [p44<=0 & ~ [p12<=p41]]]] & [~ [[[p8<=0 & p2<=p18] & ~ [p39<=p13]]] & [p22<=p19 | p39<=0]]]]]]]]

abstracting: (p39<=0)
states: 171,708 (5)
abstracting: (p22<=p19)
states: 182,510 (5)
abstracting: (p39<=p13)
states: 176,002 (5)
abstracting: (p2<=p18)
states: 182,773 (5)
abstracting: (p8<=0)
states: 178,988 (5)
abstracting: (p12<=p41)
states: 188,808 (5)
abstracting: (p44<=0)
states: 40,521 (4)
abstracting: (p9<=0)
states: 178,988 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p4<=p9)
states: 172,832 (5)
abstracting: (p17<=p31)
states: 183,086 (5)
abstracting: (p26<=p7)
states: 183,775 (5)
abstracting: (p12<=p10)
states: 178,988 (5)
abstracting: (p1<=0)
states: 1
abstracting: (p23<=0)
states: 178,988 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (1<=p22)
states: 27,504 (4)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AG [[[p37<=p3 & [[[~ [[1<=p39 & [~ [p20<=p24] | [p0<=0 | 1<=p10]]]] | ~ [[~ [1<=p39] & p21<=p33]]] | ~ [p45<=0]] | [[p30<=1 | [[[[p30<=0 & p0<=p24] & 1<=p10] & [~ [p24<=p22] & ~ [1<=p40]]] & [~ [p42<=p21] & [[p32<=p25 & 1<=p44] & 1<=p33]]]] & [~ [[~ [p31<=p12] | [[1<=p19 & p9<=p42] & [p30<=0 & 1<=p47]]]] | [~ [p12<=1] & ~ [[~ [1<=p27] | ~ [p41<=0]]]]]]]] | 1<=p4]]
normalized: ~ [E [true U ~ [[1<=p4 | [p37<=p3 & [[[[~ [[~ [p41<=0] | ~ [1<=p27]]] & ~ [p12<=1]] | ~ [[[[p30<=0 & 1<=p47] & [1<=p19 & p9<=p42]] | ~ [p31<=p12]]]] & [p30<=1 | [[[1<=p33 & [p32<=p25 & 1<=p44]] & ~ [p42<=p21]] & [[~ [1<=p40] & ~ [p24<=p22]] & [1<=p10 & [p30<=0 & p0<=p24]]]]]] | [~ [p45<=0] | [~ [[p21<=p33 & ~ [1<=p39]]] | ~ [[1<=p39 & [[p0<=0 | 1<=p10] | ~ [p20<=p24]]]]]]]]]]]]

abstracting: (p20<=p24)
states: 182,414 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p0<=0)
states: 206,491 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p21<=p33)
states: 176,665 (5)
abstracting: (p45<=0)
states: 165,972 (5)
abstracting: (p0<=p24)
states: 206,491 (5)
abstracting: (p30<=0)
states: 178,988 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p24<=p22)
states: 179,660 (5)
abstracting: (1<=p40)
states: 34,784 (4)
abstracting: (p42<=p21)
states: 161,977 (5)
abstracting: (1<=p44)
states: 165,971 (5)
abstracting: (p32<=p25)
states: 176,666 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
abstracting: (p31<=p12)
states: 183,086 (5)
abstracting: (p9<=p42)
states: 186,026 (5)
abstracting: (1<=p19)
states: 27,504 (4)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p30<=0)
states: 178,988 (5)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p41<=0)
states: 137,968 (5)
abstracting: (p37<=p3)
states: 204,091 (5)
abstracting: (1<=p4)
states: 38,645 (4)
-> the formula is FALSE

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

MC time: 0m 0.101sec

checking: AG [[~ [[p30<=p2 | ~ [p36<=1]]] | [[1<=p47 | [[[[[~ [p24<=p42] & ~ [p3<=p32]] & [1<=p20 & ~ [p29<=p28]]] | ~ [[1<=p46 | p19<=0]]] & p24<=1] & [~ [[~ [p40<=0] & [p3<=0 & p6<=1]]] & ~ [[[~ [p4<=0] | p34<=0] & p4<=p33]]]]] | ~ [[~ [[[~ [[p25<=p42 & p8<=p18]] & ~ [p29<=p18]] & [[[p22<=0 & p3<=p22] & [1<=p17 | 1<=p48]] | ~ [p12<=p34]]]] & ~ [[p25<=1 | p21<=1]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[p25<=1 | p21<=1]] & ~ [[[~ [p12<=p34] | [[1<=p17 | 1<=p48] & [p22<=0 & p3<=p22]]] & [~ [p29<=p18] & ~ [[p25<=p42 & p8<=p18]]]]]]] | [1<=p47 | [[~ [[p4<=p33 & [p34<=0 | ~ [p4<=0]]]] & ~ [[[p3<=0 & p6<=1] & ~ [p40<=0]]]] & [p24<=1 & [~ [[1<=p46 | p19<=0]] | [[1<=p20 & ~ [p29<=p28]] & [~ [p3<=p32] & ~ [p24<=p42]]]]]]]] | ~ [[p30<=p2 | ~ [p36<=1]]]]]]]

abstracting: (p36<=1)
states: 206,492 (5)
abstracting: (p30<=p2)
states: 182,977 (5)
abstracting: (p24<=p42)
states: 186,546 (5)
abstracting: (p3<=p32)
states: 183,854 (5)
abstracting: (p29<=p28)
states: 183,983 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p19<=0)
states: 178,988 (5)
abstracting: (1<=p46)
states: 40,520 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (p40<=0)
states: 171,708 (5)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (p3<=0)
states: 180,081 (5)
abstracting: (p4<=0)
states: 167,847 (5)
abstracting: (p34<=0)
states: 178,988 (5)
abstracting: (p4<=p33)
states: 172,832 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p8<=p18)
states: 183,983 (5)
abstracting: (p25<=p42)
states: 181,148 (5)
abstracting: (p29<=p18)
states: 183,983 (5)
abstracting: (p3<=p22)
states: 183,854 (5)
abstracting: (p22<=0)
states: 178,988 (5)
abstracting: (1<=p48)
states: 30,005 (4)
abstracting: (1<=p17)
states: 26,832 (4)
abstracting: (p12<=p34)
states: 182,510 (5)
abstracting: (p21<=1)
states: 206,492 (5)
abstracting: (p25<=1)
states: 206,492 (5)
-> the formula is TRUE

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

MC time: 0m 0.024sec

checking: AG [[[[p8<=p34 & [p2<=p35 | [~ [[~ [[p6<=p3 & p32<=p32]] | [[1<=p16 & p20<=p23] & 1<=p9]]] | ~ [[[p24<=p42 | ~ [1<=p31]] & ~ [[1<=p45 & p36<=1]]]]]]] & [[1<=p7 | ~ [[[[~ [p41<=1] & [1<=p28 | 1<=p10]] | [[p12<=0 | p35<=0] & 1<=p31]] | ~ [[~ [p45<=1] & [1<=p48 & p33<=1]]]]]] | [[[[[p0<=p21 | [p19<=0 & 1<=p46]] | ~ [p43<=p27]] | ~ [[[p37<=p1 & p32<=p45] | [1<=p17 & 1<=p10]]]] | [[p20<=1 & ~ [[p3<=0 | p34<=p12]]] | [[[1<=p0 | p4<=1] & [p42<=1 & 1<=p15]] | [1<=p33 | [1<=p18 | 1<=p11]]]]] & [~ [[p33<=p10 & 1<=p6]] | p18<=0]]]] | [p2<=1 | ~ [p37<=1]]]]
normalized: ~ [E [true U ~ [[[p2<=1 | ~ [p37<=1]] | [[[[p18<=0 | ~ [[p33<=p10 & 1<=p6]]] & [[[[1<=p33 | [1<=p18 | 1<=p11]] | [[p42<=1 & 1<=p15] & [1<=p0 | p4<=1]]] | [p20<=1 & ~ [[p3<=0 | p34<=p12]]]] | [~ [[[1<=p17 & 1<=p10] | [p37<=p1 & p32<=p45]]] | [~ [p43<=p27] | [p0<=p21 | [p19<=0 & 1<=p46]]]]]] | [1<=p7 | ~ [[~ [[[1<=p48 & p33<=1] & ~ [p45<=1]]] | [[1<=p31 & [p12<=0 | p35<=0]] | [[1<=p28 | 1<=p10] & ~ [p41<=1]]]]]]] & [p8<=p34 & [p2<=p35 | [~ [[~ [[1<=p45 & p36<=1]] & [p24<=p42 | ~ [1<=p31]]]] | ~ [[[1<=p9 & [1<=p16 & p20<=p23]] | ~ [[p6<=p3 & p32<=p32]]]]]]]]]]]]

abstracting: (p32<=p32)
states: 206,492 (5)
abstracting: (p6<=p3)
states: 167,847 (5)
abstracting: (p20<=p23)
states: 182,510 (5)
abstracting: (1<=p16)
states: 27,504 (4)
abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p24<=p42)
states: 186,546 (5)
abstracting: (p36<=1)
states: 206,492 (5)
abstracting: (1<=p45)
states: 40,520 (4)
abstracting: (p2<=p35)
states: 182,774 (5)
abstracting: (p8<=p34)
states: 182,510 (5)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (1<=p28)
states: 34,822 (4)
abstracting: (p35<=0)
states: 171,670 (5)
abstracting: (p12<=0)
states: 178,988 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p45<=1)
states: 206,492 (5)
abstracting: (p33<=1)
states: 206,492 (5)
abstracting: (1<=p48)
states: 30,005 (4)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (1<=p46)
states: 40,520 (4)
abstracting: (p19<=0)
states: 178,988 (5)
abstracting: (p0<=p21)
states: 206,491 (5)
abstracting: (p43<=p27)
states: 171,332 (5)
abstracting: (p32<=p45)
states: 178,531 (5)
abstracting: (p37<=p1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (1<=p17)
states: 26,832 (4)
abstracting: (p34<=p12)
states: 182,510 (5)
abstracting: (p3<=0)
states: 180,081 (5)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (p4<=1)
states: 206,492 (5)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p33<=p10)
states: 182,414 (5)
abstracting: (p18<=0)
states: 171,671 (5)
abstracting: (p37<=1)
states: 206,492 (5)
abstracting: (p2<=1)
states: 206,492 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [[[[[[p26<=p11 | p7<=p41] | 1<=p37] | ~ [[[~ [[~ [p23<=0] | [p37<=p18 & 1<=p47]]] & ~ [1<=p20]] | [1<=p11 | [[~ [1<=p31] & [p15<=0 | p48<=p8]] | p26<=0]]]]] & [[[~ [[p37<=p32 & 1<=p34]] | ~ [[[1<=p20 | 1<=p43] & ~ [[1<=p48 & 1<=p9]]]]] | [~ [[[p31<=0 & ~ [p37<=p34]] & [~ [p10<=1] | p36<=p39]]] & [[~ [[1<=p19 & p7<=1]] & ~ [[p36<=0 & p3<=p23]]] & [[1<=p10 & [p9<=0 | p16<=p35]] | [~ [1<=p17] | p9<=1]]]]] & ~ [[[[[[p32<=p36 & p23<=1] | [p9<=0 & p6<=p5]] | [p33<=p46 & p8<=0]] & ~ [p11<=1]] | [[[[p33<=p22 | 1<=p48] & [p18<=0 | 1<=p18]] & [[1<=p4 & 1<=p23] | 1<=p16]] | ~ [1<=p6]]]]]] | p37<=0]]
normalized: ~ [E [true U ~ [[p37<=0 | [[~ [[[~ [1<=p6] | [[1<=p16 | [1<=p4 & 1<=p23]] & [[p18<=0 | 1<=p18] & [p33<=p22 | 1<=p48]]]] | [~ [p11<=1] & [[p33<=p46 & p8<=0] | [[p9<=0 & p6<=p5] | [p32<=p36 & p23<=1]]]]]] & [[[[[p9<=1 | ~ [1<=p17]] | [1<=p10 & [p9<=0 | p16<=p35]]] & [~ [[p36<=0 & p3<=p23]] & ~ [[1<=p19 & p7<=1]]]] & ~ [[[p36<=p39 | ~ [p10<=1]] & [p31<=0 & ~ [p37<=p34]]]]] | [~ [[~ [[1<=p48 & 1<=p9]] & [1<=p20 | 1<=p43]]] | ~ [[p37<=p32 & 1<=p34]]]]] & [~ [[[1<=p11 | [p26<=0 | [[p15<=0 | p48<=p8] & ~ [1<=p31]]]] | [~ [1<=p20] & ~ [[[p37<=p18 & 1<=p47] | ~ [p23<=0]]]]]] | [1<=p37 | [p26<=p11 | p7<=p41]]]]]]]]

abstracting: (p7<=p41)
states: 182,060 (5)
abstracting: (p26<=p11)
states: 183,983 (5)
abstracting: (1<=p37)
states: 4,802 (3)
abstracting: (p23<=0)
states: 178,988 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p37<=p18)
states: 202,376 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p48<=p8)
states: 180,493 (5)
abstracting: (p15<=0)
states: 178,988 (5)
abstracting: (p26<=0)
states: 178,988 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p37<=p32)
states: 202,376 (5)
abstracting: (1<=p43)
states: 40,520 (4)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (1<=p48)
states: 30,005 (4)
abstracting: (p37<=p34)
states: 202,376 (5)
abstracting: (p31<=0)
states: 179,660 (5)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (p36<=p39)
states: 201,690 (5)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p19)
states: 27,504 (4)
abstracting: (p3<=p23)
states: 183,854 (5)
abstracting: (p36<=0)
states: 201,690 (5)
abstracting: (p16<=p35)
states: 183,983 (5)
abstracting: (p9<=0)
states: 178,988 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (1<=p17)
states: 26,832 (4)
abstracting: (p9<=1)
states: 206,492 (5)
abstracting: (p23<=1)
states: 206,492 (5)
abstracting: (p32<=p36)
states: 172,357 (5)
abstracting: (p6<=p5)
states: 167,847 (5)
abstracting: (p9<=0)
states: 178,988 (5)
abstracting: (p8<=0)
states: 178,988 (5)
abstracting: (p33<=p46)
states: 184,348 (5)
abstracting: (p11<=1)
states: 206,492 (5)
abstracting: (1<=p48)
states: 30,005 (4)
abstracting: (p33<=p22)
states: 182,510 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=0)
states: 171,671 (5)
abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (1<=p4)
states: 38,645 (4)
abstracting: (1<=p16)
states: 27,504 (4)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p37<=0)
states: 201,690 (5)
-> the formula is FALSE

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

MC time: 0m 0.065sec

checking: EF [[1<=p6 & [[[[[[[~ [1<=p34] & [p20<=p38 | p47<=0]] | [[1<=p16 & p25<=0] & [p35<=p19 & p17<=0]]] & ~ [1<=p26]] | [[~ [p9<=p45] & ~ [p47<=p28]] | ~ [p8<=p5]]] & ~ [[~ [[~ [p31<=0] & [p41<=p43 | p13<=p40]]] & ~ [[[p33<=p22 & p17<=1] | p47<=0]]]]] | [[~ [p40<=p29] | p5<=p18] & p30<=0]] & [[[[1<=p3 & [[[1<=p20 & p32<=p46] | [p6<=0 | 1<=p8]] & [[1<=p41 & 1<=p6] | p15<=0]]] & [[~ [[1<=p16 & p3<=p5]] & [[p47<=p29 | p15<=p14] | ~ [1<=p38]]] & [[~ [p44<=0] & ~ [1<=p8]] & [1<=p29 & [p10<=0 & 1<=p47]]]]] | [~ [p12<=p22] & [[[[p15<=0 & 1<=p5] & [p29<=p28 | p29<=1]] | ~ [p0<=p14]] & ~ [[[1<=p32 & p44<=0] | [p31<=p2 | 1<=p9]]]]]] | p39<=p8]]]]
normalized: E [true U [1<=p6 & [[p39<=p8 | [[[~ [[[p31<=p2 | 1<=p9] | [1<=p32 & p44<=0]]] & [~ [p0<=p14] | [[p29<=p28 | p29<=1] & [p15<=0 & 1<=p5]]]] & ~ [p12<=p22]] | [[[[1<=p29 & [p10<=0 & 1<=p47]] & [~ [1<=p8] & ~ [p44<=0]]] & [[~ [1<=p38] | [p47<=p29 | p15<=p14]] & ~ [[1<=p16 & p3<=p5]]]] & [1<=p3 & [[p15<=0 | [1<=p41 & 1<=p6]] & [[p6<=0 | 1<=p8] | [1<=p20 & p32<=p46]]]]]]] & [[p30<=0 & [p5<=p18 | ~ [p40<=p29]]] | [~ [[~ [[p47<=0 | [p33<=p22 & p17<=1]]] & ~ [[[p41<=p43 | p13<=p40] & ~ [p31<=0]]]]] & [[~ [p8<=p5] | [~ [p47<=p28] & ~ [p9<=p45]]] | [~ [1<=p26] & [[[p35<=p19 & p17<=0] & [1<=p16 & p25<=0]] | [[p20<=p38 | p47<=0] & ~ [1<=p34]]]]]]]]]]

abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p47<=0)
states: 111,046 (5)
abstracting: (p20<=p38)
states: 179,674 (5)
abstracting: (p25<=0)
states: 171,671 (5)
abstracting: (1<=p16)
states: 27,504 (4)
abstracting: (p17<=0)
states: 179,660 (5)
abstracting: (p35<=p19)
states: 176,665 (5)
abstracting: (1<=p26)
states: 27,504 (4)
abstracting: (p9<=p45)
states: 184,348 (5)
abstracting: (p47<=p28)
states: 126,824 (5)
abstracting: (p8<=p5)
states: 183,973 (5)
abstracting: (p31<=0)
states: 179,660 (5)
abstracting: (p13<=p40)
states: 183,282 (5)
abstracting: (p41<=p43)
states: 152,374 (5)
abstracting: (p17<=1)
states: 206,492 (5)
abstracting: (p33<=p22)
states: 182,510 (5)
abstracting: (p47<=0)
states: 111,046 (5)
abstracting: (p40<=p29)
states: 176,002 (5)
abstracting: (p5<=p18)
states: 174,707 (5)
abstracting: (p30<=0)
states: 178,988 (5)
abstracting: (p32<=p46)
states: 178,531 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p6<=0)
states: 167,847 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p15<=0)
states: 178,988 (5)
abstracting: (1<=p3)
states: 26,411 (4)
abstracting: (p3<=p5)
states: 180,081 (5)
abstracting: (1<=p16)
states: 27,504 (4)
abstracting: (p15<=p14)
states: 183,983 (5)
abstracting: (p47<=p29)
states: 123,824 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p44<=0)
states: 40,521 (4)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p10<=0)
states: 179,660 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p12<=p22)
states: 182,510 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p15<=0)
states: 178,988 (5)
abstracting: (p29<=1)
states: 206,492 (5)
abstracting: (p29<=p28)
states: 183,983 (5)
abstracting: (p0<=p14)
states: 206,491 (5)
abstracting: (p44<=0)
states: 40,521 (4)
abstracting: (1<=p32)
states: 34,821 (4)
abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (p31<=p2)
states: 183,433 (5)
abstracting: (p39<=p8)
states: 176,002 (5)
abstracting: (1<=p6)
states: 38,645 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.179sec

totally nodes used: 537080 (5.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1519368 3044210 4563578
used/not used/entry size/cache size: 3279366 63829498 16 1024MB
basic ops cache: hits/miss/sum: 536365 877386 1413751
used/not used/entry size/cache size: 1491353 15285863 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: 40555 80069 120624
used/not used/entry size/cache size: 79751 8308857 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 66597807
1 487465
2 21362
3 2041
4 178
5 10
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.097sec


BK_STOP 1678699307741

--------------------
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 ReachabilityCardinality -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:29402 (152), effective:1474 (7)

initing FirstDep: 0m 0.000sec


iterations count:14915 (77), effective:737 (3)

iterations count:12519 (64), effective:474 (2)

iterations count:11329 (58), effective:423 (2)

iterations count:14925 (77), effective:737 (3)

iterations count:11242 (58), effective:485 (2)

iterations count:15180 (78), effective:753 (3)

iterations count:15092 (78), effective:752 (3)

iterations count:14889 (77), effective:709 (3)

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-04a"
export BK_EXAMINATION="ReachabilityCardinality"
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-04a, examination is ReachabilityCardinality"
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-167813599300582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04a.tgz
mv AutonomousCar-PT-04a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;