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.r107-tall-167814484200423.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 79K 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 DES-PT-10b-ReachabilityFireability-00
FORMULA_NAME DES-PT-10b-ReachabilityFireability-01
FORMULA_NAME DES-PT-10b-ReachabilityFireability-02
FORMULA_NAME DES-PT-10b-ReachabilityFireability-03
FORMULA_NAME DES-PT-10b-ReachabilityFireability-04
FORMULA_NAME DES-PT-10b-ReachabilityFireability-05
FORMULA_NAME DES-PT-10b-ReachabilityFireability-06
FORMULA_NAME DES-PT-10b-ReachabilityFireability-07
FORMULA_NAME DES-PT-10b-ReachabilityFireability-08
FORMULA_NAME DES-PT-10b-ReachabilityFireability-09
FORMULA_NAME DES-PT-10b-ReachabilityFireability-10
FORMULA_NAME DES-PT-10b-ReachabilityFireability-11
FORMULA_NAME DES-PT-10b-ReachabilityFireability-12
FORMULA_NAME DES-PT-10b-ReachabilityFireability-13
FORMULA_NAME DES-PT-10b-ReachabilityFireability-14
FORMULA_NAME DES-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678368647182

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=DES-PT-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:30:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 13:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:30:49] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2023-03-09 13:30:49] [INFO ] Transformed 320 places.
[2023-03-09 13:30:49] [INFO ] Transformed 271 transitions.
[2023-03-09 13:30:49] [INFO ] Found NUPN structural information;
[2023-03-09 13:30:49] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 16) seen :12
FORMULA DES-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 13:30:49] [INFO ] Computed 65 place invariants in 18 ms
[2023-03-09 13:30:50] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:30:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 13:30:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-09 13:30:50] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 13:30:50] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
[2023-03-09 13:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 13:30:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-09 13:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 13:30:51] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-03-09 13:30:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2023-03-09 13:30:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-09 13:30:51] [INFO ] After 1234ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-09 13:30:51] [INFO ] After 1818ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA DES-PT-10b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 50 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 309 transition count 256
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 301 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 298 transition count 253
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 25 place count 298 transition count 246
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 39 place count 291 transition count 246
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 56 place count 274 transition count 229
Iterating global reduction 3 with 17 rules applied. Total rules applied 73 place count 274 transition count 229
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 86 place count 261 transition count 216
Iterating global reduction 3 with 13 rules applied. Total rules applied 99 place count 261 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 3 with 13 rules applied. Total rules applied 112 place count 261 transition count 203
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 115 place count 259 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 115 place count 259 transition count 201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 258 transition count 201
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 209 place count 212 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 211 transition count 154
Applied a total of 210 rules in 95 ms. Remains 211 /320 variables (removed 109) and now considering 154/271 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 211/320 places, 154/271 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
FORMULA DES-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 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 23 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 154 rows 211 cols
[2023-03-09 13:30:52] [INFO ] Computed 61 place invariants in 17 ms
[2023-03-09 13:30:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:30:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 13:30:52] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-09 13:30:52] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2023-03-09 13:30:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-09 13:30:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-09 13:30:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-09 13:30:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-09 13:30:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-09 13:30:52] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 13:30:52] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 23 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 154/154 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 211 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 209 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 204 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 203 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 203 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 202 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 202 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 145
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 52 place count 185 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 54 place count 184 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 182 transition count 126
Applied a total of 56 rules in 41 ms. Remains 182 /211 variables (removed 29) and now considering 126/154 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 182/211 places, 126/154 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1254889 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1254889 steps, saw 167450 distinct states, run finished after 3002 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 126 rows 182 cols
[2023-03-09 13:30:56] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 13:30:56] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:30:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:30:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 13:30:56] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:56] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-09 13:30:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-09 13:30:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-09 13:30:56] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 13:30:56] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-10b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 126/126 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 181 transition count 122
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 178 transition count 122
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 165 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 164 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 164 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 164 transition count 107
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 164 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 162 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 162 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 161 transition count 104
Applied a total of 43 rules in 29 ms. Remains 161 /182 variables (removed 21) and now considering 104/126 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 161/182 places, 104/126 transitions.
Incomplete random walk after 10000 steps, including 390 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2072217 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :{}
Probabilistic random walk after 2072217 steps, saw 278174 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 161 cols
[2023-03-09 13:30:59] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 13:30:59] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:30:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:30:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-09 13:30:59] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:30:59] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 13:30:59] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 161/161 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-09 13:30:59] [INFO ] Invariant cache hit.
[2023-03-09 13:30:59] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 13:30:59] [INFO ] Invariant cache hit.
[2023-03-09 13:31:00] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-09 13:31:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 13:31:00] [INFO ] Invariant cache hit.
[2023-03-09 13:31:00] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 161/161 places, 104/104 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 104
Applied a total of 1 rules in 18 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 161 cols
[2023-03-09 13:31:00] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 13:31:00] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:31:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 13:31:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-09 13:31:00] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:31:00] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 13:31:00] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:31:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-09 13:31:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 104 transitions and 521 arcs took 2 ms.
[2023-03-09 13:31:00] [INFO ] Flatten gal took : 38 ms
Total runtime 11946 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (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: 161 places, 104 transitions, 521 arcs.
Final Score: 1489.166
Took : 4 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678368666630

--------------------
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 804:
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="DES-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 DES-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 r107-tall-167814484200423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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