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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Feb 25 12:58 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 1.5M 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-10a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678641688671

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-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:21:31] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2023-03-12 17:21:31] [INFO ] Transformed 97 places.
[2023-03-12 17:21:31] [INFO ] Transformed 1921 transitions.
[2023-03-12 17:21:31] [INFO ] Found NUPN structural information;
[2023-03-12 17:21:31] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 463 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 9) seen :5
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 17:21:32] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2023-03-12 17:21:32] [INFO ] Computed 15 place invariants in 35 ms
[2023-03-12 17:21:33] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-12 17:21:34] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:21:34] [INFO ] State equation strengthened by 403 read => feed constraints.
[2023-03-12 17:21:34] [INFO ] After 281ms SMT Verify possible using 403 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 17:21:35] [INFO ] Deduced a trap composed of 7 places in 795 ms of which 15 ms to minimize.
[2023-03-12 17:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 910 ms
[2023-03-12 17:21:35] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-12 17:21:36] [INFO ] After 2689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 177 ms.
Support contains 59 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 97 transition count 1493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 94 transition count 1493
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 90 transition count 1449
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 90 transition count 1449
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 90 transition count 1444
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 56 place count 85 transition count 1414
Applied a total of 56 rules in 410 ms. Remains 85 /97 variables (removed 12) and now considering 1414/1498 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 85/97 places, 1414/1498 transitions.
Incomplete random walk after 10000 steps, including 361 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1414 rows 85 cols
[2023-03-12 17:21:37] [INFO ] Computed 15 place invariants in 13 ms
[2023-03-12 17:21:37] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 17:21:37] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:37] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-12 17:21:37] [INFO ] After 142ms SMT Verify possible using 332 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:38] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-12 17:21:38] [INFO ] After 998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 26 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1414/1414 transitions.
Graph (complete) has 1165 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 84 transition count 1411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 82 transition count 1411
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 77 transition count 1356
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 77 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 76 transition count 1355
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 76 transition count 1353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 42 place count 74 transition count 1333
Applied a total of 42 rules in 246 ms. Remains 74 /85 variables (removed 11) and now considering 1333/1414 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 74/85 places, 1333/1414 transitions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 600316 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600316 steps, saw 74049 distinct states, run finished after 3005 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 74 cols
[2023-03-12 17:21:41] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-12 17:21:42] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 17:21:42] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:42] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 17:21:42] [INFO ] After 136ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:43] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-12 17:21:43] [INFO ] After 1154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 100 ms.
Support contains 26 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 85 ms. Remains 74 /74 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 74/74 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 88 ms. Remains 74 /74 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-12 17:21:43] [INFO ] Invariant cache hit.
[2023-03-12 17:21:44] [INFO ] Implicit Places using invariants in 698 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 707 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 119 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 915 ms. Remains : 73/74 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 646360 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646360 steps, saw 78661 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 73 cols
[2023-03-12 17:21:47] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-12 17:21:47] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:21:48] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:48] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 17:21:48] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 26 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 110 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 73/73 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 77 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-12 17:21:48] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:50] [INFO ] Implicit Places using invariants and state equation in 931 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1570 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 110 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1758 ms. Remains : 72/73 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 356 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 627978 steps, run timeout after 3002 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627978 steps, saw 77207 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 72 cols
[2023-03-12 17:21:53] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-12 17:21:54] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 17:21:54] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:54] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 17:21:54] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 86 ms.
Support contains 26 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 72 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 72/72 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 70 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-12 17:21:55] [INFO ] Invariant cache hit.
[2023-03-12 17:21:56] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-12 17:21:56] [INFO ] Invariant cache hit.
[2023-03-12 17:21:57] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2023-03-12 17:21:57] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-12 17:21:57] [INFO ] Invariant cache hit.
[2023-03-12 17:21:58] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3131 ms. Remains : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 79 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 17:21:58] [INFO ] Invariant cache hit.
[2023-03-12 17:21:58] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:58] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:59] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-12 17:21:59] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:21:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-12 17:21:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 1333 transitions and 24207 arcs took 42 ms.
[2023-03-12 17:22:00] [INFO ] Flatten gal took : 479 ms
Total runtime 28791 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/555/inv_0_ --invariant=/tmp/555/inv_1_ --inv-par
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678642599141

--------------------
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-10a-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/555/inv_0_
rfs formula name AutonomousCar-PT-10a-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_1_
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 72 places, 1333 transitions and 24207 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_10a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.030 user 0.010 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: 1333->1311 groups
pnml2lts-sym: Regrouping took 0.920 real 0.920 user 0.000 sys
pnml2lts-sym: state vector length is 72; there are 1311 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/555/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/555/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 876.590 real 3503.750 user 0.080 sys
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-10a"
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-10a, 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-167813598200678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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