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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678637717812

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-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:15:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:15:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:15:21] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-12 16:15:21] [INFO ] Transformed 255 places.
[2023-03-12 16:15:21] [INFO ] Transformed 490 transitions.
[2023-03-12 16:15:21] [INFO ] Found NUPN structural information;
[2023-03-12 16:15:21] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 153 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-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 12) seen :5
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :2
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-12 16:15:22] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-12 16:15:22] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:15:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned sat
[2023-03-12 16:15:23] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 16:15:24] [INFO ] Deduced a trap composed of 7 places in 598 ms of which 9 ms to minimize.
[2023-03-12 16:15:24] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2023-03-12 16:15:24] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 2 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 12 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 1 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-12 16:15:25] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 0 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2361 ms
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 0 ms to minimize.
[2023-03-12 16:15:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 580 ms
[2023-03-12 16:15:26] [INFO ] After 3851ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-12 16:15:27] [INFO ] After 4397ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 154 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 248 transition count 424
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 190 transition count 415
Reduce places removed 5 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 18 rules applied. Total rules applied 146 place count 185 transition count 402
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 159 place count 172 transition count 402
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 159 place count 172 transition count 389
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 185 place count 159 transition count 389
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 200 place count 144 transition count 374
Iterating global reduction 4 with 15 rules applied. Total rules applied 215 place count 144 transition count 374
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 316 place count 144 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 316 place count 144 transition count 271
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 142 transition count 271
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 322 place count 140 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 140 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 360 place count 122 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 361 place count 121 transition count 237
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 121 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 366 place count 119 transition count 237
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 119 transition count 234
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 119 transition count 228
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 113 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 113 transition count 225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 113 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 112 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 112 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 389 place count 112 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 111 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 110 transition count 218
Applied a total of 391 rules in 160 ms. Remains 110 /255 variables (removed 145) and now considering 218/490 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 110/255 places, 218/490 transitions.
Incomplete random walk after 10000 steps, including 243 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 110 cols
[2023-03-12 16:15:27] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-12 16:15:27] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:15:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:15:27] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:27] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:28] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 24 ms to minimize.
[2023-03-12 16:15:28] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-12 16:15:28] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-12 16:15:28] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-12 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 705 ms
[2023-03-12 16:15:28] [INFO ] After 809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 16:15:28] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 218/218 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 110 transition count 203
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 95 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 92 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 39 place count 92 transition count 191
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 51 place count 86 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 84 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 84 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 84 transition count 184
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 76 place count 74 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 78 place count 72 transition count 167
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 72 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 72 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 72 transition count 165
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 92 place count 72 transition count 155
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 102 place count 62 transition count 155
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 62 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 105 place count 61 transition count 152
Applied a total of 105 rules in 77 ms. Remains 61 /110 variables (removed 49) and now considering 152/218 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 61/110 places, 152/218 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 72162 steps, run visited all 1 properties in 151 ms. (steps per millisecond=477 )
Probabilistic random walk after 72162 steps, saw 13650 distinct states, run finished after 151 ms. (steps per millisecond=477 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7730 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/542/inv_0_ --invariant=/tmp/542/inv_1_ --invariant=/tmp/542/inv_2_ --invariant=/tmp/542/inv_3_ --invariant=/tmp/542/inv_4_ --invariant=/tmp/542/inv_5_ --invariant=/tmp/542/inv_6_ --invariant=/tmp/542/inv_7_ --invariant=/tmp/542/inv_8_ --invariant=/tmp/542/inv_9_ --invariant=/tmp/542/inv_10_ --invariant=/tmp/542/inv_11_ --invariant=/tmp/542/inv_12_ --invariant=/tmp/542/inv_13_ --invariant=/tmp/542/inv_14_ --invariant=/tmp/542/inv_15_ --inv-par
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678637760134

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-05b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_0_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_1_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_2_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/542/inv_3_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_4_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_5_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_6_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_7_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/542/inv_8_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_9_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_10_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_11_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/542/inv_12_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_13_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/542/inv_14_
rfs formula name AutonomousCar-PT-05b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/542/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 255 places, 490 transitions and 2527 arcs
pnml2lts-sym: Petri net AutonomousCar-PT-05b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 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: 490->490 groups
pnml2lts-sym: Regrouping took 0.120 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 255; there are 490 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/542/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/542/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 1824954 group checks and 0 next state calls
pnml2lts-sym: reachability took 30.240 real 120.580 user 0.220 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.040 real 0.140 user 0.000 sys
pnml2lts-sym: state space has 158000170058 states, 74679 nodes
pnml2lts-sym: group_next: 4265 nodes total
pnml2lts-sym: group_explored: 2518 nodes, 5796 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-05b"
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-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;