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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 159K 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-05b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678699537233

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-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:25:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:25:40] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-13 09:25:40] [INFO ] Transformed 255 places.
[2023-03-13 09:25:40] [INFO ] Transformed 490 transitions.
[2023-03-13 09:25:40] [INFO ] Found NUPN structural information;
[2023-03-13 09:25:40] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 47 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 12) seen :7
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-13 09:25:41] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-13 09:25:42] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:25:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2023-03-13 09:25:42] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 09:25:43] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 10 ms to minimize.
[2023-03-13 09:25:43] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2023-03-13 09:25:43] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2023-03-13 09:25:44] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2023-03-13 09:25:44] [INFO ] Deduced a trap composed of 47 places in 515 ms of which 1 ms to minimize.
[2023-03-13 09:25:45] [INFO ] Deduced a trap composed of 30 places in 789 ms of which 2 ms to minimize.
[2023-03-13 09:25:45] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2023-03-13 09:25:46] [INFO ] Deduced a trap composed of 43 places in 890 ms of which 28 ms to minimize.
[2023-03-13 09:25:46] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 1 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 14 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4391 ms
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 0 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2023-03-13 09:25:47] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 1 ms to minimize.
[2023-03-13 09:25:48] [INFO ] Deduced a trap composed of 45 places in 548 ms of which 1 ms to minimize.
[2023-03-13 09:25:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1104 ms
[2023-03-13 09:25:48] [INFO ] After 6274ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-13 09:25:48] [INFO ] After 6844ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 154 edges and 255 vertex of which 4 / 255 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 759 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 248 transition count 424
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 190 transition count 415
Reduce places removed 5 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 18 rules applied. Total rules applied 146 place count 185 transition count 402
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 159 place count 172 transition count 402
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 159 place count 172 transition count 389
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 185 place count 159 transition count 389
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 200 place count 144 transition count 374
Iterating global reduction 4 with 15 rules applied. Total rules applied 215 place count 144 transition count 374
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 316 place count 144 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 316 place count 144 transition count 271
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 142 transition count 271
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 322 place count 140 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 140 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 360 place count 122 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 361 place count 121 transition count 237
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 121 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 366 place count 119 transition count 237
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 119 transition count 234
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 119 transition count 228
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 113 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 113 transition count 225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 113 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 112 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 112 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 389 place count 112 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 111 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 110 transition count 218
Applied a total of 391 rules in 259 ms. Remains 110 /255 variables (removed 145) and now considering 218/490 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 110/255 places, 218/490 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 110 cols
[2023-03-13 09:25:49] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-13 09:25:49] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:25:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 09:25:49] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:25:49] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:25:50] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 0 ms to minimize.
[2023-03-13 09:25:50] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 1 ms to minimize.
[2023-03-13 09:25:50] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-13 09:25:50] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-13 09:25:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 777 ms
[2023-03-13 09:25:50] [INFO ] After 866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-13 09:25:50] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 218/218 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 110 transition count 203
Reduce places removed 15 places and 0 transitions.
Ensure Unique test 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 1 with 19 rules applied. Total rules applied 34 place count 95 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 92 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 39 place count 92 transition count 191
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 51 place count 86 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 84 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 84 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 84 transition count 184
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 76 place count 74 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 78 place count 72 transition count 167
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 72 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 72 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 72 transition count 165
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 92 place count 72 transition count 155
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 102 place count 62 transition count 155
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 62 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 105 place count 61 transition count 152
Applied a total of 105 rules in 43 ms. Remains 61 /110 variables (removed 49) and now considering 152/218 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 61/110 places, 152/218 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 72162 steps, run visited all 1 properties in 138 ms. (steps per millisecond=522 )
Probabilistic random walk after 72162 steps, saw 13650 distinct states, run finished after 138 ms. (steps per millisecond=522 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10537 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_05b
(NrP: 255 NrTr: 490 NrArc: 2527)

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

net check time: 0m 0.000sec

init dd package: 0m 2.864sec


RS generation: 0m18.560sec


-> reachability set: #nodes 90912 (9.1e+04) #states 158,000,170,058 (11)



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

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

abstracting: (p12<=1)
states: 158,000,170,058 (11)
-> the formula is TRUE

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

MC time: 0m 0.063sec

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

abstracting: (1<=p81)
states: 3,438,701,370 (9)
-> the formula is FALSE

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

MC time: 0m18.728sec

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

abstracting: (1<=p78)
states: 3,438,701,370 (9)
-> the formula is FALSE

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

MC time: 0m 7.366sec

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

abstracting: (1<=p52)
states: 5,628,049,414 (9)
-> the formula is TRUE

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

MC time: 0m23.050sec

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

abstracting: (p199<=1)
states: 158,000,170,058 (11)
-> the formula is TRUE

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

MC time: 0m 0.073sec

checking: EF [[[1<=p40 & ~ [p236<=1]] & ~ [p148<=1]]]
normalized: E [true U [~ [p148<=1] & [1<=p40 & ~ [p236<=1]]]]

abstracting: (p236<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p40)
states: 5,885,373,244 (9)
abstracting: (p148<=1)
states: 158,000,170,058 (11)
-> the formula is FALSE

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

MC time: 0m 0.114sec

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

abstracting: (1<=p25)
states: 600
abstracting: (p202<=1)
states: 158,000,170,058 (11)
abstracting: (p109<=p79)
states: 154,711,352,438 (11)
-> the formula is FALSE

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

MC time: 0m 0.133sec

checking: AG [[[~ [[1<=p13 & ~ [[[p241<=p247 & p77<=0] & ~ [[p239<=p104 | p72<=p161]]]]]] | ~ [p236<=p91]] | 1<=p107]]
normalized: ~ [E [true U ~ [[1<=p107 | [~ [p236<=p91] | ~ [[1<=p13 & ~ [[~ [[p239<=p104 | p72<=p161]] & [p241<=p247 & p77<=0]]]]]]]]]]

abstracting: (p77<=0)
states: 152,114,796,814 (11)
abstracting: (p241<=p247)
states: 153,103,008,887 (11)
abstracting: (p72<=p161)
states: 152,326,042,152 (11)
abstracting: (p239<=p104)
states: 147,773,854,175 (11)
abstracting: (1<=p13)
states: 27,193,632,780 (10)
abstracting: (p236<=p91)
states: 153,103,008,887 (11)
abstracting: (1<=p107)
states: 5,885,373,244 (9)
-> the formula is FALSE

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

MC time: 0m11.272sec

checking: AG [~ [[1<=p161 | [[p181<=1 | [~ [1<=p23] & [~ [[p147<=p153 | p183<=p72]] | ~ [[p171<=p77 & p166<=1]]]]] & ~ [p86<=p156]]]]]
normalized: ~ [E [true U [1<=p161 | [~ [p86<=p156] & [p181<=1 | [[~ [[p171<=p77 & p166<=1]] | ~ [[p147<=p153 | p183<=p72]]] & ~ [1<=p23]]]]]]]

abstracting: (1<=p23)
states: 600
abstracting: (p183<=p72)
states: 150,461,151,732 (11)
abstracting: (p147<=p153)
states: 150,151,636,804 (11)
abstracting: (p166<=1)
states: 158,000,170,058 (11)
abstracting: (p171<=p77)
states: 154,711,352,438 (11)
abstracting: (p181<=1)
states: 158,000,170,058 (11)
abstracting: (p86<=p156)
states: 152,326,042,152 (11)
abstracting: (1<=p161)
states: 5,885,373,244 (9)
-> the formula is FALSE

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

MC time: 0m20.482sec

checking: AG [[~ [[[[p14<=0 | ~ [[~ [1<=p155] | [p100<=p152 & p224<=1]]]] | ~ [[[[p62<=0 & 1<=p101] & [p132<=1 | p237<=p183]] | 1<=p47]]] & [[1<=p201 & ~ [p184<=p218]] & [[[p187<=p229 | [p144<=p139 | p158<=1]] & ~ [[p145<=p178 | 1<=p30]]] | [~ [p86<=0] | ~ [[p138<=0 & 1<=p206]]]]]]] & [~ [1<=p39] | p233<=0]]]
normalized: ~ [E [true U ~ [[[p233<=0 | ~ [1<=p39]] & ~ [[[[[~ [[p138<=0 & 1<=p206]] | ~ [p86<=0]] | [~ [[p145<=p178 | 1<=p30]] & [p187<=p229 | [p144<=p139 | p158<=1]]]] & [1<=p201 & ~ [p184<=p218]]] & [~ [[1<=p47 | [[p132<=1 | p237<=p183] & [p62<=0 & 1<=p101]]]] | [p14<=0 | ~ [[[p100<=p152 & p224<=1] | ~ [1<=p155]]]]]]]]]]]

abstracting: (1<=p155)
states: 166,200 (5)
abstracting: (p224<=1)
states: 158,000,170,058 (11)
abstracting: (p100<=p152)
states: 152,424,477,942 (11)
abstracting: (p14<=0)
states: 130,806,537,278 (11)
abstracting: (1<=p101)
states: 5,885,373,244 (9)
abstracting: (p62<=0)
states: 158,000,016,458 (11)
abstracting: (p237<=p183)
states: 153,347,638,589 (11)
abstracting: (p132<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p47)
states: 3,438,701,370 (9)
abstracting: (p184<=p218)
states: 158,000,009,398 (11)
abstracting: (1<=p201)
states: 875,342,648 (8)
abstracting: (p158<=1)
states: 158,000,170,058 (11)
abstracting: (p144<=p139)
states: 154,751,216,048 (11)
abstracting: (p187<=p229)
states: 157,330,790,386 (11)
abstracting: (1<=p30)
states: 38,400 (4)
abstracting: (p145<=p178)
states: 152,666,875,212 (11)
abstracting: (p86<=0)
states: 152,114,796,814 (11)
abstracting: (1<=p206)
states: 13,862,393,490 (10)
abstracting: (p138<=0)
states: 152,114,796,814 (11)
abstracting: (1<=p39)
states: 5,885,373,244 (9)
abstracting: (p233<=0)
states: 153,103,008,887 (11)
-> the formula is FALSE

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

MC time: 0m15.071sec

checking: AG [[p168<=p116 | [1<=p180 & [[[~ [[~ [p105<=1] & [1<=p9 & ~ [1<=p108]]]] | [[~ [1<=p228] | ~ [1<=p173]] & ~ [p159<=p218]]] | [~ [[~ [[p18<=p176 & p40<=p208]] | p244<=1]] | ~ [[[[1<=p28 & p235<=1] & ~ [p139<=p117]] & p119<=p142]]]] | [[[p149<=1 | ~ [p23<=0]] | ~ [p29<=p157]] & [1<=p210 | 1<=p99]]]]]]
normalized: ~ [E [true U ~ [[p168<=p116 | [1<=p180 & [[[1<=p210 | 1<=p99] & [~ [p29<=p157] | [p149<=1 | ~ [p23<=0]]]] | [[~ [[p119<=p142 & [~ [p139<=p117] & [1<=p28 & p235<=1]]]] | ~ [[p244<=1 | ~ [[p18<=p176 & p40<=p208]]]]] | [[~ [p159<=p218] & [~ [1<=p173] | ~ [1<=p228]]] | ~ [[[1<=p9 & ~ [1<=p108]] & ~ [p105<=1]]]]]]]]]]]

abstracting: (p105<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p108)
states: 5,885,373,244 (9)
abstracting: (1<=p9)
states: 6,514,661,832 (9)
abstracting: (1<=p228)
states: 33,279,941,439 (10)
abstracting: (1<=p173)
states: 5,885,373,244 (9)
abstracting: (p159<=p218)
states: 154,598,016,428 (11)
abstracting: (p40<=p208)
states: 152,607,987,574 (11)
abstracting: (p18<=p176)
states: 158,000,170,053 (11)
abstracting: (p244<=1)
states: 158,000,170,058 (11)
abstracting: (p235<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p28)
states: 2,400 (3)
abstracting: (p139<=p117)
states: 152,326,042,152 (11)
abstracting: (p119<=p142)
states: 152,326,042,152 (11)
abstracting: (p23<=0)
states: 158,000,169,458 (11)
abstracting: (p149<=1)
states: 158,000,170,058 (11)
abstracting: (p29<=p157)
states: 158,000,160,458 (11)
abstracting: (1<=p99)
states: 5,885,373,244 (9)
abstracting: (1<=p210)
states: 13,862,393,490 (10)
abstracting: (1<=p180)
states: 5,885,373,244 (9)
abstracting: (p168<=p116)
states: 152,424,477,942 (11)
-> the formula is FALSE

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

MC time: 0m11.898sec

checking: AG [~ [[[[[[[[1<=p93 | 1<=p155] | [1<=p145 | 1<=p52]] | [~ [p114<=0] | [1<=p171 & 1<=p181]]] | ~ [p113<=0]] & 1<=p27] | [[~ [1<=p116] | [[p93<=0 | [p133<=p167 & p139<=0]] & p50<=p248]] & [~ [[[1<=p147 | p139<=0] & [p104<=p239 | 1<=p167]]] & 1<=p244]]] & ~ [[[[1<=p67 | ~ [1<=p203]] & [[p175<=p240 & p52<=1] & 1<=p226]] | ~ [[~ [p31<=p117] & ~ [1<=p93]]]]]]]]
normalized: ~ [E [true U [~ [[~ [[~ [1<=p93] & ~ [p31<=p117]]] | [[1<=p226 & [p175<=p240 & p52<=1]] & [1<=p67 | ~ [1<=p203]]]]] & [[[1<=p244 & ~ [[[p104<=p239 | 1<=p167] & [1<=p147 | p139<=0]]]] & [[p50<=p248 & [p93<=0 | [p133<=p167 & p139<=0]]] | ~ [1<=p116]]] | [1<=p27 & [~ [p113<=0] | [[[1<=p171 & 1<=p181] | ~ [p114<=0]] | [[1<=p145 | 1<=p52] | [1<=p93 | 1<=p155]]]]]]]]]

abstracting: (1<=p155)
states: 166,200 (5)
abstracting: (1<=p93)
states: 163,200 (5)
abstracting: (1<=p52)
states: 5,628,049,414 (9)
abstracting: (1<=p145)
states: 5,628,049,414 (9)
abstracting: (p114<=0)
states: 152,372,120,644 (11)
abstracting: (1<=p181)
states: 5,885,373,244 (9)
abstracting: (1<=p171)
states: 3,438,701,370 (9)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (1<=p27)
states: 600
abstracting: (1<=p116)
states: 7,848,533,254 (9)
abstracting: (p139<=0)
states: 152,114,796,814 (11)
abstracting: (p133<=p167)
states: 152,326,042,152 (11)
abstracting: (p93<=0)
states: 158,000,006,858 (11)
abstracting: (p50<=p248)
states: 154,863,696,968 (11)
abstracting: (p139<=0)
states: 152,114,796,814 (11)
abstracting: (1<=p147)
states: 7,848,533,254 (9)
abstracting: (1<=p167)
states: 5,885,373,244 (9)
abstracting: (p104<=p239)
states: 152,521,971,928 (11)
abstracting: (1<=p244)
states: 4,897,161,171 (9)
abstracting: (1<=p203)
states: 875,342,648 (8)
abstracting: (1<=p67)
states: 5,885,373,244 (9)
abstracting: (p52<=1)
states: 158,000,170,058 (11)
abstracting: (p175<=p240)
states: 154,940,108,723 (11)
abstracting: (1<=p226)
states: 6,529,548,228 (9)
abstracting: (p31<=p117)
states: 158,000,016,458 (11)
abstracting: (1<=p93)
states: 163,200 (5)
-> the formula is TRUE

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

MC time: 0m 0.971sec

checking: AG [[[~ [p70<=p57] | [~ [[~ [p96<=1] & ~ [[1<=p96 | [[1<=p210 | p79<=p251] & 1<=p148]]]]] & 1<=p115]] | ~ [[~ [[p195<=0 | 1<=p123]] & [[[~ [[p235<=0 & ~ [p75<=0]]] | ~ [p175<=p17]] & [1<=p219 & [p30<=p140 & [[1<=p224 & p70<=0] & ~ [p35<=0]]]]] & ~ [[[~ [[1<=p209 & p113<=p167]] & [~ [p226<=p205] | [p177<=1 & p85<=p228]]] | [p243<=p104 & ~ [1<=p58]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[[p243<=p104 & ~ [1<=p58]] | [[[p177<=1 & p85<=p228] | ~ [p226<=p205]] & ~ [[1<=p209 & p113<=p167]]]]] & [[1<=p219 & [p30<=p140 & [~ [p35<=0] & [1<=p224 & p70<=0]]]] & [~ [p175<=p17] | ~ [[p235<=0 & ~ [p75<=0]]]]]] & ~ [[p195<=0 | 1<=p123]]]] | [[1<=p115 & ~ [[~ [[1<=p96 | [1<=p148 & [1<=p210 | p79<=p251]]]] & ~ [p96<=1]]]] | ~ [p70<=p57]]]]]]

abstracting: (p70<=p57)
states: 152,326,042,152 (11)
abstracting: (p96<=1)
states: 158,000,170,058 (11)
abstracting: (p79<=p251)
states: 152,114,796,814 (11)
abstracting: (1<=p210)
states: 13,862,393,490 (10)
abstracting: (1<=p148)
states: 5,885,373,244 (9)
abstracting: (1<=p96)
states: 3,438,701,370 (9)
abstracting: (1<=p115)
states: 7,848,533,254 (9)
abstracting: (1<=p123)
states: 163,200 (5)
abstracting: (p195<=0)
states: 157,124,827,410 (11)
abstracting: (p75<=0)
states: 152,114,796,814 (11)
abstracting: (p235<=0)
states: 153,103,008,887 (11)
abstracting: (p175<=p17)
states: 155,219,669,882 (11)
abstracting: (p70<=0)
states: 152,114,796,814 (11)
abstracting: (1<=p224)
states: 6,529,548,228 (9)
abstracting: (p35<=0)
states: 154,561,468,688 (11)
abstracting: (p30<=p140)
states: 158,000,131,658 (11)
abstracting: (1<=p219)
states: 1,426,223,005 (9)
abstracting: (p113<=p167)
states: 154,892,474,918 (11)
abstracting: (1<=p209)
states: 13,862,393,490 (10)
abstracting: (p226<=p205)
states: 152,084,563,910 (11)
abstracting: (p85<=p228)
states: 151,800,507,127 (11)
abstracting: (p177<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p58)
states: 5,885,373,244 (9)
abstracting: (p243<=p104)
states: 153,282,838,589 (11)
-> the formula is TRUE

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

MC time: 0m 1.237sec

checking: EF [~ [[~ [[[[~ [p49<=0] | p39<=0] & [[1<=p200 | [p88<=p172 & p48<=0]] & ~ [p154<=p1]]] & ~ [p231<=p58]]] | [p72<=1 | [[[[[[1<=p183 | 1<=p21] & [1<=p18 | 1<=p9]] & p139<=0] & [~ [p35<=0] | [[p192<=p16 & p120<=p244] | p177<=1]]] & [[1<=p174 | ~ [1<=p174]] | p88<=p215]] & [[[p86<=1 | p137<=0] | [1<=p79 & p232<=p160]] & ~ [[~ [p171<=1] & [~ [p115<=1] & [1<=p157 & 1<=p235]]]]]]]]]]
normalized: E [true U ~ [[[p72<=1 | [[~ [[[[1<=p157 & 1<=p235] & ~ [p115<=1]] & ~ [p171<=1]]] & [[1<=p79 & p232<=p160] | [p86<=1 | p137<=0]]] & [[p88<=p215 | [1<=p174 | ~ [1<=p174]]] & [[[p177<=1 | [p192<=p16 & p120<=p244]] | ~ [p35<=0]] & [p139<=0 & [[1<=p18 | 1<=p9] & [1<=p183 | 1<=p21]]]]]]] | ~ [[~ [p231<=p58] & [[~ [p154<=p1] & [1<=p200 | [p88<=p172 & p48<=0]]] & [p39<=0 | ~ [p49<=0]]]]]]]]

abstracting: (p49<=0)
states: 152,114,796,814 (11)
abstracting: (p39<=0)
states: 152,114,796,814 (11)
abstracting: (p48<=0)
states: 152,114,796,814 (11)
abstracting: (p88<=p172)
states: 152,326,042,152 (11)
abstracting: (1<=p200)
states: 875,342,648 (8)
abstracting: (p154<=p1)
states: 158,000,037,578 (11)
abstracting: (p231<=p58)
states: 149,552,983,641 (11)
abstracting: (1<=p21)
states: 600
abstracting: (1<=p183)
states: 7,848,699,454 (9)
abstracting: (1<=p9)
states: 6,514,661,832 (9)
abstracting: (1<=p18)
states: 5
abstracting: (p139<=0)
states: 152,114,796,814 (11)
abstracting: (p35<=0)
states: 154,561,468,688 (11)
abstracting: (p120<=p244)
states: 152,294,626,516 (11)
abstracting: (p192<=p16)
states: 157,124,827,410 (11)
abstracting: (p177<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p174)
states: 3,438,701,370 (9)
abstracting: (1<=p174)
states: 3,438,701,370 (9)
abstracting: (p88<=p215)
states: 152,114,796,814 (11)
abstracting: (p137<=0)
states: 152,114,796,814 (11)
abstracting: (p86<=1)
states: 158,000,170,058 (11)
abstracting: (p232<=p160)
states: 151,129,048,153 (11)
abstracting: (1<=p79)
states: 5,885,373,244 (9)
abstracting: (p171<=1)
states: 158,000,170,058 (11)
abstracting: (p115<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p235)
states: 4,897,161,171 (9)
abstracting: (1<=p157)
states: 5,885,373,244 (9)
abstracting: (p72<=1)
states: 158,000,170,058 (11)
-> the formula is FALSE

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

MC time: 0m 1.047sec

checking: AG [[~ [[~ [[[[[~ [p214<=0] | ~ [p103<=p123]] & p113<=0] | [[p183<=1 | [1<=p178 & p73<=p207]] & p103<=0]] & [1<=p94 | [~ [[p47<=p114 & p144<=p214]] & p159<=p170]]]] & ~ [[1<=p82 | ~ [[1<=p177 & 1<=p121]]]]]] & [~ [[[[1<=p12 | 1<=p232] & [[~ [[p14<=1 & p202<=p156]] | [~ [p135<=1] & [p90<=p85 & 1<=p92]]] | [[~ [p126<=p221] | [p163<=p222 | 1<=p230]] & p250<=1]]] | ~ [p20<=p15]]] | p48<=p125]]]
normalized: ~ [E [true U ~ [[[p48<=p125 | ~ [[~ [p20<=p15] | [[[p250<=1 & [[p163<=p222 | 1<=p230] | ~ [p126<=p221]]] | [[[p90<=p85 & 1<=p92] & ~ [p135<=1]] | ~ [[p14<=1 & p202<=p156]]]] & [1<=p12 | 1<=p232]]]]] & ~ [[~ [[1<=p82 | ~ [[1<=p177 & 1<=p121]]]] & ~ [[[1<=p94 | [p159<=p170 & ~ [[p47<=p114 & p144<=p214]]]] & [[p103<=0 & [p183<=1 | [1<=p178 & p73<=p207]]] | [p113<=0 & [~ [p103<=p123] | ~ [p214<=0]]]]]]]]]]]]

abstracting: (p214<=0)
states: 158,000,002,658 (11)
abstracting: (p103<=p123)
states: 152,114,796,814 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p73<=p207)
states: 152,607,987,574 (11)
abstracting: (1<=p178)
states: 7,848,533,254 (9)
abstracting: (p183<=1)
states: 158,000,170,058 (11)
abstracting: (p103<=0)
states: 152,114,796,814 (11)
abstracting: (p144<=p214)
states: 154,751,216,048 (11)
abstracting: (p47<=p114)
states: 154,702,727,558 (11)
abstracting: (p159<=p170)
states: 154,561,468,688 (11)
abstracting: (1<=p94)
states: 5,885,373,244 (9)
abstracting: (1<=p121)
states: 7,848,696,454 (9)
abstracting: (1<=p177)
states: 7,848,533,254 (9)
abstracting: (1<=p82)
states: 3,248,954,010 (9)
abstracting: (1<=p232)
states: 7,131,115,025 (9)
abstracting: (1<=p12)
states: 5,895,690,188 (9)
abstracting: (p202<=p156)
states: 157,162,885,786 (11)
abstracting: (p14<=1)
states: 158,000,170,058 (11)
abstracting: (p135<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p92)
states: 153,600 (5)
abstracting: (p90<=p85)
states: 150,151,483,204 (11)
abstracting: (p126<=p221)
states: 152,446,429,230 (11)
abstracting: (1<=p230)
states: 8,778,818,833 (9)
abstracting: (p163<=p222)
states: 152,354,569,750 (11)
abstracting: (p250<=1)
states: 158,000,170,058 (11)
abstracting: (p20<=p15)
states: 158,000,169,458 (11)
abstracting: (p48<=p125)
states: 152,326,042,152 (11)
-> the formula is FALSE

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

MC time: 0m30.343sec

checking: AG [[[[~ [[[~ [p165<=p107] & p218<=p121] & [[1<=p216 & [p58<=p65 | [p142<=p206 | p194<=p249]]] & [p93<=p192 & [[p27<=p181 & p6<=1] & [p85<=1 & p42<=1]]]]]] & [[[[[~ [1<=p246] | [1<=p19 | p99<=1]] & [p74<=1 | p207<=p73]] | [[p97<=p21 & ~ [1<=p247]] | [1<=p251 | [p46<=p225 | 1<=p11]]]] & ~ [p122<=1]] | [[[[[p92<=0 & 1<=p157] | [p150<=0 & p123<=0]] | p187<=p147] & p224<=p129] | p93<=0]]] | [[[[~ [p251<=p26] & 1<=p46] & ~ [p33<=p166]] | [~ [[1<=p146 & [[1<=p66 | 1<=p213] | p101<=1]]] & [p103<=0 | [[~ [1<=p138] & p53<=p209] | p89<=p166]]]] | [[[p30<=p137 | [p108<=p227 & [~ [p239<=1] | p8<=p141]]] & 1<=p223] & ~ [[1<=p100 | [p249<=1 | [p161<=p62 & p53<=p161]]]]]]] & p224<=1]]
normalized: ~ [E [true U ~ [[p224<=1 & [[[~ [[1<=p100 | [p249<=1 | [p161<=p62 & p53<=p161]]]] & [1<=p223 & [p30<=p137 | [p108<=p227 & [p8<=p141 | ~ [p239<=1]]]]]] | [[[p103<=0 | [p89<=p166 | [p53<=p209 & ~ [1<=p138]]]] & ~ [[1<=p146 & [p101<=1 | [1<=p66 | 1<=p213]]]]] | [~ [p33<=p166] & [1<=p46 & ~ [p251<=p26]]]]] | [[[p93<=0 | [p224<=p129 & [p187<=p147 | [[p150<=0 & p123<=0] | [p92<=0 & 1<=p157]]]]] | [~ [p122<=1] & [[[1<=p251 | [p46<=p225 | 1<=p11]] | [p97<=p21 & ~ [1<=p247]]] | [[p74<=1 | p207<=p73] & [[1<=p19 | p99<=1] | ~ [1<=p246]]]]]] & ~ [[[[p93<=p192 & [[p85<=1 & p42<=1] & [p27<=p181 & p6<=1]]] & [1<=p216 & [p58<=p65 | [p142<=p206 | p194<=p249]]]] & [p218<=p121 & ~ [p165<=p107]]]]]]]]]]

abstracting: (p165<=p107)
states: 152,326,042,152 (11)
abstracting: (p218<=p121)
states: 156,646,749,784 (11)
abstracting: (p194<=p249)
states: 157,382,281,130 (11)
abstracting: (p142<=p206)
states: 152,607,987,574 (11)
abstracting: (p58<=p65)
states: 152,264,680,564 (11)
abstracting: (1<=p216)
states: 1,426,223,005 (9)
abstracting: (p6<=1)
states: 158,000,170,058 (11)
abstracting: (p27<=p181)
states: 158,000,169,458 (11)
abstracting: (p42<=1)
states: 158,000,170,058 (11)
abstracting: (p85<=1)
states: 158,000,170,058 (11)
abstracting: (p93<=p192)
states: 158,000,006,858 (11)
abstracting: (1<=p246)
states: 4,897,161,171 (9)
abstracting: (p99<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p19)
states: 150
abstracting: (p207<=p73)
states: 144,630,967,328 (11)
abstracting: (p74<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p247)
states: 4,897,161,171 (9)
abstracting: (p97<=p21)
states: 154,561,468,688 (11)
abstracting: (1<=p11)
states: 5,895,690,188 (9)
abstracting: (p46<=p225)
states: 152,354,569,750 (11)
abstracting: (1<=p251)
states: 0
abstracting: (p122<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p157)
states: 5,885,373,244 (9)
abstracting: (p92<=0)
states: 158,000,016,458 (11)
abstracting: (p123<=0)
states: 158,000,006,858 (11)
abstracting: (p150<=0)
states: 152,114,796,814 (11)
abstracting: (p187<=p147)
states: 157,162,885,786 (11)
abstracting: (p224<=p129)
states: 151,710,394,766 (11)
abstracting: (p93<=0)
states: 158,000,006,858 (11)
abstracting: (p251<=p26)
states: 158,000,170,058 (11)
abstracting: (1<=p46)
states: 5,885,373,244 (9)
abstracting: (p33<=p166)
states: 152,326,042,152 (11)
abstracting: (1<=p213)
states: 17,054,987,018 (10)
abstracting: (1<=p66)
states: 3,438,701,370 (9)
abstracting: (p101<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p146)
states: 7,848,533,254 (9)
abstracting: (1<=p138)
states: 5,885,373,244 (9)
abstracting: (p53<=p209)
states: 150,862,956,454 (11)
abstracting: (p89<=p166)
states: 152,326,042,152 (11)
abstracting: (p103<=0)
states: 152,114,796,814 (11)
abstracting: (p239<=1)
states: 158,000,170,058 (11)
abstracting: (p8<=p141)
states: 157,852,454,827 (11)
abstracting: (p108<=p227)
states: 152,354,569,750 (11)
abstracting: (p30<=p137)
states: 158,000,131,658 (11)
abstracting: (1<=p223)
states: 25,324,974,510 (10)
abstracting: (p53<=p161)
states: 150,461,317,932 (11)
abstracting: (p161<=p62)
states: 152,114,796,814 (11)
abstracting: (p249<=1)
states: 158,000,170,058 (11)
abstracting: (1<=p100)
states: 5,885,373,244 (9)
abstracting: (p224<=1)
states: 158,000,170,058 (11)
-> the formula is FALSE

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

MC time: 0m11.600sec

totally nodes used: 37960357 (3.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 171201520 419266875 590468395
used/not used/entry size/cache size: 66995184 113680 16 1024MB
basic ops cache: hits/miss/sum: 22473818 49302536 71776354
used/not used/entry size/cache size: 16644755 132461 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: 1106656 3078172 4184828
used/not used/entry size/cache size: 2581872 5806736 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 39310871
1 19836761
2 6158077
3 1466911
4 282918
5 45939
6 6478
7 807
8 93
9 9
>= 10 0

Total processing time: 2m59.584sec


BK_STOP 1678699730867

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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.001sec

74833 91003 81385 80072 93773
iterations count:581729 (1187), effective:20142 (41)

initing FirstDep: 0m 0.013sec


iterations count:94707 (193), effective:3367 (6)

iterations count:91348 (186), effective:3319 (6)

iterations count:88591 (180), effective:2976 (6)
98579
iterations count:102422 (209), effective:4175 (8)

iterations count:66681 (136), effective:1782 (3)

iterations count:91170 (186), effective:3435 (7)

iterations count:56766 (115), effective:1347 (2)
158141
iterations count:127902 (261), effective:3591 (7)

iterations count:78241 (159), effective:1542 (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-05b"
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-05b, 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-167813599300606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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