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.r009-oct2-167813598100558.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 ltsminxred
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 r009-oct2-167813598100558
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:57:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:57:51] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-12 15:57:51] [INFO ] Transformed 155 places.
[2023-03-12 15:57:51] [INFO ] Transformed 194 transitions.
[2023-03-12 15:57:51] [INFO ] Found NUPN structural information;
[2023-03-12 15:57:51] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 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 308 ms. (steps per millisecond=32 ) properties (out of 12) seen :9
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-12 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-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 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 4 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 194 rows 155 cols
[2023-03-12 15:57:52] [INFO ] Computed 7 place invariants in 11 ms
[2023-03-12 15:57:52] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 15:57:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-12 15:57:53] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 15:57:53] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 5 ms to minimize.
[2023-03-12 15:57:53] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-12 15:57:53] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-12 15:57:53] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 8 ms to minimize.
[2023-03-12 15:57:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2023-03-12 15:57:53] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-12 15:57:54] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-12 15:57:54] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 0 ms to minimize.
[2023-03-12 15:57:54] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 14 ms to minimize.
[2023-03-12 15:57:54] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2023-03-12 15:57:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 804 ms
[2023-03-12 15:57:54] [INFO ] After 1708ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-12 15:57:54] [INFO ] After 1952ms 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 7 ms.
Support contains 71 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 194/194 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 155 transition count 185
Reduce places removed 9 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 20 rules applied. Total rules applied 29 place count 146 transition count 174
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 135 transition count 173
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 135 transition count 169
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 131 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 126 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 126 transition count 164
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 75 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 125 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 125 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 121 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 120 transition count 142
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 120 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 120 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 118 transition count 139
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 95 place count 118 transition count 139
Applied a total of 95 rules in 123 ms. Remains 118 /155 variables (removed 37) and now considering 139/194 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 118/155 places, 139/194 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 118 cols
[2023-03-12 15:57:55] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-12 15:57:55] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:57:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 15:57:55] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:57:55] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-12 15:57:55] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2023-03-12 15:57:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-03-12 15:57:55] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-12 15:57:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-12 15:57:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 571 ms
[2023-03-12 15:57:55] [INFO ] After 729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 15:57:56] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 139/139 transitions.
Graph (trivial) has 40 edges and 118 vertex of which 2 / 118 are part of one of the 1 SCC in 30 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 255 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 116 transition count 127
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 28 place count 106 transition count 121
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 101 transition count 121
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 33 place count 101 transition count 118
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 39 place count 98 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 97 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 97 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 55 place count 90 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 90 transition count 108
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 4 with 4 rules applied. Total rules applied 61 place count 88 transition count 117
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 88 transition count 116
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 88 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 85 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 85 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 84 transition count 112
Applied a total of 70 rules in 81 ms. Remains 84 /118 variables (removed 34) and now considering 112/139 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 84/118 places, 112/139 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Probably explored full state space saw : 143280 states, properties seen :0
Probabilistic random walk after 767009 steps, saw 143280 distinct states, run finished after 850 ms. (steps per millisecond=902 ) properties seen :0
Explored full state space saw : 143280 states, properties seen :0
Exhaustive walk after 767009 steps, saw 143280 distinct states, run finished after 534 ms. (steps per millisecond=1436 ) properties seen :0
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 6124 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/516/inv_0_ --invariant=/tmp/516/inv_1_ --invariant=/tmp/516/inv_2_ --invariant=/tmp/516/inv_3_ --invariant=/tmp/516/inv_4_ --invariant=/tmp/516/inv_5_ --invariant=/tmp/516/inv_6_ --invariant=/tmp/516/inv_7_ --invariant=/tmp/516/inv_8_ --invariant=/tmp/516/inv_9_ --invariant=/tmp/516/inv_10_ --invariant=/tmp/516/inv_11_ --invariant=/tmp/516/inv_12_ --invariant=/tmp/516/inv_13_ --invariant=/tmp/516/inv_14_ --invariant=/tmp/516/inv_15_ --inv-par
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678636678909

--------------------
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
mcc2023
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_0_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_1_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_2_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_3_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/516/inv_4_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_5_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/516/inv_6_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/516/inv_7_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_8_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_9_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_10_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_11_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_12_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_13_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_14_
rfs formula name AutonomousCar-PT-02b-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/516/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 155 places, 194 transitions and 620 arcs
pnml2lts-sym: Petri net AutonomousCar-PT-02b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 194->194 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 155; there are 194 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/516/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 19834 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.090 real 0.360 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 4051732 states, 4672 nodes
pnml2lts-sym: group_next: 1110 nodes total
pnml2lts-sym: group_explored: 614 nodes, 892 short vectors total
pnml2lts-sym: max token count: 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="ltsminxred"
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 ltsminxred"
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 r009-oct2-167813598100558"
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 ;