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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 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 177K 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-06a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678699814696

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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:30:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:30:18] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-13 09:30:18] [INFO ] Transformed 65 places.
[2023-03-13 09:30:18] [INFO ] Transformed 417 transitions.
[2023-03-13 09:30:18] [INFO ] Found NUPN structural information;
[2023-03-13 09:30:18] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 577 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 7) seen :5
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:30:18] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
// Phase 1: matrix 257 rows 65 cols
[2023-03-13 09:30:18] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-13 09:30:19] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 09:30:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 72 ms returned sat
[2023-03-13 09:30:19] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 09:30:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-13 09:30:19] [INFO ] After 78ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-13 09:30:20] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-13 09:30:20] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 28 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 258/258 transitions.
Graph (complete) has 529 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 64 transition count 254
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 62 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 61 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 61 transition count 252
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 60 transition count 252
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 57 transition count 231
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 57 transition count 231
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 57 transition count 228
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 34 place count 54 transition count 216
Applied a total of 34 rules in 59 ms. Remains 54 /65 variables (removed 11) and now considering 216/258 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 54/65 places, 216/258 transitions.
Incomplete random walk after 10000 steps, including 447 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2410760 steps, run timeout after 3001 ms. (steps per millisecond=803 ) properties seen :{}
Probabilistic random walk after 2410760 steps, saw 355221 distinct states, run finished after 3026 ms. (steps per millisecond=796 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 54 cols
[2023-03-13 09:30:23] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-13 09:30:23] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:30:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:23] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-13 09:30:23] [INFO ] After 54ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:23] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-13 09:30:23] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 28 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 54/54 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 09:30:23] [INFO ] Invariant cache hit.
[2023-03-13 09:30:23] [INFO ] Implicit Places using invariants in 150 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 173 ms. Remains : 53/54 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2709040 steps, run timeout after 3001 ms. (steps per millisecond=902 ) properties seen :{}
Probabilistic random walk after 2709040 steps, saw 391905 distinct states, run finished after 3002 ms. (steps per millisecond=902 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 53 cols
[2023-03-13 09:30:26] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-13 09:30:27] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:30:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 09:30:27] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:27] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 14 ms to minimize.
[2023-03-13 09:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-13 09:30:27] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-13 09:30:27] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 28 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 53/53 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 09:30:27] [INFO ] Invariant cache hit.
[2023-03-13 09:30:28] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-13 09:30:28] [INFO ] Invariant cache hit.
[2023-03-13 09:30:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 342 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 354 ms. Remains : 52/53 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2707242 steps, run timeout after 3001 ms. (steps per millisecond=902 ) properties seen :{}
Probabilistic random walk after 2707242 steps, saw 391685 distinct states, run finished after 3001 ms. (steps per millisecond=902 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 52 cols
[2023-03-13 09:30:31] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-13 09:30:31] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:30:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 33 ms returned sat
[2023-03-13 09:30:31] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:31] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-13 09:30:31] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 28 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 52/52 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 09:30:31] [INFO ] Invariant cache hit.
[2023-03-13 09:30:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-13 09:30:32] [INFO ] Invariant cache hit.
[2023-03-13 09:30:32] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-13 09:30:32] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-13 09:30:32] [INFO ] Invariant cache hit.
[2023-03-13 09:30:33] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2025 ms. Remains : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-13 09:30:33] [INFO ] Invariant cache hit.
[2023-03-13 09:30:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 09:30:34] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:34] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-13 09:30:34] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 09:30:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 216 transitions and 1673 arcs took 2 ms.
[2023-03-13 09:30:35] [INFO ] Flatten gal took : 76 ms
Total runtime 17039 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: AutonomousCar_PT_06a
(NrP: 52 NrTr: 216 NrArc: 1673)

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

net check time: 0m 0.000sec

init dd package: 0m 2.929sec


RS generation: 0m 1.228sec


-> reachability set: #nodes 6014 (6.0e+03) #states 2,730,530 (6)



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

checking: AG [[[[[[[[[[[[p1<=0 & 0<=p1] & [p8<=1 & 1<=p8]] | [p37<=0 & 0<=p37]] & [[1<=p43 & p43<=1] | [p24<=0 & 0<=p24]]] | [[[p43<=1 & 1<=p43] & [p4<=0 & 0<=p4]] & [[p26<=1 & 1<=p26] & [p13<=0 & 0<=p13]]]] | [[[0<=p32 & p32<=0] & [1<=p35 & p35<=1]] & [[[1<=p30 & p30<=1] | [p15<=0 & 0<=p15]] & [[[p5<=0 & 0<=p5] | [p49<=1 & 1<=p49]] & [[p22<=0 & 0<=p22] | [p50<=1 & 1<=p50]]]]]] & [0<=p0 & p0<=0]] | [[p48<=0 & 0<=p48] & [[[p27<=0 & 0<=p27] | [p45<=1 & 1<=p45]] & [[p42<=0 & 0<=p42] | [p33<=1 & 1<=p33]]]]] | [[0<=p14 & p14<=0] & [1<=p51 & p51<=1]]] | [[[1<=p6 & p6<=1] & [0<=p49 & p49<=0]] | [1<=p27 & p27<=1]]] | [[[1<=p46 & p46<=1] | [1<=p45 & p45<=1]] | [[1<=p11 & p11<=1] | [0<=p12 & p12<=0]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p46 & p46<=1] | [1<=p45 & p45<=1]] | [[1<=p11 & p11<=1] | [0<=p12 & p12<=0]]] | [[[[1<=p6 & p6<=1] & [0<=p49 & p49<=0]] | [1<=p27 & p27<=1]] | [[[0<=p14 & p14<=0] & [1<=p51 & p51<=1]] | [[[p48<=0 & 0<=p48] & [[[p27<=0 & 0<=p27] | [p45<=1 & 1<=p45]] & [[p42<=0 & 0<=p42] | [p33<=1 & 1<=p33]]]] | [[0<=p0 & p0<=0] & [[[[[p43<=1 & 1<=p43] & [p4<=0 & 0<=p4]] & [[p26<=1 & 1<=p26] & [p13<=0 & 0<=p13]]] | [[[[p1<=0 & 0<=p1] & [p8<=1 & 1<=p8]] | [p37<=0 & 0<=p37]] & [[1<=p43 & p43<=1] | [p24<=0 & 0<=p24]]]] | [[[0<=p32 & p32<=0] & [1<=p35 & p35<=1]] & [[[[p22<=0 & 0<=p22] | [p50<=1 & 1<=p50]] & [[p49<=1 & 1<=p49] | [p5<=0 & 0<=p5]]] & [[p15<=0 & 0<=p15] | [1<=p30 & p30<=1]]]]]]]]]]]]]

abstracting: (p30<=1)
states: 2,730,530 (6)
abstracting: (1<=p30)
states: 386,208 (5)
abstracting: (0<=p15)
states: 2,730,530 (6)
abstracting: (p15<=0)
states: 2,282,498 (6)
abstracting: (0<=p5)
states: 2,730,530 (6)
abstracting: (p5<=0)
states: 2,366,930 (6)
abstracting: (1<=p49)
states: 537,120 (5)
abstracting: (p49<=1)
states: 2,730,530 (6)
abstracting: (1<=p50)
states: 1,225,440 (6)
abstracting: (p50<=1)
states: 2,730,530 (6)
abstracting: (0<=p22)
states: 2,730,530 (6)
abstracting: (p22<=0)
states: 2,193,746 (6)
abstracting: (p35<=1)
states: 2,730,530 (6)
abstracting: (1<=p35)
states: 449,376 (5)
abstracting: (p32<=0)
states: 2,281,154 (6)
abstracting: (0<=p32)
states: 2,730,530 (6)
abstracting: (0<=p24)
states: 2,730,530 (6)
abstracting: (p24<=0)
states: 2,165,329 (6)
abstracting: (p43<=1)
states: 2,730,530 (6)
abstracting: (1<=p43)
states: 50,400 (4)
abstracting: (0<=p37)
states: 2,730,530 (6)
abstracting: (p37<=0)
states: 2,259,889 (6)
abstracting: (1<=p8)
states: 343,728 (5)
abstracting: (p8<=1)
states: 2,730,530 (6)
abstracting: (0<=p1)
states: 2,730,530 (6)
abstracting: (p1<=0)
states: 2,438,929 (6)
abstracting: (0<=p13)
states: 2,730,530 (6)
abstracting: (p13<=0)
states: 2,167,489 (6)
abstracting: (1<=p26)
states: 386,208 (5)
abstracting: (p26<=1)
states: 2,730,530 (6)
abstracting: (0<=p4)
states: 2,730,530 (6)
abstracting: (p4<=0)
states: 2,366,930 (6)
abstracting: (1<=p43)
states: 50,400 (4)
abstracting: (p43<=1)
states: 2,730,530 (6)
abstracting: (p0<=0)
states: 2,730,529 (6)
abstracting: (0<=p0)
states: 2,730,530 (6)
abstracting: (1<=p33)
states: 441,120 (5)
abstracting: (p33<=1)
states: 2,730,530 (6)
abstracting: (0<=p42)
states: 2,730,530 (6)
abstracting: (p42<=0)
states: 2,680,130 (6)
abstracting: (1<=p45)
states: 972,000 (5)
abstracting: (p45<=1)
states: 2,730,530 (6)
abstracting: (0<=p27)
states: 2,730,530 (6)
abstracting: (p27<=0)
states: 2,351,234 (6)
abstracting: (0<=p48)
states: 2,730,530 (6)
abstracting: (p48<=0)
states: 2,193,410 (6)
abstracting: (p51<=1)
states: 2,730,530 (6)
abstracting: (1<=p51)
states: 430,849 (5)
abstracting: (p14<=0)
states: 2,282,498 (6)
abstracting: (0<=p14)
states: 2,730,530 (6)
abstracting: (p27<=1)
states: 2,730,530 (6)
abstracting: (1<=p27)
states: 379,296 (5)
abstracting: (p49<=0)
states: 2,193,410 (6)
abstracting: (0<=p49)
states: 2,730,530 (6)
abstracting: (p6<=1)
states: 2,730,530 (6)
abstracting: (1<=p6)
states: 363,600 (5)
abstracting: (p12<=0)
states: 2,195,714 (6)
abstracting: (0<=p12)
states: 2,730,530 (6)
abstracting: (p11<=1)
states: 2,730,530 (6)
abstracting: (1<=p11)
states: 563,040 (5)
abstracting: (p45<=1)
states: 2,730,530 (6)
abstracting: (1<=p45)
states: 972,000 (5)
abstracting: (p46<=1)
states: 2,730,530 (6)
abstracting: (1<=p46)
states: 904,465 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.238sec

totally nodes used: 554641 (5.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5641151 12764834 18405985
used/not used/entry size/cache size: 11606578 55502286 16 1024MB
basic ops cache: hits/miss/sum: 595236 799930 1395166
used/not used/entry size/cache size: 1402916 15374300 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: 35341 74806 110147
used/not used/entry size/cache size: 74675 8313933 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 66583744
1 498406
2 24124
3 2393
4 178
5 18
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 8.434sec


BK_STOP 1678699843929

--------------------
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.001sec


iterations count:47219 (218), effective:1065 (4)

initing FirstDep: 0m 0.000sec

4301
iterations count:186221 (862), effective:3670 (16)

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-06a"
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-06a, 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-167813599300614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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