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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 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 3.1M 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-10-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680818463904

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-10
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 22:01:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:01:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:01:06] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2023-04-06 22:01:06] [INFO ] Transformed 1090 places.
[2023-04-06 22:01:06] [INFO ] Transformed 5200 transitions.
[2023-04-06 22:01:06] [INFO ] Found NUPN structural information;
[2023-04-06 22:01:06] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 16) seen :3
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2023-04-06 22:01:07] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-06 22:01:07] [INFO ] Computed 31 invariants in 33 ms
[2023-04-06 22:01:07] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 22:01:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-04-06 22:01:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:01:10] [INFO ] After 1762ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-04-06 22:01:10] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-06 22:01:12] [INFO ] After 1775ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2023-04-06 22:01:13] [INFO ] Deduced a trap composed of 3 places in 572 ms of which 78 ms to minimize.
[2023-04-06 22:01:13] [INFO ] Deduced a trap composed of 3 places in 533 ms of which 1 ms to minimize.
[2023-04-06 22:01:14] [INFO ] Deduced a trap composed of 3 places in 438 ms of which 1 ms to minimize.
[2023-04-06 22:01:14] [INFO ] Deduced a trap composed of 50 places in 375 ms of which 1 ms to minimize.
[2023-04-06 22:01:15] [INFO ] Deduced a trap composed of 57 places in 379 ms of which 1 ms to minimize.
[2023-04-06 22:01:15] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 1 ms to minimize.
[2023-04-06 22:01:15] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 0 ms to minimize.
[2023-04-06 22:01:16] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-04-06 22:01:16] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 1 ms to minimize.
[2023-04-06 22:01:16] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-04-06 22:01:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4477 ms
[2023-04-06 22:01:17] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 1 ms to minimize.
[2023-04-06 22:01:17] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 0 ms to minimize.
[2023-04-06 22:01:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 630 ms
[2023-04-06 22:01:18] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2023-04-06 22:01:18] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 0 ms to minimize.
[2023-04-06 22:01:18] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2023-04-06 22:01:18] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-04-06 22:01:18] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:01:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1346 ms
[2023-04-06 22:01:19] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 1 ms to minimize.
[2023-04-06 22:01:20] [INFO ] Deduced a trap composed of 3 places in 552 ms of which 1 ms to minimize.
[2023-04-06 22:01:20] [INFO ] Deduced a trap composed of 3 places in 540 ms of which 1 ms to minimize.
[2023-04-06 22:01:21] [INFO ] Deduced a trap composed of 266 places in 554 ms of which 0 ms to minimize.
[2023-04-06 22:01:22] [INFO ] Deduced a trap composed of 34 places in 563 ms of which 1 ms to minimize.
[2023-04-06 22:01:22] [INFO ] Deduced a trap composed of 90 places in 513 ms of which 1 ms to minimize.
[2023-04-06 22:01:23] [INFO ] Deduced a trap composed of 73 places in 532 ms of which 1 ms to minimize.
[2023-04-06 22:01:23] [INFO ] Deduced a trap composed of 56 places in 486 ms of which 2 ms to minimize.
[2023-04-06 22:01:24] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 1 ms to minimize.
[2023-04-06 22:01:24] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 0 ms to minimize.
[2023-04-06 22:01:24] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2023-04-06 22:01:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5656 ms
[2023-04-06 22:01:25] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2023-04-06 22:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-04-06 22:01:26] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 2 ms to minimize.
[2023-04-06 22:01:26] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 1 ms to minimize.
[2023-04-06 22:01:27] [INFO ] Deduced a trap composed of 67 places in 439 ms of which 3 ms to minimize.
[2023-04-06 22:01:27] [INFO ] Deduced a trap composed of 214 places in 423 ms of which 0 ms to minimize.
[2023-04-06 22:01:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2336 ms
[2023-04-06 22:01:28] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 1 ms to minimize.
[2023-04-06 22:01:28] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2023-04-06 22:01:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2023-04-06 22:01:29] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-06 22:01:29] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2023-04-06 22:01:29] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 0 ms to minimize.
[2023-04-06 22:01:29] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 0 ms to minimize.
[2023-04-06 22:01:30] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 1 ms to minimize.
[2023-04-06 22:01:30] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2023-04-06 22:01:30] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 1 ms to minimize.
[2023-04-06 22:01:30] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 0 ms to minimize.
[2023-04-06 22:01:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2030 ms
[2023-04-06 22:01:31] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2023-04-06 22:01:31] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-04-06 22:01:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-04-06 22:01:32] [INFO ] After 21547ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 964 ms.
[2023-04-06 22:01:33] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 439 ms.
Support contains 91 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 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 8 rules applied. Total rules applied 8 place count 1090 transition count 5192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1082 transition count 5192
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 16 place count 1082 transition count 4898
Deduced a syphon composed of 294 places in 6 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 604 place count 788 transition count 4898
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 685 place count 707 transition count 4088
Iterating global reduction 2 with 81 rules applied. Total rules applied 766 place count 707 transition count 4088
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 9 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 942 place count 619 transition count 4000
Applied a total of 942 rules in 561 ms. Remains 619 /1090 variables (removed 471) and now considering 4000/5200 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 619/1090 places, 4000/5200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 181544 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{1=1, 5=1}
Probabilistic random walk after 181544 steps, saw 128567 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :2
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
[2023-04-06 22:01:37] [INFO ] Flow matrix only has 1130 transitions (discarded 2870 similar events)
// Phase 1: matrix 1130 rows 619 cols
[2023-04-06 22:01:37] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:01:37] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 22:01:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-06 22:01:37] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:01:38] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 22:01:38] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-06 22:01:39] [INFO ] After 899ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 22:01:40] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 0 ms to minimize.
[2023-04-06 22:01:40] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 0 ms to minimize.
[2023-04-06 22:01:41] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 0 ms to minimize.
[2023-04-06 22:01:41] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-06 22:01:41] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-04-06 22:01:41] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2023-04-06 22:01:42] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 0 ms to minimize.
[2023-04-06 22:01:42] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 0 ms to minimize.
[2023-04-06 22:01:42] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2023-04-06 22:01:42] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-06 22:01:42] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3316 ms
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-04-06 22:01:43] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:01:44] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-04-06 22:01:44] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-04-06 22:01:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1061 ms
[2023-04-06 22:01:44] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2023-04-06 22:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-06 22:01:44] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 22:01:44] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2023-04-06 22:01:45] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2023-04-06 22:01:45] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2023-04-06 22:01:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 650 ms
[2023-04-06 22:01:45] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 0 ms to minimize.
[2023-04-06 22:01:46] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2023-04-06 22:01:46] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 0 ms to minimize.
[2023-04-06 22:01:46] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 1 ms to minimize.
[2023-04-06 22:01:46] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-04-06 22:01:46] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2023-04-06 22:01:47] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-04-06 22:01:47] [INFO ] Deduced a trap composed of 109 places in 278 ms of which 0 ms to minimize.
[2023-04-06 22:01:47] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:01:47] [INFO ] Deduced a trap composed of 95 places in 238 ms of which 1 ms to minimize.
[2023-04-06 22:01:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2364 ms
[2023-04-06 22:01:48] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2023-04-06 22:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-04-06 22:01:48] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 1 ms to minimize.
[2023-04-06 22:01:48] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2023-04-06 22:01:48] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-04-06 22:01:49] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2023-04-06 22:01:49] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2023-04-06 22:01:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 971 ms
[2023-04-06 22:01:49] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2023-04-06 22:01:49] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2023-04-06 22:01:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2023-04-06 22:01:49] [INFO ] After 10907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1264 ms.
[2023-04-06 22:01:51] [INFO ] After 13303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 114 ms.
Support contains 89 out of 619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 619/619 places, 4000/4000 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 619 transition count 3998
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 617 transition count 3998
Applied a total of 4 rules in 204 ms. Remains 617 /619 variables (removed 2) and now considering 3998/4000 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 617/619 places, 3998/4000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 197175 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197175 steps, saw 140558 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-06 22:01:54] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
// Phase 1: matrix 1128 rows 617 cols
[2023-04-06 22:01:54] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:01:55] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 22:01:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-06 22:01:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-06 22:01:56] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 22:01:56] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-06 22:01:57] [INFO ] After 879ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 22:01:57] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 0 ms to minimize.
[2023-04-06 22:01:57] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 0 ms to minimize.
[2023-04-06 22:01:58] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 0 ms to minimize.
[2023-04-06 22:01:58] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2023-04-06 22:01:58] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 1 ms to minimize.
[2023-04-06 22:01:59] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-04-06 22:01:59] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 1 ms to minimize.
[2023-04-06 22:01:59] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2023-04-06 22:01:59] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-06 22:01:59] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 1 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2023-04-06 22:02:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3648 ms
[2023-04-06 22:02:00] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-04-06 22:02:01] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-04-06 22:02:01] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 22:02:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-04-06 22:02:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 623 ms
[2023-04-06 22:02:01] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 0 ms to minimize.
[2023-04-06 22:02:01] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 1 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1259 ms
[2023-04-06 22:02:02] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:02:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-06 22:02:03] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 1 ms to minimize.
[2023-04-06 22:02:03] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 0 ms to minimize.
[2023-04-06 22:02:04] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 1 ms to minimize.
[2023-04-06 22:02:04] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 1 ms to minimize.
[2023-04-06 22:02:04] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 1 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Deduced a trap composed of 131 places in 251 ms of which 0 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 0 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2504 ms
[2023-04-06 22:02:05] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2023-04-06 22:02:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-06 22:02:06] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2023-04-06 22:02:06] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 1 ms to minimize.
[2023-04-06 22:02:06] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:02:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 578 ms
[2023-04-06 22:02:07] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 0 ms to minimize.
[2023-04-06 22:02:07] [INFO ] Deduced a trap composed of 45 places in 342 ms of which 0 ms to minimize.
[2023-04-06 22:02:07] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2023-04-06 22:02:08] [INFO ] Deduced a trap composed of 111 places in 311 ms of which 1 ms to minimize.
[2023-04-06 22:02:08] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-04-06 22:02:08] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 1 ms to minimize.
[2023-04-06 22:02:09] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2023-04-06 22:02:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2364 ms
[2023-04-06 22:02:09] [INFO ] After 12997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 847 ms.
[2023-04-06 22:02:10] [INFO ] After 14881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 87 ms.
Support contains 89 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3998/3998 transitions.
Applied a total of 0 rules in 144 ms. Remains 617 /617 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 617/617 places, 3998/3998 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3998/3998 transitions.
Applied a total of 0 rules in 137 ms. Remains 617 /617 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
[2023-04-06 22:02:10] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-06 22:02:10] [INFO ] Invariant cache hit.
[2023-04-06 22:02:10] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-04-06 22:02:10] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-06 22:02:10] [INFO ] Invariant cache hit.
[2023-04-06 22:02:11] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-06 22:02:13] [INFO ] Implicit Places using invariants and state equation in 2983 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
[2023-04-06 22:02:14] [INFO ] Redundant transitions in 253 ms returned []
[2023-04-06 22:02:14] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-06 22:02:14] [INFO ] Invariant cache hit.
[2023-04-06 22:02:15] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5113 ms. Remains : 617/617 places, 3998/3998 transitions.
Graph (trivial) has 2855 edges and 617 vertex of which 96 / 617 are part of one of the 10 SCC in 4 ms
Free SCC test removed 86 places
Drop transitions removed 318 transitions
Ensure Unique test removed 2870 transitions
Reduce isomorphic transitions removed 3188 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 531 transition count 725
Reduce places removed 85 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 446 transition count 717
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 187 place count 438 transition count 717
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 187 place count 438 transition count 703
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 218 place count 421 transition count 703
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 506 place count 277 transition count 559
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 554 place count 277 transition count 511
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 562 place count 273 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 565 place count 273 transition count 537
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 599 place count 273 transition count 503
Free-agglomeration rule applied 106 times.
Iterating global reduction 5 with 106 rules applied. Total rules applied 705 place count 273 transition count 397
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 5 with 106 rules applied. Total rules applied 811 place count 167 transition count 397
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 821 place count 167 transition count 397
Applied a total of 821 rules in 84 ms. Remains 167 /617 variables (removed 450) and now considering 397/3998 (removed 3601) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 397 rows 167 cols
[2023-04-06 22:02:15] [INFO ] Computed 28 invariants in 10 ms
[2023-04-06 22:02:15] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 22:02:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-06 22:02:15] [INFO ] [Nat]Absence check using 21 positive and 7 generalized place invariants in 1 ms returned sat
[2023-04-06 22:02:15] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 270 ms
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-04-06 22:02:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-04-06 22:02:16] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-04-06 22:02:16] [INFO ] After 1316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-06 22:02:16] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-04-06 22:02:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 617 places, 3998 transitions and 21376 arcs took 24 ms.
[2023-04-06 22:02:17] [INFO ] Flatten gal took : 267 ms
Total runtime 71753 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 10
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: 617 places, 3998 transitions, 21376 arcs.
Final Score: 168589.688
Took : 60 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680818598869

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

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