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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 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.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 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 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 49K 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-02b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678698847495

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-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:14:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:14:10] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-13 09:14:10] [INFO ] Transformed 155 places.
[2023-03-13 09:14:10] [INFO ] Transformed 194 transitions.
[2023-03-13 09:14:10] [INFO ] Found NUPN structural information;
[2023-03-13 09:14:10] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 12) seen :6
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :2
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 194 rows 155 cols
[2023-03-13 09:14:11] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-13 09:14:11] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:14:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-13 09:14:11] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 8 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 11 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 629 ms
[2023-03-13 09:14:12] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-13 09:14:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-13 09:14:12] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-13 09:14:12] [INFO ] After 1169ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 41 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 194/194 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 155 transition count 164
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 34 rules applied. Total rules applied 64 place count 125 transition count 160
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 76 place count 124 transition count 149
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 87 place count 113 transition count 149
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 87 place count 113 transition count 144
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 97 place count 108 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 102 place count 103 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 103 transition count 139
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 123 place count 103 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 102 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 102 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 145 place count 92 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 90 transition count 120
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 152 place count 90 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 90 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 158 place count 87 transition count 114
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 87 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 87 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 86 transition count 113
Applied a total of 162 rules in 69 ms. Remains 86 /155 variables (removed 69) and now considering 113/194 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 86/155 places, 113/194 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 86 cols
[2023-03-13 09:14:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 09:14:12] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 09:14:13] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:14:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 09:14:13] [INFO ] After 31ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:14:13] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-13 09:14:13] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-13 09:14:13] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-13 09:14:13] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-13 09:14:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 313 ms
[2023-03-13 09:14:13] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 09:14:13] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 113/113 transitions.
Graph (trivial) has 2 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 222 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 10 ms. Remains 84 /86 variables (removed 2) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 84/86 places, 111/113 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 143280 states, properties seen :0
Probabilistic random walk after 757661 steps, saw 143280 distinct states, run finished after 764 ms. (steps per millisecond=991 ) properties seen :0
Explored full state space saw : 143280 states, properties seen :0
Exhaustive walk after 757661 steps, saw 143280 distinct states, run finished after 613 ms. (steps per millisecond=1235 ) properties seen :0
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 4950 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_02b
(NrP: 155 NrTr: 194 NrArc: 620)

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

net check time: 0m 0.012sec

init dd package: 0m 3.294sec


RS generation: 0m 0.296sec


-> reachability set: #nodes 7148 (7.1e+03) #states 4,051,732 (6)



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

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

abstracting: (1<=p5)
states: 969,128 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.347sec

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

abstracting: (1<=p134)
states: 105,768 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.525sec

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

abstracting: (p146<=1)
states: 4,051,732 (6)
-> the formula is TRUE

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

MC time: 0m 0.002sec

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

abstracting: (1<=p26)
states: 139,202 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: EF [~ [p75<=0]]
normalized: E [true U ~ [p75<=0]]

abstracting: (p75<=0)
states: 3,956,098 (6)
-> the formula is TRUE

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

MC time: 0m 0.313sec

checking: EF [~ [p47<=0]]
normalized: E [true U ~ [p47<=0]]

abstracting: (p47<=0)
states: 3,813,980 (6)
-> the formula is TRUE

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

MC time: 0m 0.220sec

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

abstracting: (1<=p109)
states: 192,768 (5)
-> the formula is TRUE

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

MC time: 0m 0.281sec

checking: EF [~ [[p79<=0 | p109<=1]]]
normalized: E [true U ~ [[p79<=0 | p109<=1]]]

abstracting: (p109<=1)
states: 4,051,732 (6)
abstracting: (p79<=0)
states: 3,912,530 (6)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [~ [[p88<=1 | 1<=p59]]]
normalized: E [true U ~ [[p88<=1 | 1<=p59]]]

abstracting: (1<=p59)
states: 113,454 (5)
abstracting: (p88<=1)
states: 4,051,732 (6)
-> the formula is FALSE

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

MC time: 0m 0.005sec

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

abstracting: (p4<=1)
states: 4,051,732 (6)
abstracting: (p88<=p43)
states: 3,789,348 (6)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [[~ [p109<=p36] & [[[p36<=0 | p146<=0] & 1<=p17] | ~ [[~ [[[[1<=p21 & 1<=p95] & [1<=p42 & p66<=1]] & ~ [[p38<=1 & p3<=p106]]]] & ~ [p82<=0]]]]]]
normalized: E [true U [[~ [[~ [p82<=0] & ~ [[~ [[p38<=1 & p3<=p106]] & [[1<=p42 & p66<=1] & [1<=p21 & 1<=p95]]]]]] | [1<=p17 & [p36<=0 | p146<=0]]] & ~ [p109<=p36]]]

abstracting: (p109<=p36)
states: 3,863,290 (6)
abstracting: (p146<=0)
states: 3,945,964 (6)
abstracting: (p36<=0)
states: 3,912,530 (6)
abstracting: (1<=p17)
states: 600
abstracting: (1<=p95)
states: 71,944 (4)
abstracting: (1<=p21)
states: 600
abstracting: (p66<=1)
states: 4,051,732 (6)
abstracting: (1<=p42)
states: 139,202 (5)
abstracting: (p3<=p106)
states: 3,440,348 (6)
abstracting: (p38<=1)
states: 4,051,732 (6)
abstracting: (p82<=0)
states: 3,912,530 (6)
-> the formula is TRUE

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

MC time: 0m 0.042sec

checking: AG [[[[[[p44<=0 | p100<=0] | ~ [p127<=1]] | 1<=p71] & [p135<=1 & [p90<=p122 & [[p18<=p117 | [[p138<=p141 | p152<=p101] | p75<=p93]] | p30<=p17]]]] | ~ [[~ [p146<=0] | [p3<=p135 | [~ [[1<=p93 | [[1<=p5 & 1<=p147] | [p20<=1 | p152<=0]]]] | [~ [1<=p136] | ~ [1<=p11]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[p3<=p135 | [[~ [1<=p11] | ~ [1<=p136]] | ~ [[1<=p93 | [[p20<=1 | p152<=0] | [1<=p5 & 1<=p147]]]]]] | ~ [p146<=0]]] | [[p135<=1 & [p90<=p122 & [p30<=p17 | [p18<=p117 | [p75<=p93 | [p138<=p141 | p152<=p101]]]]]] & [1<=p71 | [~ [p127<=1] | [p44<=0 | p100<=0]]]]]]]]

abstracting: (p100<=0)
states: 3,979,788 (6)
abstracting: (p44<=0)
states: 3,956,098 (6)
abstracting: (p127<=1)
states: 4,051,732 (6)
abstracting: (1<=p71)
states: 113,454 (5)
abstracting: (p152<=p101)
states: 3,932,607 (6)
abstracting: (p138<=p141)
states: 3,945,964 (6)
abstracting: (p75<=p93)
states: 3,956,098 (6)
abstracting: (p18<=p117)
states: 4,051,152 (6)
abstracting: (p30<=p17)
states: 3,912,530 (6)
abstracting: (p90<=p122)
states: 3,979,788 (6)
abstracting: (p135<=1)
states: 4,051,732 (6)
abstracting: (p146<=0)
states: 3,945,964 (6)
abstracting: (1<=p147)
states: 105,768 (5)
abstracting: (1<=p5)
states: 969,128 (5)
abstracting: (p152<=0)
states: 3,932,607 (6)
abstracting: (p20<=1)
states: 4,051,732 (6)
abstracting: (1<=p93)
states: 71,944 (4)
abstracting: (1<=p136)
states: 105,768 (5)
abstracting: (1<=p11)
states: 484,564 (5)
abstracting: (p3<=p135)
states: 3,398,652 (6)
-> the formula is FALSE

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

MC time: 0m 0.333sec

checking: EF [[~ [[[[~ [p24<=p45] & ~ [[[p131<=1 | p138<=1] & [1<=p53 | 1<=p76]]]] & [~ [[p113<=p42 | [1<=p100 | p15<=p39]]] & [[p76<=0 | p29<=1] & ~ [p31<=0]]]] | [[p121<=p30 | ~ [p40<=1]] | [[[~ [p65<=1] & [1<=p76 | p26<=p110]] & p47<=p46] | ~ [1<=p83]]]]] & ~ [[p82<=p5 | [1<=p103 & ~ [[~ [[p122<=0 & ~ [p95<=1]]] & ~ [p19<=p27]]]]]]]]
normalized: E [true U [~ [[p82<=p5 | [1<=p103 & ~ [[~ [p19<=p27] & ~ [[p122<=0 & ~ [p95<=1]]]]]]]] & ~ [[[[~ [1<=p83] | [p47<=p46 & [[1<=p76 | p26<=p110] & ~ [p65<=1]]]] | [p121<=p30 | ~ [p40<=1]]] | [[[~ [p31<=0] & [p76<=0 | p29<=1]] & ~ [[p113<=p42 | [1<=p100 | p15<=p39]]]] & [~ [[[1<=p53 | 1<=p76] & [p131<=1 | p138<=1]]] & ~ [p24<=p45]]]]]]]

abstracting: (p24<=p45)
states: 4,049,332 (6)
abstracting: (p138<=1)
states: 4,051,732 (6)
abstracting: (p131<=1)
states: 4,051,732 (6)
abstracting: (1<=p76)
states: 130,232 (5)
abstracting: (1<=p53)
states: 2,400 (3)
abstracting: (p15<=p39)
states: 4,051,727 (6)
abstracting: (1<=p100)
states: 71,944 (4)
abstracting: (p113<=p42)
states: 3,608,864 (6)
abstracting: (p29<=1)
states: 4,051,732 (6)
abstracting: (p76<=0)
states: 3,921,500 (6)
abstracting: (p31<=0)
states: 3,912,530 (6)
abstracting: (p40<=1)
states: 4,051,732 (6)
abstracting: (p121<=p30)
states: 3,806,336 (6)
abstracting: (p65<=1)
states: 4,051,732 (6)
abstracting: (p26<=p110)
states: 3,916,856 (6)
abstracting: (1<=p76)
states: 130,232 (5)
abstracting: (p47<=p46)
states: 3,813,980 (6)
abstracting: (1<=p83)
states: 240,152 (5)
abstracting: (p95<=1)
states: 4,051,732 (6)
abstracting: (p122<=0)
states: 3,910,708 (6)
abstracting: (p19<=p27)
states: 4,051,132 (6)
abstracting: (1<=p103)
states: 71,944 (4)
abstracting: (p82<=p5)
states: 3,954,666 (6)
-> the formula is FALSE

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

MC time: 0m 0.048sec

checking: EF [[[p83<=0 | ~ [[p56<=1 & [[[[~ [1<=p49] | ~ [p6<=p60]] | ~ [p106<=p6]] & 1<=p30] & p141<=p119]]]] & [~ [[[~ [[~ [1<=p144] & [p100<=p80 & ~ [p42<=0]]]] & [[[p134<=p62 | p74<=p75] | [[1<=p147 & 1<=p11] | [p130<=p13 & 1<=p70]]] & p90<=p146]] | [[[p62<=p119 | [~ [1<=p74] & p95<=1]] & ~ [[1<=p106 & p138<=p16]]] | [~ [[[p89<=p122 | 1<=p117] | [p69<=1 & p150<=1]]] & ~ [p146<=1]]]]] & [~ [[[~ [[[p117<=p98 & 1<=p90] & [1<=p1 & 1<=p110]]] & ~ [[[p15<=p63 & p89<=0] | [p52<=p131 | p90<=p115]]]] & 1<=p10]] & ~ [[[[~ [[1<=p82 & p56<=p109]] & 1<=p47] & p18<=p49] & 1<=p60]]]]]]
normalized: E [true U [[[~ [[1<=p60 & [p18<=p49 & [1<=p47 & ~ [[1<=p82 & p56<=p109]]]]]] & ~ [[1<=p10 & [~ [[[p52<=p131 | p90<=p115] | [p15<=p63 & p89<=0]]] & ~ [[[1<=p1 & 1<=p110] & [p117<=p98 & 1<=p90]]]]]]] & ~ [[[[~ [p146<=1] & ~ [[[p69<=1 & p150<=1] | [p89<=p122 | 1<=p117]]]] | [~ [[1<=p106 & p138<=p16]] & [p62<=p119 | [p95<=1 & ~ [1<=p74]]]]] | [[p90<=p146 & [[[p130<=p13 & 1<=p70] | [1<=p147 & 1<=p11]] | [p134<=p62 | p74<=p75]]] & ~ [[[p100<=p80 & ~ [p42<=0]] & ~ [1<=p144]]]]]]] & [p83<=0 | ~ [[p56<=1 & [p141<=p119 & [1<=p30 & [~ [p106<=p6] | [~ [p6<=p60] | ~ [1<=p49]]]]]]]]]]

abstracting: (1<=p49)
states: 139,202 (5)
abstracting: (p6<=p60)
states: 2,449,659 (6)
abstracting: (p106<=p6)
states: 3,923,220 (6)
abstracting: (1<=p30)
states: 139,202 (5)
abstracting: (p141<=p119)
states: 3,945,964 (6)
abstracting: (p56<=1)
states: 4,051,732 (6)
abstracting: (p83<=0)
states: 3,811,580 (6)
abstracting: (1<=p144)
states: 105,768 (5)
abstracting: (p42<=0)
states: 3,912,530 (6)
abstracting: (p100<=p80)
states: 3,982,916 (6)
abstracting: (p74<=p75)
states: 3,938,278 (6)
abstracting: (p134<=p62)
states: 3,949,330 (6)
abstracting: (1<=p11)
states: 484,564 (5)
abstracting: (1<=p147)
states: 105,768 (5)
abstracting: (1<=p70)
states: 139,202 (5)
abstracting: (p130<=p13)
states: 3,853,583 (6)
abstracting: (p90<=p146)
states: 3,979,788 (6)
abstracting: (1<=p74)
states: 113,454 (5)
abstracting: (p95<=1)
states: 4,051,732 (6)
abstracting: (p62<=p119)
states: 3,913,183 (6)
abstracting: (p138<=p16)
states: 3,945,964 (6)
abstracting: (1<=p106)
states: 192,768 (5)
abstracting: (1<=p117)
states: 23,825 (4)
abstracting: (p89<=p122)
states: 3,979,788 (6)
abstracting: (p150<=1)
states: 4,051,732 (6)
abstracting: (p69<=1)
states: 4,051,732 (6)
abstracting: (p146<=1)
states: 4,051,732 (6)
abstracting: (1<=p90)
states: 71,944 (4)
abstracting: (p117<=p98)
states: 4,027,907 (6)
abstracting: (1<=p110)
states: 192,768 (5)
abstracting: (1<=p1)
states: 17,311 (4)
abstracting: (p89<=0)
states: 3,979,788 (6)
abstracting: (p15<=p63)
states: 4,051,727 (6)
abstracting: (p90<=p115)
states: 3,979,788 (6)
abstracting: (p52<=p131)
states: 3,826,398 (6)
abstracting: (1<=p10)
states: 484,564 (5)
abstracting: (p56<=p109)
states: 3,916,856 (6)
abstracting: (1<=p82)
states: 139,202 (5)
abstracting: (1<=p47)
states: 237,752 (5)
abstracting: (p18<=p49)
states: 4,051,132 (6)
abstracting: (1<=p60)
states: 139,202 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.411sec

checking: EF [[~ [[[~ [[[[~ [1<=p86] | [1<=p75 & 1<=p13]] & 1<=p36] | [~ [[1<=p109 & p58<=p32]] & ~ [[p94<=p5 & 1<=p21]]]]] | [~ [[p120<=0 | ~ [[p80<=0 | p132<=0]]]] | 1<=p77]] | [[p7<=p99 & [[[~ [1<=p102] | ~ [p65<=p91]] | [~ [p34<=0] | [1<=p98 | p46<=0]]] | ~ [[1<=p138 & p72<=p114]]]] & ~ [[[[~ [p133<=0] | [p20<=1 | p24<=p95]] | [[p97<=p152 & p76<=p27] & [p125<=p45 | 1<=p75]]] & ~ [[p42<=1 | p7<=1]]]]]]] & ~ [[[1<=p136 & ~ [[~ [[[p12<=1 | p135<=1] & ~ [p6<=1]]] | 1<=p125]]] | [[[[[[p141<=p91 | p104<=p47] & [p24<=p89 | 1<=p5]] & [~ [p61<=0] & [1<=p44 | p114<=p44]]] | p6<=p55] | [1<=p23 | p21<=p129]] & [[p126<=0 & [[p45<=p149 & p99<=1] & 1<=p9]] & p0<=1]]]]]]
normalized: E [true U [~ [[[[p0<=1 & [p126<=0 & [1<=p9 & [p45<=p149 & p99<=1]]]] & [[1<=p23 | p21<=p129] | [p6<=p55 | [[[1<=p44 | p114<=p44] & ~ [p61<=0]] & [[p24<=p89 | 1<=p5] & [p141<=p91 | p104<=p47]]]]]] | [1<=p136 & ~ [[1<=p125 | ~ [[~ [p6<=1] & [p12<=1 | p135<=1]]]]]]]] & ~ [[[~ [[~ [[p42<=1 | p7<=1]] & [[[p125<=p45 | 1<=p75] & [p97<=p152 & p76<=p27]] | [[p20<=1 | p24<=p95] | ~ [p133<=0]]]]] & [p7<=p99 & [~ [[1<=p138 & p72<=p114]] | [[[1<=p98 | p46<=0] | ~ [p34<=0]] | [~ [p65<=p91] | ~ [1<=p102]]]]]] | [[1<=p77 | ~ [[p120<=0 | ~ [[p80<=0 | p132<=0]]]]] | ~ [[[~ [[p94<=p5 & 1<=p21]] & ~ [[1<=p109 & p58<=p32]]] | [1<=p36 & [[1<=p75 & 1<=p13] | ~ [1<=p86]]]]]]]]]]

abstracting: (1<=p86)
states: 3,450 (3)
abstracting: (1<=p13)
states: 1,037,760 (6)
abstracting: (1<=p75)
states: 95,634 (4)
abstracting: (1<=p36)
states: 139,202 (5)
abstracting: (p58<=p32)
states: 3,943,246 (6)
abstracting: (1<=p109)
states: 192,768 (5)
abstracting: (1<=p21)
states: 600
abstracting: (p94<=p5)
states: 4,015,760 (6)
abstracting: (p132<=0)
states: 3,932,607 (6)
abstracting: (p80<=0)
states: 3,912,530 (6)
abstracting: (p120<=0)
states: 4,027,907 (6)
abstracting: (1<=p77)
states: 237,752 (5)
abstracting: (1<=p102)
states: 71,944 (4)
abstracting: (p65<=p91)
states: 3,915,658 (6)
abstracting: (p34<=0)
states: 3,912,530 (6)
abstracting: (p46<=0)
states: 3,813,980 (6)
abstracting: (1<=p98)
states: 71,944 (4)
abstracting: (p72<=p114)
states: 3,912,530 (6)
abstracting: (1<=p138)
states: 105,768 (5)
abstracting: (p7<=p99)
states: 4,034,421 (6)
abstracting: (p133<=0)
states: 3,945,964 (6)
abstracting: (p24<=p95)
states: 4,049,332 (6)
abstracting: (p20<=1)
states: 4,051,732 (6)
abstracting: (p76<=p27)
states: 3,925,658 (6)
abstracting: (p97<=p152)
states: 3,979,788 (6)
abstracting: (1<=p75)
states: 95,634 (4)
abstracting: (p125<=p45)
states: 3,915,196 (6)
abstracting: (p7<=1)
states: 4,051,732 (6)
abstracting: (p42<=1)
states: 4,051,732 (6)
abstracting: (p135<=1)
states: 4,051,732 (6)
abstracting: (p12<=1)
states: 4,051,732 (6)
abstracting: (p6<=1)
states: 4,051,732 (6)
abstracting: (1<=p125)
states: 141,024 (5)
abstracting: (1<=p136)
states: 105,768 (5)
abstracting: (p104<=p47)
states: 3,874,240 (6)
abstracting: (p141<=p91)
states: 3,945,964 (6)
abstracting: (1<=p5)
states: 969,128 (5)
abstracting: (p24<=p89)
states: 4,049,332 (6)
abstracting: (p61<=0)
states: 3,912,530 (6)
abstracting: (p114<=p44)
states: 4,048,282 (6)
abstracting: (1<=p44)
states: 95,634 (4)
abstracting: (p6<=p55)
states: 2,390,133 (6)
abstracting: (p21<=p129)
states: 4,051,232 (6)
abstracting: (1<=p23)
states: 600
abstracting: (p99<=1)
states: 4,051,732 (6)
abstracting: (p45<=p149)
states: 3,941,830 (6)
abstracting: (1<=p9)
states: 553,808 (5)
abstracting: (p126<=0)
states: 3,910,708 (6)
abstracting: (p0<=1)
states: 4,051,732 (6)
-> the formula is FALSE

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

MC time: 0m 0.105sec

checking: EF [[~ [[[[[1<=p3 & ~ [[p21<=p77 & [p22<=p93 | p30<=p102]]]] | [p10<=p21 & [~ [p132<=p130] | ~ [[p3<=p150 | p151<=p68]]]]] & p23<=0] & ~ [p65<=p134]]] & [1<=p37 & [[p10<=1 & [[[[[1<=p89 | 1<=p69] & ~ [1<=p15]] & ~ [[p38<=1 | p73<=p92]]] & ~ [[[p154<=0 & p29<=p96] | 1<=p64]]] & ~ [[p58<=1 | p16<=1]]]] | [[[[[[p104<=1 & 1<=p144] | [p35<=0 | p118<=1]] | [[1<=p150 & p151<=1] & 1<=p118]] | [p12<=p47 & [~ [1<=p24] & [1<=p73 & p119<=1]]]] & [~ [[p48<=0 | p135<=0]] | [~ [1<=p81] | [[1<=p118 | p120<=p91] & [p97<=p64 | p21<=p50]]]]] & [[[p34<=0 | [[p97<=p89 & p149<=1] | [p113<=p95 | p112<=1]]] & [p58<=p38 | [~ [1<=p42] | [1<=p125 & 1<=p110]]]] & [[[~ [p15<=p53] | p114<=0] | [~ [p58<=p138] & [p116<=p102 & p44<=p6]]] | 1<=p73]]]]]]]
normalized: E [true U [[1<=p37 & [[[[1<=p73 | [[[p116<=p102 & p44<=p6] & ~ [p58<=p138]] | [p114<=0 | ~ [p15<=p53]]]] & [[p58<=p38 | [[1<=p125 & 1<=p110] | ~ [1<=p42]]] & [p34<=0 | [[p113<=p95 | p112<=1] | [p97<=p89 & p149<=1]]]]] & [[[[[p97<=p64 | p21<=p50] & [1<=p118 | p120<=p91]] | ~ [1<=p81]] | ~ [[p48<=0 | p135<=0]]] & [[p12<=p47 & [[1<=p73 & p119<=1] & ~ [1<=p24]]] | [[1<=p118 & [1<=p150 & p151<=1]] | [[p35<=0 | p118<=1] | [p104<=1 & 1<=p144]]]]]] | [p10<=1 & [~ [[p58<=1 | p16<=1]] & [~ [[1<=p64 | [p154<=0 & p29<=p96]]] & [~ [[p38<=1 | p73<=p92]] & [~ [1<=p15] & [1<=p89 | 1<=p69]]]]]]]] & ~ [[~ [p65<=p134] & [p23<=0 & [[p10<=p21 & [~ [[p3<=p150 | p151<=p68]] | ~ [p132<=p130]]] | [1<=p3 & ~ [[p21<=p77 & [p22<=p93 | p30<=p102]]]]]]]]]]

abstracting: (p30<=p102)
states: 3,915,658 (6)
abstracting: (p22<=p93)
states: 4,051,132 (6)
abstracting: (p21<=p77)
states: 4,051,132 (6)
abstracting: (1<=p3)
states: 675,640 (5)
abstracting: (p132<=p130)
states: 3,956,432 (6)
abstracting: (p151<=p68)
states: 4,051,732 (6)
abstracting: (p3<=p150)
states: 3,410,992 (6)
abstracting: (p10<=p21)
states: 3,567,168 (6)
abstracting: (p23<=0)
states: 4,051,132 (6)
abstracting: (p65<=p134)
states: 3,915,896 (6)
abstracting: (1<=p69)
states: 139,202 (5)
abstracting: (1<=p89)
states: 71,944 (4)
abstracting: (1<=p15)
states: 5
abstracting: (p73<=p92)
states: 3,915,658 (6)
abstracting: (p38<=1)
states: 4,051,732 (6)
abstracting: (p29<=p96)
states: 3,915,658 (6)
abstracting: (p154<=0)
states: 3,932,607 (6)
abstracting: (1<=p64)
states: 139,202 (5)
abstracting: (p16<=1)
states: 4,051,732 (6)
abstracting: (p58<=1)
states: 4,051,732 (6)
abstracting: (p10<=1)
states: 4,051,732 (6)
abstracting: (1<=p144)
states: 105,768 (5)
abstracting: (p104<=1)
states: 4,051,732 (6)
abstracting: (p118<=1)
states: 4,051,732 (6)
abstracting: (p35<=0)
states: 3,912,530 (6)
abstracting: (p151<=1)
states: 4,051,732 (6)
abstracting: (1<=p150)
states: 119,125 (5)
abstracting: (1<=p118)
states: 23,825 (4)
abstracting: (1<=p24)
states: 2,400 (3)
abstracting: (p119<=1)
states: 4,051,732 (6)
abstracting: (1<=p73)
states: 139,202 (5)
abstracting: (p12<=p47)
states: 3,588,236 (6)
abstracting: (p135<=0)
states: 3,945,964 (6)
abstracting: (p48<=0)
states: 3,912,530 (6)
abstracting: (1<=p81)
states: 139,202 (5)
abstracting: (p120<=p91)
states: 4,027,907 (6)
abstracting: (1<=p118)
states: 23,825 (4)
abstracting: (p21<=p50)
states: 4,051,132 (6)
abstracting: (p97<=p64)
states: 3,982,916 (6)
abstracting: (p149<=1)
states: 4,051,732 (6)
abstracting: (p97<=p89)
states: 3,979,788 (6)
abstracting: (p112<=1)
states: 4,051,732 (6)
abstracting: (p113<=p95)
states: 3,593,130 (6)
abstracting: (p34<=0)
states: 3,912,530 (6)
abstracting: (1<=p42)
states: 139,202 (5)
abstracting: (1<=p110)
states: 192,768 (5)
abstracting: (1<=p125)
states: 141,024 (5)
abstracting: (p58<=p38)
states: 3,943,246 (6)
abstracting: (p15<=p53)
states: 4,051,727 (6)
abstracting: (p114<=0)
states: 4,048,282 (6)
abstracting: (p58<=p138)
states: 3,942,004 (6)
abstracting: (p44<=p6)
states: 3,987,976 (6)
abstracting: (p116<=p102)
states: 4,027,907 (6)
abstracting: (1<=p73)
states: 139,202 (5)
abstracting: (1<=p37)
states: 139,202 (5)
-> the formula is TRUE

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

MC time: 0m 0.303sec

totally nodes used: 1455497 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3735896 10540607 14276503
used/not used/entry size/cache size: 10661624 56447240 16 1024MB
basic ops cache: hits/miss/sum: 811058 2149876 2960934
used/not used/entry size/cache size: 3260327 13516889 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: 54922 168590 223512
used/not used/entry size/cache size: 167214 8221394 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 65816924
1 1151555
2 119837
3 18144
4 2202
5 185
6 16
7 1
8 0
9 0
>= 10 0

Total processing time: 0m 8.866sec


BK_STOP 1678698864005

--------------------
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


iterations count:18188 (93), effective:1668 (8)

initing FirstDep: 0m 0.000sec


iterations count:10652 (54), effective:538 (2)

iterations count:10557 (54), effective:505 (2)

iterations count:5729 (29), effective:286 (1)

iterations count:11301 (58), effective:626 (3)

iterations count:8340 (42), effective:486 (2)

iterations count:8171 (42), effective:480 (2)

iterations count:8175 (42), effective:482 (2)

iterations count:10607 (54), effective:518 (2)

iterations count:11328 (58), effective:638 (3)

iterations count:5772 (29), effective:299 (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-02b"
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-02b, 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-167813599200558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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