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

About the Execution of Smart+red for CANConstruction-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
611.796 140617.00 168454.00 156.20 TFFTTTTTTFTTFF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697100639.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANConstruction-PT-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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.4M 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 CANConstruction-PT-030-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678797596688

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=CANConstruction-PT-030
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:39:58] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-14 12:39:59] [INFO ] Transformed 2162 places.
[2023-03-14 12:39:59] [INFO ] Transformed 3840 transitions.
[2023-03-14 12:39:59] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 19 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 16) seen :10
FORMULA CANConstruction-PT-030-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-030-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-14 12:39:59] [INFO ] Computed 61 place invariants in 49 ms
[2023-03-14 12:40:01] [INFO ] [Real]Absence check using 31 positive place invariants in 219 ms returned sat
[2023-03-14 12:40:01] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 214 ms returned sat
[2023-03-14 12:40:01] [INFO ] After 1530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 12:40:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2023-03-14 12:40:02] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-14 12:40:04] [INFO ] After 2269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 12:40:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 12:40:06] [INFO ] After 1741ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 12:40:08] [INFO ] After 3908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1771 ms.
[2023-03-14 12:40:10] [INFO ] After 8812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 133 ms.
Support contains 165 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 2162 transition count 3703
Reduce places removed 137 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 146 rules applied. Total rules applied 283 place count 2025 transition count 3694
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 292 place count 2016 transition count 3694
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 292 place count 2016 transition count 3673
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 334 place count 1995 transition count 3673
Discarding 780 places :
Symmetric choice reduction at 3 with 780 rule applications. Total rules 1114 place count 1215 transition count 2113
Iterating global reduction 3 with 780 rules applied. Total rules applied 1894 place count 1215 transition count 2113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1904 place count 1210 transition count 2108
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1914 place count 1210 transition count 2098
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1924 place count 1200 transition count 2098
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 1955 place count 1200 transition count 2067
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 1986 place count 1169 transition count 2067
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 5 with 66 rules applied. Total rules applied 2052 place count 1169 transition count 2067
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 2069 place count 1169 transition count 2067
Applied a total of 2069 rules in 1011 ms. Remains 1169 /2162 variables (removed 993) and now considering 2067/3840 (removed 1773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 1169/2162 places, 2067/3840 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :1
FORMULA CANConstruction-PT-030-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2067 rows 1169 cols
[2023-03-14 12:40:12] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-14 12:40:12] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2023-03-14 12:40:12] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 12 ms returned sat
[2023-03-14 12:40:12] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:40:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-14 12:40:12] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-14 12:40:13] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:13] [INFO ] State equation strengthened by 1812 read => feed constraints.
[2023-03-14 12:40:14] [INFO ] After 894ms SMT Verify possible using 1812 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:15] [INFO ] After 1732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 606 ms.
[2023-03-14 12:40:15] [INFO ] After 3548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA CANConstruction-PT-030-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 24 ms.
Support contains 64 out of 1169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1169/1169 places, 2067/2067 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 1169 transition count 2065
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1167 transition count 2064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1166 transition count 2064
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 1166 transition count 2063
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 1165 transition count 2063
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 28 place count 1145 transition count 2023
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 1145 transition count 2023
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 94 place count 1122 transition count 2000
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 120 place count 1109 transition count 2005
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 1109 transition count 2004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 1108 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 1107 transition count 2002
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 1107 transition count 2002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 1107 transition count 2001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 1106 transition count 2001
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 132 place count 1106 transition count 2001
Applied a total of 132 rules in 977 ms. Remains 1106 /1169 variables (removed 63) and now considering 2001/2067 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 977 ms. Remains : 1106/1169 places, 2001/2067 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239185 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239185 steps, saw 68044 distinct states, run finished after 3006 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2001 rows 1106 cols
[2023-03-14 12:40:20] [INFO ] Computed 61 place invariants in 18 ms
[2023-03-14 12:40:20] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-14 12:40:20] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-14 12:40:20] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:40:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-14 12:40:20] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 12:40:21] [INFO ] After 637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:21] [INFO ] State equation strengthened by 1856 read => feed constraints.
[2023-03-14 12:40:21] [INFO ] After 311ms SMT Verify possible using 1856 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:21] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-14 12:40:21] [INFO ] After 1550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 64 out of 1106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 2001/2001 transitions.
Applied a total of 0 rules in 82 ms. Remains 1106 /1106 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1106/1106 places, 2001/2001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 2001/2001 transitions.
Applied a total of 0 rules in 47 ms. Remains 1106 /1106 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2023-03-14 12:40:22] [INFO ] Invariant cache hit.
[2023-03-14 12:40:22] [INFO ] Implicit Places using invariants in 825 ms returned [5, 11, 19, 25, 31, 37, 45, 51, 58, 66, 73, 79, 91, 99, 105, 111, 117, 123, 128, 133, 141, 146, 152, 158, 164, 169, 176, 182, 188]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 830 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1077/1106 places, 2001/2001 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1067 transition count 1991
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1067 transition count 1991
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 52 place count 1051 transition count 1975
Applied a total of 52 rules in 260 ms. Remains 1051 /1077 variables (removed 26) and now considering 1975/2001 (removed 26) transitions.
// Phase 1: matrix 1975 rows 1051 cols
[2023-03-14 12:40:23] [INFO ] Computed 32 place invariants in 26 ms
[2023-03-14 12:40:23] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-14 12:40:23] [INFO ] Invariant cache hit.
[2023-03-14 12:40:24] [INFO ] State equation strengthened by 1810 read => feed constraints.
[2023-03-14 12:40:29] [INFO ] Implicit Places using invariants and state equation in 5716 ms returned []
Implicit Place search using SMT with State Equation took 6280 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1051/1106 places, 1975/2001 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7420 ms. Remains : 1051/1106 places, 1975/2001 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234059 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 234059 steps, saw 67569 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 12:40:32] [INFO ] Invariant cache hit.
[2023-03-14 12:40:32] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-14 12:40:32] [INFO ] [Real]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 12:40:32] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:40:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-14 12:40:32] [INFO ] [Nat]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 12:40:33] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:33] [INFO ] State equation strengthened by 1810 read => feed constraints.
[2023-03-14 12:40:33] [INFO ] After 394ms SMT Verify possible using 1810 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:34] [INFO ] After 701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-14 12:40:34] [INFO ] After 1777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 64 out of 1051 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1051/1051 places, 1975/1975 transitions.
Applied a total of 0 rules in 192 ms. Remains 1051 /1051 variables (removed 0) and now considering 1975/1975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 1051/1051 places, 1975/1975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1051/1051 places, 1975/1975 transitions.
Applied a total of 0 rules in 131 ms. Remains 1051 /1051 variables (removed 0) and now considering 1975/1975 (removed 0) transitions.
[2023-03-14 12:40:34] [INFO ] Invariant cache hit.
[2023-03-14 12:40:35] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-14 12:40:35] [INFO ] Invariant cache hit.
[2023-03-14 12:40:35] [INFO ] State equation strengthened by 1810 read => feed constraints.
[2023-03-14 12:40:41] [INFO ] Implicit Places using invariants and state equation in 5957 ms returned []
Implicit Place search using SMT with State Equation took 6523 ms to find 0 implicit places.
[2023-03-14 12:40:41] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-14 12:40:41] [INFO ] Invariant cache hit.
[2023-03-14 12:40:42] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7695 ms. Remains : 1051/1051 places, 1975/1975 transitions.
Graph (trivial) has 1556 edges and 1051 vertex of which 571 / 1051 are part of one of the 19 SCC in 4 ms
Free SCC test removed 552 places
Drop transitions removed 1085 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 1098 transitions.
Graph (complete) has 994 edges and 499 vertex of which 486 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 486 transition count 796
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Performed 216 Post agglomeration using F-continuation condition.Transition count delta: 216
Iterating post reduction 1 with 375 rules applied. Total rules applied 458 place count 405 transition count 502
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 2 with 424 rules applied. Total rules applied 882 place count 189 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 882 place count 189 transition count 293
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 884 place count 188 transition count 293
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 897 place count 175 transition count 277
Iterating global reduction 3 with 13 rules applied. Total rules applied 910 place count 175 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 913 place count 175 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 915 place count 173 transition count 270
Iterating global reduction 4 with 2 rules applied. Total rules applied 917 place count 173 transition count 270
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 918 place count 172 transition count 268
Iterating global reduction 4 with 1 rules applied. Total rules applied 919 place count 172 transition count 268
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 933 place count 165 transition count 261
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 966 place count 165 transition count 228
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 4 with 2 rules applied. Total rules applied 968 place count 164 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 969 place count 163 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 970 place count 163 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 986 place count 155 transition count 231
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 995 place count 155 transition count 222
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1004 place count 146 transition count 222
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1006 place count 146 transition count 220
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 1036 place count 146 transition count 220
Applied a total of 1036 rules in 72 ms. Remains 146 /1051 variables (removed 905) and now considering 220/1975 (removed 1755) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 146 cols
[2023-03-14 12:40:42] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-14 12:40:42] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-14 12:40:42] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:40:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-14 12:40:42] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:42] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-14 12:40:42] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:40:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-14 12:40:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1051 places, 1975 transitions and 7685 arcs took 13 ms.
[2023-03-14 12:40:43] [INFO ] Flatten gal took : 144 ms
Total runtime 44449 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 030
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: 1051 places, 1975 transitions, 7685 arcs.
Final Score: 156562.24
Took : 93 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678797737305

--------------------
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 10748:
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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r043-tajo-167813697100639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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