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

About the Execution of Smart+red for AutonomousCar-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16218.867 2187948.00 2297818.00 1024.00 FTTFT?T?FFTTTTTF 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.r011-oct2-167813600500662.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 smartxred
Input is AutonomousCar-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:53 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 781K 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-09a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678741150103

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:59:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:59:13] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-13 20:59:13] [INFO ] Transformed 89 places.
[2023-03-13 20:59:13] [INFO ] Transformed 1249 transitions.
[2023-03-13 20:59:13] [INFO ] Found NUPN structural information;
[2023-03-13 20:59:13] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 492 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 20:59:14] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2023-03-13 20:59:14] [INFO ] Computed 14 place invariants in 19 ms
[2023-03-13 20:59:14] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 20:59:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 48 ms returned sat
[2023-03-13 20:59:16] [INFO ] After 1217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 20:59:16] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-13 20:59:17] [INFO ] After 726ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 20:59:19] [INFO ] Deduced a trap composed of 15 places in 1190 ms of which 22 ms to minimize.
[2023-03-13 20:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1278 ms
[2023-03-13 20:59:20] [INFO ] Deduced a trap composed of 22 places in 736 ms of which 1 ms to minimize.
[2023-03-13 20:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
[2023-03-13 20:59:20] [INFO ] After 3791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 640 ms.
[2023-03-13 20:59:20] [INFO ] After 5910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 983 ms.
Support contains 46 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 88 transition count 901
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 85 transition count 871
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 85 transition count 871
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 84 transition count 870
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 84 transition count 867
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 27 place count 81 transition count 858
Applied a total of 27 rules in 205 ms. Remains 81 /89 variables (removed 8) and now considering 858/904 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 81/89 places, 858/904 transitions.
Incomplete random walk after 10000 steps, including 470 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 6) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 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 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 858 rows 81 cols
[2023-03-13 20:59:22] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-13 20:59:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:59:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 62 ms returned sat
[2023-03-13 20:59:23] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 20:59:23] [INFO ] State equation strengthened by 290 read => feed constraints.
[2023-03-13 20:59:24] [INFO ] After 623ms SMT Verify possible using 290 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 20:59:25] [INFO ] Deduced a trap composed of 21 places in 672 ms of which 2 ms to minimize.
[2023-03-13 20:59:26] [INFO ] Deduced a trap composed of 6 places in 814 ms of which 12 ms to minimize.
[2023-03-13 20:59:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1596 ms
[2023-03-13 20:59:26] [INFO ] After 3034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 604 ms.
[2023-03-13 20:59:27] [INFO ] After 4800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 608 ms.
Support contains 37 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 858/858 transitions.
Graph (complete) has 986 edges and 81 vertex of which 80 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 79 transition count 857
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 79 transition count 854
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 18 place count 76 transition count 845
Applied a total of 18 rules in 133 ms. Remains 76 /81 variables (removed 5) and now considering 845/858 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 76/81 places, 845/858 transitions.
Incomplete random walk after 10000 steps, including 480 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 845 rows 76 cols
[2023-03-13 20:59:28] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-13 20:59:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:59:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-13 20:59:29] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:59:29] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-13 20:59:29] [INFO ] After 460ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:59:30] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 489 ms.
[2023-03-13 20:59:30] [INFO ] After 1994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 576 ms.
Support contains 33 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 845/845 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 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 844
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 75 transition count 842
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 24 place count 73 transition count 824
Applied a total of 24 rules in 139 ms. Remains 73 /76 variables (removed 3) and now considering 824/845 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 73/76 places, 824/845 transitions.
Incomplete random walk after 10000 steps, including 381 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 824 rows 73 cols
[2023-03-13 20:59:31] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-13 20:59:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:59:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 20:59:32] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:32] [INFO ] State equation strengthened by 263 read => feed constraints.
[2023-03-13 20:59:33] [INFO ] After 301ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:33] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-13 20:59:33] [INFO ] After 1655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 346 ms.
Support contains 31 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 824/824 transitions.
Applied a total of 0 rules in 38 ms. Remains 73 /73 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 73/73 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 361 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 673688 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 673688 steps, saw 99312 distinct states, run finished after 3003 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 20:59:37] [INFO ] Invariant cache hit.
[2023-03-13 20:59:37] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:59:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 20:59:37] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:37] [INFO ] State equation strengthened by 263 read => feed constraints.
[2023-03-13 20:59:38] [INFO ] After 273ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:38] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 318 ms.
[2023-03-13 20:59:38] [INFO ] After 1497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 260 ms.
Support contains 31 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 824/824 transitions.
Applied a total of 0 rules in 34 ms. Remains 73 /73 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 73/73 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 824/824 transitions.
Applied a total of 0 rules in 40 ms. Remains 73 /73 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 20:59:39] [INFO ] Invariant cache hit.
[2023-03-13 20:59:39] [INFO ] Implicit Places using invariants in 391 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 824/824 transitions.
Applied a total of 0 rules in 32 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 476 ms. Remains : 72/73 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
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
Interrupted probabilistic random walk after 678348 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678348 steps, saw 99939 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 824 rows 72 cols
[2023-03-13 20:59:42] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-13 20:59:43] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:59:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 20:59:43] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:43] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-13 20:59:44] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 119 ms.
Support contains 31 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 824/824 transitions.
Applied a total of 0 rules in 38 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 72/72 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 824/824 transitions.
Applied a total of 0 rules in 35 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 20:59:44] [INFO ] Invariant cache hit.
[2023-03-13 20:59:44] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-13 20:59:44] [INFO ] Invariant cache hit.
[2023-03-13 20:59:46] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned [67, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1682 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/72 places, 824/824 transitions.
Applied a total of 0 rules in 63 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1782 ms. Remains : 70/72 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 741756 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 741756 steps, saw 107602 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 824 rows 70 cols
[2023-03-13 20:59:49] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-13 20:59:49] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:59:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 20:59:50] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:50] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-13 20:59:50] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 254 ms.
Support contains 31 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 45 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 70/70 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 29 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 20:59:51] [INFO ] Invariant cache hit.
[2023-03-13 20:59:51] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-13 20:59:51] [INFO ] Invariant cache hit.
[2023-03-13 20:59:52] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2023-03-13 20:59:52] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-13 20:59:52] [INFO ] Invariant cache hit.
[2023-03-13 20:59:53] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2658 ms. Remains : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 33 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 20:59:53] [INFO ] Invariant cache hit.
[2023-03-13 20:59:53] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:59:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 20:59:54] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:54] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-13 20:59:55] [INFO ] After 1298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:59:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 20:59:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 824 transitions and 11924 arcs took 12 ms.
[2023-03-13 20:59:55] [INFO ] Flatten gal took : 227 ms
Total runtime 42722 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 09a
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 70 places, 824 transitions, 11924 arcs.
Final Score: 5919.222
Took : 50 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-09a-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) | ( ( (tk(P68)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) ) | ( ( ( ( (tk(P45)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P45)) ) ) & ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) | ( ( ( ( ( (tk(P24)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P24)) ) ) | ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) ) & ( ( ( ( (tk(P31)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P31)) ) ) | ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) ) | ( ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) | ( ( (tk(P70)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P70)) ) ) ) ) ) | ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) & ( ( ( (tk(P25)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P25)) ) ) | ( ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) & ( ( (tk(P65)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P65)) ) ) ) & ( ( ( (tk(P45)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P45)) ) ) & ( ( ( (tk(P46)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P46)) ) ) | ( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) & ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-09a-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) | ( ( ( (tk(P58)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P58)) ) ) | ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) ) ) | ( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) | ( ( ( (tk(P61)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P61)) ) ) | ( ( ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) & ( ( ( (tk(P56)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P56)) ) ) | ( ( (tk(P26)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P26)) ) ) ) ) & ( ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) | ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) | ( ( ( (tk(P36)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P36)) ) ) | ( ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) & ( ( ( (tk(P50)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P50)) ) ) | ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) ) ) ) ) & ( ( ( (tk(P34)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P34)) ) ) | ( ( ( (tk(P24)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P24)) ) ) & ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) ) ) ) ) ) )))

BK_STOP 1678743338051

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 612 Killed ${SMART}/smart ${INPUT_SM}

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-09a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is AutonomousCar-PT-09a, 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 r011-oct2-167813600500662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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