fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598100574
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
414.199 19396.00 43888.00 57.90 FTFTTTTTTTFFTTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 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 75K 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-03b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678637123816

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-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:05:27] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-12 16:05:27] [INFO ] Transformed 190 places.
[2023-03-12 16:05:27] [INFO ] Transformed 273 transitions.
[2023-03-12 16:05:27] [INFO ] Found NUPN structural information;
[2023-03-12 16:05:27] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 725 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 14) seen :6
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 273 rows 190 cols
[2023-03-12 16:05:28] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 16:05:29] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:05:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-12 16:05:30] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 16:05:31] [INFO ] Deduced a trap composed of 12 places in 1272 ms of which 37 ms to minimize.
[2023-03-12 16:05:31] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 21 ms to minimize.
[2023-03-12 16:05:31] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 14 ms to minimize.
[2023-03-12 16:05:32] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2023-03-12 16:05:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1773 ms
[2023-03-12 16:05:32] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2023-03-12 16:05:32] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-12 16:05:32] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-12 16:05:33] [INFO ] Deduced a trap composed of 45 places in 932 ms of which 1 ms to minimize.
[2023-03-12 16:05:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1496 ms
[2023-03-12 16:05:34] [INFO ] Deduced a trap composed of 31 places in 1289 ms of which 0 ms to minimize.
[2023-03-12 16:05:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1304 ms
[2023-03-12 16:05:34] [INFO ] After 5095ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-12 16:05:35] [INFO ] After 5588ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 45 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 273/273 transitions.
Graph (trivial) has 101 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 438 edges and 189 vertex of which 188 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 188 transition count 228
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 145 transition count 221
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 106 place count 141 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 113 place count 134 transition count 214
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 113 place count 134 transition count 206
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 126 transition count 206
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 138 place count 117 transition count 197
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 117 transition count 197
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 38 rules applied. Total rules applied 185 place count 117 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 116 transition count 159
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 212 place count 103 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 101 transition count 154
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 220 place count 101 transition count 150
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 225 place count 101 transition count 145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 230 place count 96 transition count 145
Applied a total of 230 rules in 121 ms. Remains 96 /190 variables (removed 94) and now considering 145/273 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 96/190 places, 145/273 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2038071 steps, run timeout after 3001 ms. (steps per millisecond=679 ) properties seen :{0=1}
Probabilistic random walk after 2038071 steps, saw 354520 distinct states, run finished after 3015 ms. (steps per millisecond=675 ) properties seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 96 cols
[2023-03-12 16:05:38] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 16:05:38] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:05:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 43 ms returned sat
[2023-03-12 16:05:38] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:05:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 16:05:38] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:05:38] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-12 16:05:39] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2023-03-12 16:05:39] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-12 16:05:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-03-12 16:05:39] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 16:05:39] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 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 2 rules applied. Total rules applied 2 place count 96 transition count 143
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 94 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 90 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 90 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 88 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 86 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 86 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 86 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 31 place count 81 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 33 place count 79 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 79 transition count 120
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 79 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 79 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 78 transition count 118
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 78 transition count 118
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 78 transition count 117
Applied a total of 41 rules in 58 ms. Remains 78 /96 variables (removed 18) and now considering 117/145 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 78/96 places, 117/145 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 586429 steps, run visited all 1 properties in 550 ms. (steps per millisecond=1066 )
Probabilistic random walk after 586429 steps, saw 112398 distinct states, run finished after 572 ms. (steps per millisecond=1025 ) properties seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12965 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/524/inv_0_ --invariant=/tmp/524/inv_1_ --invariant=/tmp/524/inv_2_ --invariant=/tmp/524/inv_3_ --invariant=/tmp/524/inv_4_ --invariant=/tmp/524/inv_5_ --invariant=/tmp/524/inv_6_ --invariant=/tmp/524/inv_7_ --invariant=/tmp/524/inv_8_ --invariant=/tmp/524/inv_9_ --invariant=/tmp/524/inv_10_ --invariant=/tmp/524/inv_11_ --invariant=/tmp/524/inv_12_ --invariant=/tmp/524/inv_13_ --invariant=/tmp/524/inv_14_ --invariant=/tmp/524/inv_15_ --inv-par
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678637143212

--------------------
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-03b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_0_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_1_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_2_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_3_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_4_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_5_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_6_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_7_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_8_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/524/inv_9_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_10_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_11_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_12_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_13_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/524/inv_14_
rfs formula name AutonomousCar-PT-03b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/524/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 190 places, 273 transitions and 1051 arcs
pnml2lts-sym: Petri net AutonomousCar-PT-03b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 273->273 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 190; there are 273 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/524/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/524/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 90037 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.830 real 3.310 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 144452774 states, 15153 nodes
pnml2lts-sym: group_next: 1835 nodes total
pnml2lts-sym: group_explored: 1044 nodes, 1698 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-03b"
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-03b, 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-167813598100574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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