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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 1.6M 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-10b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678742835907

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-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:27:20] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2023-03-13 21:27:20] [INFO ] Transformed 425 places.
[2023-03-13 21:27:20] [INFO ] Transformed 2252 transitions.
[2023-03-13 21:27:20] [INFO ] Found NUPN structural information;
[2023-03-13 21:27:20] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 534 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-13 21:27:22] [INFO ] Computed 15 place invariants in 29 ms
[2023-03-13 21:27:24] [INFO ] After 812ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 21:27:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-13 21:27:26] [INFO ] After 1909ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2023-03-13 21:27:28] [INFO ] Deduced a trap composed of 35 places in 1883 ms of which 34 ms to minimize.
[2023-03-13 21:27:30] [INFO ] Deduced a trap composed of 35 places in 1595 ms of which 2 ms to minimize.
[2023-03-13 21:27:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3766 ms
[2023-03-13 21:27:31] [INFO ] Deduced a trap composed of 35 places in 1144 ms of which 2 ms to minimize.
[2023-03-13 21:27:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1221 ms
[2023-03-13 21:27:33] [INFO ] Deduced a trap composed of 16 places in 999 ms of which 1 ms to minimize.
[2023-03-13 21:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1180 ms
[2023-03-13 21:27:33] [INFO ] After 8573ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :4
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-13 21:27:33] [INFO ] After 9279ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :4
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 42 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 316 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.30 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 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 416 transition count 2084
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 208 rules applied. Total rules applied 369 place count 259 transition count 2033
Reduce places removed 29 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 33 rules applied. Total rules applied 402 place count 230 transition count 2029
Reduce places removed 4 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 6 rules applied. Total rules applied 408 place count 226 transition count 2027
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 409 place count 225 transition count 2027
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 409 place count 225 transition count 1997
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 469 place count 195 transition count 1997
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 506 place count 158 transition count 1960
Iterating global reduction 5 with 37 rules applied. Total rules applied 543 place count 158 transition count 1960
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Iterating post reduction 5 with 401 rules applied. Total rules applied 944 place count 158 transition count 1559
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 951 place count 151 transition count 1498
Iterating global reduction 6 with 7 rules applied. Total rules applied 958 place count 151 transition count 1498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 11 rules applied. Total rules applied 969 place count 151 transition count 1487
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 974 place count 146 transition count 1487
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 1030 place count 118 transition count 1459
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1050 place count 118 transition count 1439
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1070 place count 98 transition count 1439
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1071 place count 98 transition count 1438
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1081 place count 98 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1082 place count 97 transition count 1427
Iterating global reduction 9 with 1 rules applied. Total rules applied 1083 place count 97 transition count 1427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1084 place count 96 transition count 1426
Applied a total of 1084 rules in 725 ms. Remains 96 /425 variables (removed 329) and now considering 1426/2252 (removed 826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 96/425 places, 1426/2252 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1426 rows 96 cols
[2023-03-13 21:27:34] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-13 21:27:34] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 21:27:34] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:27:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 21:27:35] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:27:35] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:36] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-13 21:27:36] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 31 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 1426/1426 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 96 transition count 1424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 94 transition count 1424
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 92 transition count 1413
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 92 transition count 1413
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 92 transition count 1412
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 3 with 2 rules applied. Total rules applied 11 place count 91 transition count 1411
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 91 transition count 1408
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 27 place count 88 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 87 transition count 1397
Applied a total of 28 rules in 287 ms. Remains 87 /96 variables (removed 9) and now considering 1397/1426 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 87/96 places, 1397/1426 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 465795 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465795 steps, saw 69573 distinct states, run finished after 3007 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1397 rows 87 cols
[2023-03-13 21:27:39] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-13 21:27:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 21:27:39] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:27:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 21:27:40] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:27:40] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:40] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-13 21:27:40] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 31 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1397/1397 transitions.
Applied a total of 0 rules in 80 ms. Remains 87 /87 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 87/87 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1397/1397 transitions.
Applied a total of 0 rules in 60 ms. Remains 87 /87 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-13 21:27:41] [INFO ] Invariant cache hit.
[2023-03-13 21:27:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-13 21:27:41] [INFO ] Invariant cache hit.
[2023-03-13 21:27:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:27:41] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [82, 86]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 489 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/87 places, 1396/1397 transitions.
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 2 place count 84 transition count 1395
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 1394
Applied a total of 4 rules in 212 ms. Remains 83 /85 variables (removed 2) and now considering 1394/1396 (removed 2) transitions.
// Phase 1: matrix 1394 rows 83 cols
[2023-03-13 21:27:41] [INFO ] Computed 13 place invariants in 19 ms
[2023-03-13 21:27:41] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-13 21:27:41] [INFO ] Invariant cache hit.
[2023-03-13 21:27:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 21:27:42] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/87 places, 1394/1397 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1568 ms. Remains : 83/87 places, 1394/1397 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 538810 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538810 steps, saw 77571 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 21:27:45] [INFO ] Invariant cache hit.
[2023-03-13 21:27:46] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 21:27:46] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:27:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 21:27:46] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 21:27:46] [INFO ] After 85ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:47] [INFO ] Deduced a trap composed of 6 places in 646 ms of which 1 ms to minimize.
[2023-03-13 21:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 715 ms
[2023-03-13 21:27:47] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-13 21:27:47] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 31 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1394/1394 transitions.
Applied a total of 0 rules in 61 ms. Remains 83 /83 variables (removed 0) and now considering 1394/1394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 83/83 places, 1394/1394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1394/1394 transitions.
Applied a total of 0 rules in 58 ms. Remains 83 /83 variables (removed 0) and now considering 1394/1394 (removed 0) transitions.
[2023-03-13 21:27:47] [INFO ] Invariant cache hit.
[2023-03-13 21:27:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-13 21:27:48] [INFO ] Invariant cache hit.
[2023-03-13 21:27:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 21:27:48] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-03-13 21:27:48] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-13 21:27:48] [INFO ] Invariant cache hit.
[2023-03-13 21:27:49] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1646 ms. Remains : 83/83 places, 1394/1394 transitions.
Graph (complete) has 1090 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 1393
Applied a total of 2 rules in 64 ms. Remains 82 /83 variables (removed 1) and now considering 1393/1394 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 82 cols
[2023-03-13 21:27:49] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-13 21:27:49] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 21:27:49] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:27:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 21:27:50] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:51] [INFO ] Deduced a trap composed of 6 places in 1008 ms of which 0 ms to minimize.
[2023-03-13 21:27:53] [INFO ] Deduced a trap composed of 6 places in 1274 ms of which 27 ms to minimize.
[2023-03-13 21:27:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2372 ms
[2023-03-13 21:27:53] [INFO ] After 3177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 21:27:53] [INFO ] After 3357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:27:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-13 21:27:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 1394 transitions and 25147 arcs took 30 ms.
[2023-03-13 21:27:54] [INFO ] Flatten gal took : 441 ms
Total runtime 34576 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 10b
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: 83 places, 1394 transitions, 25147 arcs.
Final Score: 10337.393
Took : 119 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678742995237

--------------------
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 26644:
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-10b"
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-10b, 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-167813600600687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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