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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 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 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 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 110K 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-04b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678699367280

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-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:22:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:22:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:22:50] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-13 09:22:50] [INFO ] Transformed 221 places.
[2023-03-13 09:22:50] [INFO ] Transformed 368 transitions.
[2023-03-13 09:22:50] [INFO ] Found NUPN structural information;
[2023-03-13 09:22:50] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 14) seen :8
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :2
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 368 rows 221 cols
[2023-03-13 09:22:51] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-13 09:22:52] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:22:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 47 ms returned sat
[2023-03-13 09:22:52] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-13 09:22:53] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 6 ms to minimize.
[2023-03-13 09:22:53] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-13 09:22:53] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-13 09:22:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 660 ms
[2023-03-13 09:22:53] [INFO ] After 1158ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-13 09:22:53] [INFO ] After 1477ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 23 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 173 edges and 221 vertex of which 4 / 221 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 584 edges and 219 vertex of which 214 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 214 transition count 290
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 91 rules applied. Total rules applied 164 place count 144 transition count 269
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 182 place count 133 transition count 262
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 126 transition count 262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 189 place count 126 transition count 257
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 199 place count 121 transition count 257
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 213 place count 107 transition count 243
Iterating global reduction 4 with 14 rules applied. Total rules applied 227 place count 107 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 227 place count 107 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 106 transition count 242
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 104 transition count 233
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 104 transition count 233
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 277 place count 82 transition count 211
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 280 place count 79 transition count 184
Iterating global reduction 4 with 3 rules applied. Total rules applied 283 place count 79 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 78 transition count 197
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 334 place count 78 transition count 148
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 343 place count 78 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 352 place count 69 transition count 139
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 358 place count 69 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 69 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 360 place count 68 transition count 132
Applied a total of 360 rules in 172 ms. Remains 68 /221 variables (removed 153) and now considering 132/368 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 68/221 places, 132/368 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 157978 steps, run visited all 1 properties in 275 ms. (steps per millisecond=574 )
Probabilistic random walk after 157978 steps, saw 27102 distinct states, run finished after 275 ms. (steps per millisecond=574 ) properties seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 3841 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_04b
(NrP: 221 NrTr: 368 NrArc: 1658)

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

net check time: 0m 0.012sec

init dd package: 0m 2.968sec


RS generation: 0m 5.136sec


-> reachability set: #nodes 39062 (3.9e+04) #states 4,906,165,480 (9)



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

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

abstracting: (1<=p116)
states: 177,825,878 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.692sec

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

abstracting: (p62<=1)
states: 4,906,165,480 (9)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

abstracting: (p177<=1)
states: 4,906,165,480 (9)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [p217<=0]
normalized: ~ [E [true U ~ [p217<=0]]]

abstracting: (p217<=0)
states: 4,906,165,480 (9)
-> the formula is TRUE

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

MC time: 0m 0.017sec

checking: EF [1<=p16]
normalized: E [true U 1<=p16]

abstracting: (1<=p16)
states: 907,386,540 (8)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.808sec

checking: EF [~ [p64<=p73]]
normalized: E [true U ~ [p64<=p73]]

abstracting: (p64<=p73)
states: 4,728,339,602 (9)
-> the formula is TRUE

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

MC time: 0m 2.818sec

checking: AG [p97<=p131]
normalized: ~ [E [true U ~ [p97<=p131]]]

abstracting: (p97<=p131)
states: 4,734,452,898 (9)
-> the formula is FALSE

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

MC time: 0m 2.962sec

checking: AG [[[~ [1<=p31] | 1<=p206] | [~ [[[~ [1<=p192] & ~ [p134<=p177]] | ~ [[[~ [[p181<=0 | p172<=p80]] | [~ [p100<=0] & [p28<=p172 & p81<=p135]]] | [~ [[1<=p71 | p103<=p60]] & 1<=p25]]]]] & [p137<=p93 | 1<=p157]]]]
normalized: ~ [E [true U ~ [[[[p137<=p93 | 1<=p157] & ~ [[~ [[[1<=p25 & ~ [[1<=p71 | p103<=p60]]] | [[[p28<=p172 & p81<=p135] & ~ [p100<=0]] | ~ [[p181<=0 | p172<=p80]]]]] | [~ [p134<=p177] & ~ [1<=p192]]]]] | [1<=p206 | ~ [1<=p31]]]]]]

abstracting: (1<=p31)
states: 119,660,922 (8)
abstracting: (1<=p206)
states: 353,948,064 (8)
abstracting: (1<=p192)
states: 197,191,296 (8)
abstracting: (p134<=p177)
states: 4,741,474,760 (9)
abstracting: (p172<=p80)
states: 4,525,484,104 (9)
abstracting: (p181<=0)
states: 4,906,123,030 (9)
abstracting: (p100<=0)
states: 4,728,339,602 (9)
abstracting: (p81<=p135)
states: 4,659,831,918 (9)
abstracting: (p28<=p172)
states: 4,906,127,080 (9)
abstracting: (p103<=p60)
states: 4,734,452,898 (9)
abstracting: (1<=p71)
states: 177,825,878 (8)
abstracting: (1<=p25)
states: 600
abstracting: (1<=p157)
states: 38,058,376 (7)
abstracting: (p137<=p93)
states: 4,786,504,558 (9)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.538sec

checking: AG [~ [[~ [[[~ [[[[p45<=p158 & p191<=1] | ~ [1<=p110]] | ~ [[p30<=1 & p161<=1]]]] & ~ [p116<=p192]] | [~ [[~ [p108<=p114] & [p179<=0 & p121<=p128]]] | ~ [[[~ [1<=p89] | p150<=1] | [~ [p166<=p215] | [p37<=1 | p148<=0]]]]]]] & p23<=0]]]
normalized: ~ [E [true U [p23<=0 & ~ [[[~ [p116<=p192] & ~ [[~ [[p30<=1 & p161<=1]] | [~ [1<=p110] | [p45<=p158 & p191<=1]]]]] | [~ [[[~ [p166<=p215] | [p37<=1 | p148<=0]] | [p150<=1 | ~ [1<=p89]]]] | ~ [[[p179<=0 & p121<=p128] & ~ [p108<=p114]]]]]]]]]

abstracting: (p108<=p114)
states: 4,728,339,602 (9)
abstracting: (p121<=p128)
states: 4,906,124,080 (9)
abstracting: (p179<=0)
states: 4,374,369,090 (9)
abstracting: (1<=p89)
states: 38,400 (4)
abstracting: (p150<=1)
states: 4,906,165,480 (9)
abstracting: (p148<=0)
states: 4,728,339,602 (9)
abstracting: (p37<=1)
states: 4,906,165,480 (9)
abstracting: (p166<=p215)
states: 4,879,300,744 (9)
abstracting: (p191<=1)
states: 4,906,165,480 (9)
abstracting: (p45<=p158)
states: 4,729,994,314 (9)
abstracting: (1<=p110)
states: 111,036,042 (8)
abstracting: (p161<=1)
states: 4,906,165,480 (9)
abstracting: (p30<=1)
states: 4,906,165,480 (9)
abstracting: (p116<=p192)
states: 4,735,319,714 (9)
abstracting: (p23<=0)
states: 4,906,164,880 (9)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.944sec

checking: EF [[p127<=p38 & ~ [[[[p180<=p118 | p5<=1] | ~ [[[[[p26<=p147 & 1<=p132] | [1<=p25 | 1<=p183]] & ~ [p18<=p79]] | [~ [[p194<=0 & 1<=p75]] | [[p124<=p212 & 1<=p117] & [p110<=p47 | 1<=p36]]]]]] & p145<=0]]]]
normalized: E [true U [p127<=p38 & ~ [[p145<=0 & [~ [[[[[p110<=p47 | 1<=p36] & [p124<=p212 & 1<=p117]] | ~ [[p194<=0 & 1<=p75]]] | [~ [p18<=p79] & [[1<=p25 | 1<=p183] | [p26<=p147 & 1<=p132]]]]] | [p180<=p118 | p5<=1]]]]]]

abstracting: (p5<=1)
states: 4,906,165,480 (9)
abstracting: (p180<=p118)
states: 4,906,133,230 (9)
abstracting: (1<=p132)
states: 177,825,878 (8)
abstracting: (p26<=p147)
states: 4,906,163,080 (9)
abstracting: (1<=p183)
states: 41,358,879 (7)
abstracting: (1<=p25)
states: 600
abstracting: (p18<=p79)
states: 4,906,165,330 (9)
abstracting: (1<=p75)
states: 119,660,922 (8)
abstracting: (p194<=0)
states: 3,865,922,957 (9)
abstracting: (1<=p117)
states: 177,825,878 (8)
abstracting: (p124<=p212)
states: 4,790,446,666 (9)
abstracting: (1<=p36)
states: 177,825,878 (8)
abstracting: (p110<=p47)
states: 4,795,129,438 (9)
abstracting: (p145<=0)
states: 4,728,339,602 (9)
abstracting: (p127<=p38)
states: 4,734,452,898 (9)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.666sec

checking: EF [~ [[p115<=0 | [1<=p103 & [[[[p111<=p60 & ~ [p88<=0]] | [~ [[p47<=0 | p13<=p96]] & p84<=p19]] & [[~ [p58<=p22] | [[1<=p118 | p168<=1] | [1<=p183 & p75<=p52]]] | ~ [p62<=p197]]] & [[~ [1<=p53] & p124<=0] & p105<=p73]]]]]]
normalized: E [true U ~ [[p115<=0 | [1<=p103 & [[p105<=p73 & [p124<=0 & ~ [1<=p53]]] & [[~ [p62<=p197] | [[[1<=p183 & p75<=p52] | [1<=p118 | p168<=1]] | ~ [p58<=p22]]] & [[p84<=p19 & ~ [[p47<=0 | p13<=p96]]] | [p111<=p60 & ~ [p88<=0]]]]]]]]]

abstracting: (p88<=0)
states: 4,906,127,080 (9)
abstracting: (p111<=p60)
states: 4,743,508,878 (9)
abstracting: (p13<=p96)
states: 3,960,207,220 (9)
abstracting: (p47<=0)
states: 4,786,504,558 (9)
abstracting: (p84<=p19)
states: 4,728,339,602 (9)
abstracting: (p58<=p22)
states: 4,906,127,080 (9)
abstracting: (p168<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p118)
states: 256,430,468 (8)
abstracting: (p75<=p52)
states: 4,791,724,252 (9)
abstracting: (1<=p183)
states: 41,358,879 (7)
abstracting: (p62<=p197)
states: 4,792,869,673 (9)
abstracting: (1<=p53)
states: 177,825,878 (8)
abstracting: (p124<=0)
states: 4,786,504,558 (9)
abstracting: (p105<=p73)
states: 4,734,452,898 (9)
abstracting: (1<=p103)
states: 177,825,878 (8)
abstracting: (p115<=0)
states: 4,728,339,602 (9)
-> the formula is TRUE

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

MC time: 0m 2.933sec

checking: AG [[[[~ [[[[~ [[p12<=0 | p0<=p102]] | p23<=1] | 1<=p43] & ~ [[p52<=1 & ~ [p212<=0]]]]] | [p179<=p91 | p3<=0]] | [[1<=p145 & p34<=0] | [~ [[[~ [p209<=p133] & p82<=0] & ~ [[p107<=1 | p52<=1]]]] & [p172<=0 | [[~ [[p59<=p213 & 1<=p197]] | 1<=p163] & p67<=p142]]]]] & [1<=p210 | p32<=p55]]]
normalized: ~ [E [true U ~ [[[1<=p210 | p32<=p55] & [[[[p172<=0 | [p67<=p142 & [1<=p163 | ~ [[p59<=p213 & 1<=p197]]]]] & ~ [[~ [[p107<=1 | p52<=1]] & [p82<=0 & ~ [p209<=p133]]]]] | [1<=p145 & p34<=0]] | [[p179<=p91 | p3<=0] | ~ [[~ [[p52<=1 & ~ [p212<=0]]] & [1<=p43 | [p23<=1 | ~ [[p12<=0 | p0<=p102]]]]]]]]]]]]

abstracting: (p0<=p102)
states: 4,906,165,479 (9)
abstracting: (p12<=0)
states: 4,649,831,124 (9)
abstracting: (p23<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p43)
states: 177,825,878 (8)
abstracting: (p212<=0)
states: 4,758,272,008 (9)
abstracting: (p52<=1)
states: 4,906,165,480 (9)
abstracting: (p3<=0)
states: 3,624,325,580 (9)
abstracting: (p179<=p91)
states: 4,393,539,080 (9)
abstracting: (p34<=0)
states: 4,728,339,602 (9)
abstracting: (1<=p145)
states: 177,825,878 (8)
abstracting: (p209<=p133)
states: 4,763,507,092 (9)
abstracting: (p82<=0)
states: 4,649,775,812 (9)
abstracting: (p52<=1)
states: 4,906,165,480 (9)
abstracting: (p107<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p197)
states: 278,433,691 (8)
abstracting: (p59<=p213)
states: 4,906,127,080 (9)
abstracting: (1<=p163)
states: 38,058,376 (7)
abstracting: (p67<=p142)
states: 4,734,138,108 (9)
abstracting: (p172<=0)
states: 4,513,212,676 (9)
abstracting: (p32<=p55)
states: 4,786,504,558 (9)
abstracting: (1<=p210)
states: 147,893,472 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.734sec

checking: AG [[1<=p175 | ~ [[[p120<=p194 & [~ [[[~ [p70<=1] | [p41<=0 | p199<=p120]] | 1<=p62]] & [~ [p45<=0] | [p125<=p78 & 1<=p10]]]] & [[[1<=p3 | [p147<=1 & p167<=0]] | 1<=p7] & [~ [[[p3<=0 & p186<=0] & [p148<=1 & p115<=p26]]] | [[[[p187<=0 & 1<=p156] | ~ [1<=p102]] & p43<=p2] & p83<=p211]]]]]]]
normalized: ~ [E [true U ~ [[1<=p175 | ~ [[[[[p83<=p211 & [p43<=p2 & [~ [1<=p102] | [p187<=0 & 1<=p156]]]] | ~ [[[p148<=1 & p115<=p26] & [p3<=0 & p186<=0]]]] & [1<=p7 | [1<=p3 | [p147<=1 & p167<=0]]]] & [p120<=p194 & [[[p125<=p78 & 1<=p10] | ~ [p45<=0]] & ~ [[1<=p62 | [[p41<=0 | p199<=p120] | ~ [p70<=1]]]]]]]]]]]]

abstracting: (p70<=1)
states: 4,906,165,480 (9)
abstracting: (p199<=p120)
states: 4,758,272,008 (9)
abstracting: (p41<=0)
states: 4,728,339,602 (9)
abstracting: (1<=p62)
states: 119,660,922 (8)
abstracting: (p45<=0)
states: 4,728,339,602 (9)
abstracting: (1<=p10)
states: 256,334,356 (8)
abstracting: (p125<=p78)
states: 4,786,504,558 (9)
abstracting: (p120<=p194)
states: 4,906,131,480 (9)
abstracting: (p167<=0)
states: 4,868,107,104 (9)
abstracting: (p147<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p3)
states: 1,281,839,900 (9)
abstracting: (1<=p7)
states: 7,061,671 (6)
abstracting: (p186<=0)
states: 4,864,806,601 (9)
abstracting: (p3<=0)
states: 3,624,325,580 (9)
abstracting: (p115<=p26)
states: 4,728,339,602 (9)
abstracting: (p148<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p156)
states: 38,058,376 (7)
abstracting: (p187<=0)
states: 4,627,731,789 (9)
abstracting: (1<=p102)
states: 177,825,878 (8)
abstracting: (p43<=p2)
states: 4,728,659,042 (9)
abstracting: (p83<=p211)
states: 4,733,574,686 (9)
abstracting: (1<=p175)
states: 392,952,804 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.699sec

checking: EF [[[[[[[[~ [p118<=p92] | [[p178<=1 & 1<=p123] | [p211<=p66 & p102<=p80]]] & ~ [1<=p159]] & [[[~ [p156<=1] & p142<=0] | [p27<=p188 | [p24<=1 & 1<=p63]]] | [[1<=p169 | ~ [p115<=1]] & ~ [[p62<=p44 & p19<=p53]]]]] | [~ [p100<=1] & ~ [[[[p64<=1 | p187<=p209] & [p46<=p200 | p150<=p10]] & ~ [[1<=p39 | 1<=p165]]]]]] & p151<=p52] | p13<=1] & 1<=p214]]
normalized: E [true U [1<=p214 & [p13<=1 | [p151<=p52 & [[~ [[~ [[1<=p39 | 1<=p165]] & [[p46<=p200 | p150<=p10] & [p64<=1 | p187<=p209]]]] & ~ [p100<=1]] | [[[~ [[p62<=p44 & p19<=p53]] & [1<=p169 | ~ [p115<=1]]] | [[p27<=p188 | [p24<=1 & 1<=p63]] | [p142<=0 & ~ [p156<=1]]]] & [~ [1<=p159] & [[[p211<=p66 & p102<=p80] | [p178<=1 & 1<=p123]] | ~ [p118<=p92]]]]]]]]]

abstracting: (p118<=p92)
states: 4,649,735,012 (9)
abstracting: (1<=p123)
states: 177,825,878 (8)
abstracting: (p178<=1)
states: 4,906,165,480 (9)
abstracting: (p102<=p80)
states: 4,734,138,108 (9)
abstracting: (p211<=p66)
states: 4,763,507,092 (9)
abstracting: (1<=p159)
states: 38,058,376 (7)
abstracting: (p156<=1)
states: 4,906,165,480 (9)
abstracting: (p142<=0)
states: 4,737,710,372 (9)
abstracting: (1<=p63)
states: 119,660,922 (8)
abstracting: (p24<=1)
states: 4,906,165,480 (9)
abstracting: (p27<=p188)
states: 4,906,155,880 (9)
abstracting: (p115<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p169)
states: 38,058,376 (7)
abstracting: (p19<=p53)
states: 4,906,164,880 (9)
abstracting: (p62<=p44)
states: 4,786,504,558 (9)
abstracting: (p100<=1)
states: 4,906,165,480 (9)
abstracting: (p187<=p209)
states: 4,627,731,789 (9)
abstracting: (p64<=1)
states: 4,906,165,480 (9)
abstracting: (p150<=p10)
states: 4,906,124,080 (9)
abstracting: (p46<=p200)
states: 4,733,574,686 (9)
abstracting: (1<=p165)
states: 38,058,376 (7)
abstracting: (1<=p39)
states: 177,825,878 (8)
abstracting: (p151<=p52)
states: 4,906,124,080 (9)
abstracting: (p13<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p214)
states: 609,300,480 (8)
-> the formula is TRUE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.930sec

checking: AG [[[~ [p180<=0] | [[[[[~ [[p81<=0 | 1<=p71]] | [[p195<=1 | p10<=0] & [p206<=p220 & p202<=p199]]] | [[~ [p5<=p48] & [p61<=0 | p57<=p25]] & ~ [p202<=0]]] & ~ [[p84<=p108 & 1<=p112]]] | ~ [1<=p184]] | [[[p136<=p39 | [[[p215<=0 & p190<=1] & ~ [p57<=p102]] | [p175<=0 & [p0<=p28 | p127<=1]]]] | [[p24<=p213 & [1<=p12 | p200<=0]] | p166<=0]] | [[1<=p63 | [[p191<=1 & ~ [1<=p9]] | [[p132<=p5 & p5<=p183] & [1<=p218 & p31<=p128]]]] & p188<=0]]]] | [[[[[1<=p157 & p42<=p167] | ~ [[[p160<=0 & p202<=1] | [p81<=p137 & p129<=0]]]] | ~ [1<=p189]] | p191<=0] & p216<=p155]]]
normalized: ~ [E [true U ~ [[[p216<=p155 & [p191<=0 | [~ [1<=p189] | [~ [[[p81<=p137 & p129<=0] | [p160<=0 & p202<=1]]] | [1<=p157 & p42<=p167]]]]] | [[[[p188<=0 & [1<=p63 | [[[1<=p218 & p31<=p128] & [p132<=p5 & p5<=p183]] | [p191<=1 & ~ [1<=p9]]]]] | [[p166<=0 | [p24<=p213 & [1<=p12 | p200<=0]]] | [p136<=p39 | [[p175<=0 & [p0<=p28 | p127<=1]] | [~ [p57<=p102] & [p215<=0 & p190<=1]]]]]] | [~ [1<=p184] | [~ [[p84<=p108 & 1<=p112]] & [[~ [p202<=0] & [[p61<=0 | p57<=p25] & ~ [p5<=p48]]] | [[[p206<=p220 & p202<=p199] & [p195<=1 | p10<=0]] | ~ [[p81<=0 | 1<=p71]]]]]]] | ~ [p180<=0]]]]]]

abstracting: (p180<=0)
states: 4,906,123,030 (9)
abstracting: (1<=p71)
states: 177,825,878 (8)
abstracting: (p81<=0)
states: 4,649,775,812 (9)
abstracting: (p10<=0)
states: 4,649,831,124 (9)
abstracting: (p195<=1)
states: 4,906,165,480 (9)
abstracting: (p202<=p199)
states: 4,758,272,008 (9)
abstracting: (p206<=p220)
states: 4,552,217,416 (9)
abstracting: (p5<=p48)
states: 4,393,496,768 (9)
abstracting: (p57<=p25)
states: 4,906,127,080 (9)
abstracting: (p61<=0)
states: 4,728,339,602 (9)
abstracting: (p202<=0)
states: 4,758,272,008 (9)
abstracting: (1<=p112)
states: 256,389,668 (8)
abstracting: (p84<=p108)
states: 4,734,452,898 (9)
abstracting: (1<=p184)
states: 41,358,879 (7)
abstracting: (p190<=1)
states: 4,906,165,480 (9)
abstracting: (p215<=0)
states: 4,480,578,120 (9)
abstracting: (p57<=p102)
states: 4,906,127,080 (9)
abstracting: (p127<=1)
states: 4,906,165,480 (9)
abstracting: (p0<=p28)
states: 4,906,165,479 (9)
abstracting: (p175<=0)
states: 4,513,212,676 (9)
abstracting: (p136<=p39)
states: 4,734,452,898 (9)
abstracting: (p200<=0)
states: 4,758,272,008 (9)
abstracting: (1<=p12)
states: 256,334,356 (8)
abstracting: (p24<=p213)
states: 4,906,164,880 (9)
abstracting: (p166<=0)
states: 4,868,107,104 (9)
abstracting: (1<=p9)
states: 284,581,040 (8)
abstracting: (p191<=1)
states: 4,906,165,480 (9)
abstracting: (p5<=p183)
states: 4,393,496,768 (9)
abstracting: (p132<=p5)
states: 4,750,629,546 (9)
abstracting: (p31<=p128)
states: 4,791,724,252 (9)
abstracting: (1<=p218)
states: 206,794,395 (8)
abstracting: (1<=p63)
states: 119,660,922 (8)
abstracting: (p188<=0)
states: 4,708,974,184 (9)
abstracting: (p42<=p167)
states: 4,729,994,314 (9)
abstracting: (1<=p157)
states: 38,058,376 (7)
abstracting: (p202<=1)
states: 4,906,165,480 (9)
abstracting: (p160<=0)
states: 4,868,107,104 (9)
abstracting: (p129<=0)
states: 4,728,339,602 (9)
abstracting: (p81<=p137)
states: 4,654,995,506 (9)
abstracting: (1<=p189)
states: 797,628,480 (8)
abstracting: (p191<=0)
states: 4,708,974,184 (9)
abstracting: (p216<=p155)
states: 4,699,371,085 (9)
-> the formula is TRUE

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

MC time: 0m 0.962sec

checking: EF [[[[[[[p144<=1 & [~ [[1<=p136 & p94<=1]] & [~ [p174<=0] | p216<=p201]]] | ~ [p200<=p144]] | p2<=p89] | [[~ [p58<=1] & ~ [[[[1<=p16 & p217<=0] | [p127<=p37 | p122<=1]] & ~ [1<=p114]]]] | p45<=p126]] & p209<=0] & ~ [[[p219<=1 | [~ [[~ [[p212<=p34 & p177<=1]] | [p163<=p78 | 1<=p125]]] & [[[1<=p11 & [p34<=1 | 1<=p180]] | [~ [p144<=0] & [1<=p92 | p139<=p180]]] | p181<=p154]]] & [~ [[[[~ [p48<=1] & p64<=0] | [[1<=p85 & p75<=0] & [1<=p163 & p30<=1]]] | ~ [p144<=0]]] | [[[~ [[p33<=1 | 1<=p151]] | ~ [1<=p88]] | 1<=p132] | [[[[p61<=0 & p59<=p145] & p74<=p86] & [[p58<=0 | 1<=p88] & [p134<=p161 | 1<=p133]]] | [~ [[p89<=0 & 1<=p139]] | p168<=p34]]]]]]]]
normalized: E [true U [~ [[[[[[p168<=p34 | ~ [[p89<=0 & 1<=p139]]] | [[[p134<=p161 | 1<=p133] & [p58<=0 | 1<=p88]] & [p74<=p86 & [p61<=0 & p59<=p145]]]] | [1<=p132 | [~ [1<=p88] | ~ [[p33<=1 | 1<=p151]]]]] | ~ [[~ [p144<=0] | [[[1<=p163 & p30<=1] & [1<=p85 & p75<=0]] | [p64<=0 & ~ [p48<=1]]]]]] & [p219<=1 | [[p181<=p154 | [[[1<=p92 | p139<=p180] & ~ [p144<=0]] | [1<=p11 & [p34<=1 | 1<=p180]]]] & ~ [[[p163<=p78 | 1<=p125] | ~ [[p212<=p34 & p177<=1]]]]]]]] & [p209<=0 & [[p45<=p126 | [~ [[~ [1<=p114] & [[p127<=p37 | p122<=1] | [1<=p16 & p217<=0]]]] & ~ [p58<=1]]] | [p2<=p89 | [~ [p200<=p144] | [p144<=1 & [[p216<=p201 | ~ [p174<=0]] & ~ [[1<=p136 & p94<=1]]]]]]]]]]

abstracting: (p94<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p136)
states: 177,825,878 (8)
abstracting: (p174<=0)
states: 4,513,212,676 (9)
abstracting: (p216<=p201)
states: 4,699,371,085 (9)
abstracting: (p144<=1)
states: 4,906,165,480 (9)
abstracting: (p200<=p144)
states: 4,766,099,092 (9)
abstracting: (p2<=p89)
states: 4,899,111,489 (9)
abstracting: (p58<=1)
states: 4,906,165,480 (9)
abstracting: (p217<=0)
states: 4,906,165,480 (9)
abstracting: (1<=p16)
states: 907,386,540 (8)
abstracting: (p122<=1)
states: 4,906,165,480 (9)
abstracting: (p127<=p37)
states: 4,734,452,898 (9)
abstracting: (1<=p114)
states: 177,825,878 (8)
abstracting: (p45<=p126)
states: 4,734,452,898 (9)
abstracting: (p209<=0)
states: 4,758,272,008 (9)
abstracting: (p177<=1)
states: 4,906,165,480 (9)
abstracting: (p212<=p34)
states: 4,763,507,092 (9)
abstracting: (1<=p125)
states: 119,660,922 (8)
abstracting: (p163<=p78)
states: 4,868,107,104 (9)
abstracting: (1<=p180)
states: 42,450 (4)
abstracting: (p34<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p11)
states: 256,334,356 (8)
abstracting: (p144<=0)
states: 4,649,775,812 (9)
abstracting: (p139<=p180)
states: 4,728,339,602 (9)
abstracting: (1<=p92)
states: 177,825,878 (8)
abstracting: (p181<=p154)
states: 4,906,123,030 (9)
abstracting: (p219<=1)
states: 4,906,165,480 (9)
abstracting: (p48<=1)
states: 4,906,165,480 (9)
abstracting: (p64<=0)
states: 4,728,339,602 (9)
abstracting: (p75<=0)
states: 4,786,504,558 (9)
abstracting: (1<=p85)
states: 177,825,878 (8)
abstracting: (p30<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p163)
states: 38,058,376 (7)
abstracting: (p144<=0)
states: 4,649,775,812 (9)
abstracting: (1<=p151)
states: 41,400 (4)
abstracting: (p33<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p88)
states: 38,400 (4)
abstracting: (1<=p132)
states: 177,825,878 (8)
abstracting: (p59<=p145)
states: 4,906,127,080 (9)
abstracting: (p61<=0)
states: 4,728,339,602 (9)
abstracting: (p74<=p86)
states: 4,728,339,602 (9)
abstracting: (1<=p88)
states: 38,400 (4)
abstracting: (p58<=0)
states: 4,906,127,080 (9)
abstracting: (1<=p133)
states: 177,825,878 (8)
abstracting: (p134<=p161)
states: 4,729,994,314 (9)
abstracting: (1<=p139)
states: 177,825,878 (8)
abstracting: (p89<=0)
states: 4,906,127,080 (9)
abstracting: (p168<=p34)
states: 4,869,761,816 (9)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.678sec

totally nodes used: 13193541 (1.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 48368938 121045657 169414595
used/not used/entry size/cache size: 57415516 9693348 16 1024MB
basic ops cache: hits/miss/sum: 7587897 17655766 25243663
used/not used/entry size/cache size: 13920198 2857018 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: 442252 1278406 1720658
used/not used/entry size/cache size: 1188776 7199832 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 56125760
1 9141693
2 1526254
3 268015
4 41123
5 5375
6 585
7 54
8 5
9 0
>= 10 0

Total processing time: 0m49.516sec


BK_STOP 1678699423947

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

41155 39543
iterations count:238444 (647), effective:11611 (31)

initing FirstDep: 0m 0.000sec


iterations count:27451 (74), effective:818 (2)

iterations count:44141 (119), effective:2255 (6)

iterations count:25999 (70), effective:758 (2)

iterations count:27407 (74), effective:785 (2)

iterations count:39627 (107), effective:1547 (4)

iterations count:27569 (74), effective:822 (2)

iterations count:27365 (74), effective:820 (2)

iterations count:27453 (74), effective:819 (2)

iterations count:39637 (107), effective:1584 (4)

iterations count:38808 (105), effective:1685 (4)

iterations count:46030 (125), effective:2158 (5)

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-04b"
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-04b, 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-167813599300590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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