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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14046.268 3600000.00 3682530.00 160.80 FFTFTTTTFFTTFTTT 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-167813600500671.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-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 26K 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 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 865K 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-09b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678741483382

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:04:47] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-13 21:04:47] [INFO ] Transformed 391 places.
[2023-03-13 21:04:47] [INFO ] Transformed 1554 transitions.
[2023-03-13 21:04:47] [INFO ] Found NUPN structural information;
[2023-03-13 21:04:47] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-13 21:04:48] [INFO ] Computed 14 place invariants in 42 ms
[2023-03-13 21:04:49] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 21:04:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-13 21:04:51] [INFO ] After 1308ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-13 21:04:52] [INFO ] Deduced a trap composed of 16 places in 1031 ms of which 28 ms to minimize.
[2023-03-13 21:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1154 ms
[2023-03-13 21:04:53] [INFO ] Deduced a trap composed of 7 places in 607 ms of which 1 ms to minimize.
[2023-03-13 21:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 687 ms
[2023-03-13 21:04:53] [INFO ] After 3510ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-13 21:04:53] [INFO ] After 3941ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 55 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 267 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 134 rules applied. Total rules applied 136 place count 382 transition count 1411
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 170 rules applied. Total rules applied 306 place count 250 transition count 1373
Reduce places removed 20 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 26 rules applied. Total rules applied 332 place count 230 transition count 1367
Reduce places removed 6 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 3 with 8 rules applied. Total rules applied 340 place count 224 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 223 transition count 1365
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 341 place count 223 transition count 1338
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 395 place count 196 transition count 1338
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 430 place count 161 transition count 1303
Iterating global reduction 5 with 35 rules applied. Total rules applied 465 place count 161 transition count 1303
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 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 5 with 327 rules applied. Total rules applied 792 place count 161 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 793 place count 160 transition count 976
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 797 place count 156 transition count 948
Iterating global reduction 7 with 4 rules applied. Total rules applied 801 place count 156 transition count 948
Ensure Unique test 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 7 with 3 rules applied. Total rules applied 804 place count 156 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 805 place count 155 transition count 945
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 857 place count 129 transition count 919
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 859 place count 129 transition count 917
Free-agglomeration rule applied 22 times.
Iterating global reduction 9 with 22 rules applied. Total rules applied 881 place count 129 transition count 895
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 903 place count 107 transition count 895
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 904 place count 107 transition count 894
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 907 place count 107 transition count 894
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 106 transition count 893
Applied a total of 908 rules in 452 ms. Remains 106 /391 variables (removed 285) and now considering 893/1554 (removed 661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 106/391 places, 893/1554 transitions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 893 rows 106 cols
[2023-03-13 21:04:54] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-13 21:04:54] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:04:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-13 21:04:55] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:04:56] [INFO ] After 635ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:04:57] [INFO ] Deduced a trap composed of 9 places in 738 ms of which 3 ms to minimize.
[2023-03-13 21:04:58] [INFO ] Deduced a trap composed of 8 places in 599 ms of which 0 ms to minimize.
[2023-03-13 21:04:59] [INFO ] Deduced a trap composed of 6 places in 518 ms of which 1 ms to minimize.
[2023-03-13 21:04:59] [INFO ] Deduced a trap composed of 9 places in 689 ms of which 1 ms to minimize.
[2023-03-13 21:05:00] [INFO ] Deduced a trap composed of 8 places in 725 ms of which 13 ms to minimize.
[2023-03-13 21:05:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3659 ms
[2023-03-13 21:05:00] [INFO ] After 5018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-13 21:05:01] [INFO ] After 6525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 46 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 893/893 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 891
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 104 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 102 transition count 881
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 102 transition count 881
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 102 transition count 880
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 100 transition count 878
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 100 transition count 876
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 98 transition count 876
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 18 place count 97 transition count 875
Applied a total of 18 rules in 205 ms. Remains 97 /106 variables (removed 9) and now considering 875/893 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 97/106 places, 875/893 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1096707 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{0=1}
Probabilistic random walk after 1096707 steps, saw 159172 distinct states, run finished after 3003 ms. (steps per millisecond=365 ) properties seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 875 rows 97 cols
[2023-03-13 21:05:04] [INFO ] Computed 14 place invariants in 28 ms
[2023-03-13 21:05:05] [INFO ] [Real]Absence check using 14 positive place invariants in 57 ms returned sat
[2023-03-13 21:05:05] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 21:05:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 119 ms returned sat
[2023-03-13 21:05:06] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 21:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:05:06] [INFO ] After 140ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 21:05:07] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-13 21:05:07] [INFO ] After 1469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 875/875 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 97 transition count 869
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 91 transition count 869
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 91 transition count 867
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 89 transition count 867
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 88 transition count 858
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 88 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 88 transition count 857
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 39 place count 78 transition count 847
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 46 place count 71 transition count 777
Iterating global reduction 3 with 7 rules applied. Total rules applied 53 place count 71 transition count 777
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 64 transition count 770
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 64 transition count 764
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 106 place count 58 transition count 737
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 57 transition count 736
Applied a total of 107 rules in 241 ms. Remains 57 /97 variables (removed 40) and now considering 736/875 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 57/97 places, 736/875 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Finished Best-First random walk after 849 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=424 )
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 20920 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 09b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 391 places, 1554 transitions, 16243 arcs.
Final Score: 41440.147
Took : 79 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 2103272 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104252 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-09b"
export BK_EXAMINATION="ReachabilityFireability"
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-09b, examination is ReachabilityFireability"
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-167813600500671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;