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.r523-tall-167987247800247.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 EisenbergMcGuire-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680811494963

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=EisenbergMcGuire-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:04:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 20:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:04:56] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-04-06 20:04:56] [INFO ] Transformed 414 places.
[2023-04-06 20:04:56] [INFO ] Transformed 1296 transitions.
[2023-04-06 20:04:56] [INFO ] Found NUPN structural information;
[2023-04-06 20:04:56] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 20:04:57] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 20:04:57] [INFO ] Computed 19 invariants in 25 ms
[2023-04-06 20:04:58] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-04-06 20:04:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 20:04:58] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:04:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-04-06 20:04:58] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 20:04:59] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-04-06 20:04:59] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:04:59] [INFO ] After 410ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-04-06 20:04:59] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 6 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 805 ms
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:05:00] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2023-04-06 20:05:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2023-04-06 20:05:02] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-04-06 20:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 20:05:02] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2023-04-06 20:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-04-06 20:05:02] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-04-06 20:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 20:05:02] [INFO ] After 3212ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-04-06 20:05:03] [INFO ] After 4533ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 71 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 1293
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 411 transition count 1293
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 6 place count 411 transition count 1191
Deduced a syphon composed of 102 places in 3 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 210 place count 309 transition count 1191
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 231 place count 288 transition count 1065
Iterating global reduction 2 with 21 rules applied. Total rules applied 252 place count 288 transition count 1065
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 306 place count 261 transition count 1038
Applied a total of 306 rules in 125 ms. Remains 261 /414 variables (removed 153) and now considering 1038/1296 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 261/414 places, 1038/1296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 20:05:03] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
// Phase 1: matrix 444 rows 261 cols
[2023-04-06 20:05:03] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 20:05:04] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:05:04] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:05:04] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 20:05:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:05:04] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:05:04] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 20:05:04] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 20:05:05] [INFO ] After 260ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-04-06 20:05:05] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 20:05:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-04-06 20:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 20:05:06] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-04-06 20:05:06] [INFO ] After 1994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 43 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 25 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 261/261 places, 1038/1038 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 400337 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{4=1}
Probabilistic random walk after 400337 steps, saw 147914 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-04-06 20:05:09] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 20:05:09] [INFO ] Invariant cache hit.
[2023-04-06 20:05:09] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:05:09] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:05:09] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 20:05:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:05:09] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:05:10] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:10] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 20:05:10] [INFO ] After 222ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:10] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-04-06 20:05:10] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 20:05:10] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2023-04-06 20:05:10] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1132 ms
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:05:11] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2023-04-06 20:05:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:05:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2023-04-06 20:05:12] [INFO ] After 1940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-04-06 20:05:12] [INFO ] After 2515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 23 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 261/261 places, 1038/1038 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 431242 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431242 steps, saw 158320 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-06 20:05:15] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 20:05:15] [INFO ] Invariant cache hit.
[2023-04-06 20:05:15] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 20:05:15] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:05:15] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 20:05:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:05:15] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-06 20:05:16] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:16] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 20:05:16] [INFO ] After 228ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:16] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:05:16] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 20:05:16] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-04-06 20:05:16] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1142 ms
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 3 ms to minimize.
[2023-04-06 20:05:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 20:05:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2023-04-06 20:05:18] [INFO ] After 1960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-04-06 20:05:18] [INFO ] After 2563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 18 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 22 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 261/261 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 21 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2023-04-06 20:05:18] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 20:05:18] [INFO ] Invariant cache hit.
[2023-04-06 20:05:18] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-04-06 20:05:18] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 20:05:18] [INFO ] Invariant cache hit.
[2023-04-06 20:05:18] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 20:05:19] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-04-06 20:05:19] [INFO ] Redundant transitions in 58 ms returned []
[2023-04-06 20:05:19] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 20:05:19] [INFO ] Invariant cache hit.
[2023-04-06 20:05:19] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1123 ms. Remains : 261/261 places, 1038/1038 transitions.
Graph (trivial) has 491 edges and 261 vertex of which 29 / 261 are part of one of the 6 SCC in 3 ms
Free SCC test removed 23 places
Drop transitions removed 80 transitions
Ensure Unique test removed 595 transitions
Reduce isomorphic transitions removed 675 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 238 transition count 338
Reduce places removed 25 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 213 transition count 333
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 208 transition count 333
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 61 place count 208 transition count 326
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 76 place count 200 transition count 326
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 148 place count 164 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 164 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 163 transition count 301
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 193 place count 163 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 163 transition count 260
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 195 place count 162 transition count 260
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 238 place count 162 transition count 217
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 281 place count 119 transition count 217
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 119 transition count 215
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 291 place count 119 transition count 215
Applied a total of 291 rules in 50 ms. Remains 119 /261 variables (removed 142) and now considering 215/1038 (removed 823) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 215 rows 119 cols
[2023-04-06 20:05:19] [INFO ] Computed 18 invariants in 1 ms
[2023-04-06 20:05:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 20:05:19] [INFO ] [Real]Absence check using 13 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 20:05:19] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 20:05:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 20:05:19] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 20:05:20] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 20:05:20] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2023-04-06 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-04-06 20:05:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-04-06 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-06 20:05:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-04-06 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-06 20:05:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-06 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-04-06 20:05:20] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-04-06 20:05:20] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-04-06 20:05:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-04-06 20:05:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 261 places, 1038 transitions and 5208 arcs took 6 ms.
[2023-04-06 20:05:20] [INFO ] Flatten gal took : 103 ms
Total runtime 24145 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 06
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: 261 places, 1038 transitions, 5208 arcs.
Final Score: 18275.181
Took : 56 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680811578291

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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 6526:
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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r523-tall-167987247800247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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