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-167813600500663.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500663
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678741297329

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-09a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:01:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:01:41] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-13 21:01:41] [INFO ] Transformed 89 places.
[2023-03-13 21:01:41] [INFO ] Transformed 1249 transitions.
[2023-03-13 21:01:41] [INFO ] Found NUPN structural information;
[2023-03-13 21:01:41] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 16) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-13 21:01:42] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2023-03-13 21:01:42] [INFO ] Computed 14 place invariants in 26 ms
[2023-03-13 21:01:43] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 21:01:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 44 ms returned sat
[2023-03-13 21:01:47] [INFO ] After 3512ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-13 21:01:47] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-13 21:01:50] [INFO ] After 2798ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-03-13 21:01:53] [INFO ] After 6157ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 2794 ms.
[2023-03-13 21:01:56] [INFO ] After 12694ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 317 ms.
Support contains 60 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 897
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 84 transition count 897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 84 transition count 896
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 11 place count 83 transition count 896
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 83 transition count 894
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 81 transition count 894
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 81 transition count 894
Applied a total of 16 rules in 258 ms. Remains 81 /89 variables (removed 8) and now considering 894/904 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 81/89 places, 894/904 transitions.
Incomplete random walk after 10000 steps, including 439 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 10) seen :3
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 894 rows 81 cols
[2023-03-13 21:01:57] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-13 21:01:58] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 21:01:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 21:02:00] [INFO ] After 1878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 21:02:00] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-13 21:02:01] [INFO ] After 1300ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 21:02:02] [INFO ] After 2563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1269 ms.
[2023-03-13 21:02:04] [INFO ] After 5858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 123 ms.
Support contains 50 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 894/894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 81 transition count 893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 80 transition count 893
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 79 transition count 883
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 79 transition count 883
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 79 transition count 878
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 23 place count 74 transition count 869
Applied a total of 23 rules in 138 ms. Remains 74 /81 variables (removed 7) and now considering 869/894 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 74/81 places, 869/894 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 869 rows 74 cols
[2023-03-13 21:02:05] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-13 21:02:05] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:02:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2023-03-13 21:02:06] [INFO ] After 1234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:02:06] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-13 21:02:07] [INFO ] After 936ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:02:08] [INFO ] After 2117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1043 ms.
[2023-03-13 21:02:09] [INFO ] After 4661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 103 ms.
Support contains 44 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 869/869 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 868
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 868
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 867
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 863
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 39 place count 68 transition count 836
Applied a total of 39 rules in 90 ms. Remains 68 /74 variables (removed 6) and now considering 836/869 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 68/74 places, 836/869 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 836 rows 68 cols
[2023-03-13 21:02:10] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-13 21:02:10] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:02:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 21:02:11] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:11] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 21:02:12] [INFO ] After 897ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:13] [INFO ] After 1821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 818 ms.
[2023-03-13 21:02:14] [INFO ] After 4038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 43 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 836/836 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 835
Applied a total of 2 rules in 75 ms. Remains 67 /68 variables (removed 1) and now considering 835/836 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 67/68 places, 835/836 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 730322 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730322 steps, saw 100136 distinct states, run finished after 3005 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 835 rows 67 cols
[2023-03-13 21:02:18] [INFO ] Computed 14 place invariants in 14 ms
[2023-03-13 21:02:18] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:02:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 21:02:19] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:19] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 21:02:20] [INFO ] After 916ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:21] [INFO ] After 1848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 806 ms.
[2023-03-13 21:02:21] [INFO ] After 3832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 43 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 835/835 transitions.
Applied a total of 0 rules in 38 ms. Remains 67 /67 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 67/67 places, 835/835 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 835/835 transitions.
Applied a total of 0 rules in 39 ms. Remains 67 /67 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2023-03-13 21:02:22] [INFO ] Invariant cache hit.
[2023-03-13 21:02:22] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-13 21:02:22] [INFO ] Invariant cache hit.
[2023-03-13 21:02:22] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 21:02:22] [INFO ] Implicit Places using invariants and state equation in 318 ms returned [63, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 534 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 835/835 transitions.
Applied a total of 0 rules in 46 ms. Remains 65 /65 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 631 ms. Remains : 65/67 places, 835/835 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 746416 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 746416 steps, saw 101738 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 835 rows 65 cols
[2023-03-13 21:02:26] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-13 21:02:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:02:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 21:02:27] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:27] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 21:02:28] [INFO ] After 887ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:29] [INFO ] After 1856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 852 ms.
[2023-03-13 21:02:30] [INFO ] After 3805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 141 ms.
Support contains 43 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 835/835 transitions.
Applied a total of 0 rules in 34 ms. Remains 65 /65 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 65/65 places, 835/835 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 835/835 transitions.
Applied a total of 0 rules in 35 ms. Remains 65 /65 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2023-03-13 21:02:30] [INFO ] Invariant cache hit.
[2023-03-13 21:02:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-13 21:02:30] [INFO ] Invariant cache hit.
[2023-03-13 21:02:30] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 21:02:30] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-13 21:02:30] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-13 21:02:30] [INFO ] Invariant cache hit.
[2023-03-13 21:02:31] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1300 ms. Remains : 65/65 places, 835/835 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 65 transition count 833
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 64 transition count 833
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 832
Applied a total of 5 rules in 48 ms. Remains 63 /65 variables (removed 2) and now considering 832/835 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 832 rows 63 cols
[2023-03-13 21:02:31] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-13 21:02:31] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:02:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 104 ms returned sat
[2023-03-13 21:02:33] [INFO ] After 1220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:34] [INFO ] After 2082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 880 ms.
[2023-03-13 21:02:35] [INFO ] After 3201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:02:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 21:02:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 835 transitions and 12584 arcs took 13 ms.
[2023-03-13 21:02:35] [INFO ] Flatten gal took : 329 ms
Total runtime 54428 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 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: 65 places, 835 transitions, 12584 arcs.
Final Score: 6106.629
Took : 47 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678741404374

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 13491:
syntax error

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="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-09a, 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-167813600500663"
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 [ "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 ;