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

About the Execution of Smart+red for EisenbergMcGuire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6112.548 1800000.00 1878451.00 5400.60 [undef] Time out reached

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.r537-tall-167987255000153.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 StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000153
=====================================================================

--------------------
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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1680814635623

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 20:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:57:17] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-04-06 20:57:17] [INFO ] Transformed 414 places.
[2023-04-06 20:57:17] [INFO ] Transformed 1296 transitions.
[2023-04-06 20:57:17] [INFO ] Found NUPN structural information;
[2023-04-06 20:57:17] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 171 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 414) seen :295
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 119) seen :0
Running SMT prover for 119 properties.
[2023-04-06 20:57:17] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 20:57:17] [INFO ] Computed 19 invariants in 13 ms
[2023-04-06 20:57:19] [INFO ] After 1146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:119
[2023-04-06 20:57:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-04-06 20:57:19] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:57:23] [INFO ] After 2546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :119
[2023-04-06 20:57:23] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:57:26] [INFO ] After 3162ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :0 sat :119
[2023-04-06 20:57:26] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 5 ms to minimize.
[2023-04-06 20:57:26] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2023-04-06 20:57:26] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 0 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-06 20:57:27] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-04-06 20:57:28] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-04-06 20:57:28] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:57:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:57:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1857 ms
[2023-04-06 20:57:28] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:57:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:57:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-06 20:57:29] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 20:57:30] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 1 ms to minimize.
[2023-04-06 20:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-04-06 20:57:30] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2023-04-06 20:57:30] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 0 ms to minimize.
[2023-04-06 20:57:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2023-04-06 20:57:31] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-04-06 20:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 20:57:31] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2023-04-06 20:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-04-06 20:57:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:57:32] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 20:57:33] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-04-06 20:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-06 20:57:34] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-04-06 20:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 20:57:35] [INFO ] After 11745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :119
Attempting to minimize the solution found.
Minimization took 3208 ms.
[2023-04-06 20:57:38] [INFO ] After 19082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :119
Fused 119 Parikh solutions to 101 different solutions.
Parikh walk visited 1 properties in 6518 ms.
Support contains 118 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 12 place count 408 transition count 1206
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 180 place count 324 transition count 1206
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 210 place count 294 transition count 1026
Iterating global reduction 2 with 30 rules applied. Total rules applied 240 place count 294 transition count 1026
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 996
Applied a total of 300 rules in 150 ms. Remains 264 /414 variables (removed 150) and now considering 996/1296 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 264/414 places, 996/1296 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26510 ms. (steps per millisecond=37 ) properties (out of 118) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 113) 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 113) 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 113) 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 113) 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 113) 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 113) 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 113) 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 113) 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 113) 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 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 113) 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 113) 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 113) 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 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 113) 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 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 113) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 111) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) 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 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) 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 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 110) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 110) seen :0
Probabilistic random walk after 10000001 steps, saw 1607139 distinct states, run finished after 40797 ms. (steps per millisecond=245 ) properties seen :109
Running SMT prover for 1 properties.
[2023-04-06 20:58:55] [INFO ] Flow matrix only has 402 transitions (discarded 594 similar events)
// Phase 1: matrix 402 rows 264 cols
[2023-04-06 20:58:55] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 20:58:55] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:58:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:58:55] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:58:55] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:58:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:58:55] [INFO ] After 26ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:58:55] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-06 20:58:55] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 996/996 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 264 transition count 966
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 234 transition count 966
Applied a total of 60 rules in 57 ms. Remains 234 /264 variables (removed 30) and now considering 966/996 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 234/264 places, 966/996 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1697 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1878632 steps, run timeout after 6001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 1878632 steps, saw 390835 distinct states, run finished after 6002 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 20:59:04] [INFO ] Computed 19 invariants in 10 ms
[2023-04-06 20:59:04] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 20:59:04] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:04] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:04] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:04] [INFO ] After 32ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:04] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-06 20:59:04] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 29 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 20:59:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:04] [INFO ] Invariant cache hit.
[2023-04-06 20:59:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-04-06 20:59:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:04] [INFO ] Invariant cache hit.
[2023-04-06 20:59:04] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:05] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2023-04-06 20:59:05] [INFO ] Redundant transitions in 55 ms returned []
[2023-04-06 20:59:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:05] [INFO ] Invariant cache hit.
[2023-04-06 20:59:05] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1214 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=272 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:05] [INFO ] Invariant cache hit.
[2023-04-06 20:59:06] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-06 20:59:06] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:59:06] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 20:59:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:06] [INFO ] After 18ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-06 20:59:06] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:06] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 20:59:06] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 20:59:06] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:06] [INFO ] After 16ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-04-06 20:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-04-06 20:59:06] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 20:59:06] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1668 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1877862 steps, run timeout after 6001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 1877862 steps, saw 390682 distinct states, run finished after 6001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:14] [INFO ] Invariant cache hit.
[2023-04-06 20:59:14] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 20:59:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:14] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:14] [INFO ] After 29ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 20:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-04-06 20:59:14] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-06 20:59:14] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 24 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 20:59:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:14] [INFO ] Invariant cache hit.
[2023-04-06 20:59:14] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-06 20:59:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:14] [INFO ] Invariant cache hit.
[2023-04-06 20:59:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:15] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2023-04-06 20:59:15] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-06 20:59:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:15] [INFO ] Invariant cache hit.
[2023-04-06 20:59:15] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1117 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:16] [INFO ] Invariant cache hit.
[2023-04-06 20:59:16] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 20:59:16] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:16] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 20:59:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:16] [INFO ] After 18ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-06 20:59:16] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:16] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 20:59:16] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:16] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:16] [INFO ] After 23ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-06 20:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-04-06 20:59:16] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 20:59:16] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 940513 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940513 steps, saw 221970 distinct states, run finished after 3003 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:19] [INFO ] Invariant cache hit.
[2023-04-06 20:59:19] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 20:59:19] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:19] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:19] [INFO ] After 27ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2023-04-06 20:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-04-06 20:59:19] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-06 20:59:19] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 956214 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 956214 steps, saw 225355 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:59:22] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:22] [INFO ] Invariant cache hit.
[2023-04-06 20:59:22] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 20:59:22] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:22] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:23] [INFO ] After 27ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 20:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-04-06 20:59:23] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-06 20:59:23] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 20:59:23] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:23] [INFO ] Invariant cache hit.
[2023-04-06 20:59:23] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-04-06 20:59:23] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:23] [INFO ] Invariant cache hit.
[2023-04-06 20:59:23] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 20:59:23] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-04-06 20:59:24] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 20:59:24] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 20:59:24] [INFO ] Invariant cache hit.
[2023-04-06 20:59:24] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 880 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 204 transition count 235
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 157 transition count 235
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 157 transition count 222
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 138 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 275 place count 79 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 289 place count 72 transition count 152
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 295 place count 72 transition count 146
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 72 transition count 140
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 72 transition count 115
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 351 place count 47 transition count 115
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 361 place count 47 transition count 115
Applied a total of 361 rules in 29 ms. Remains 47 /234 variables (removed 187) and now considering 115/966 (removed 851) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 47 cols
[2023-04-06 20:59:24] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 20:59:24] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 20:59:24] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 20:59:24] [INFO ] After 29ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:24] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 20:59:24] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 880 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 204 transition count 235
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 157 transition count 235
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 157 transition count 222
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 138 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 275 place count 79 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 289 place count 72 transition count 152
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 295 place count 72 transition count 146
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 72 transition count 140
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 72 transition count 115
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 351 place count 47 transition count 115
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 361 place count 47 transition count 115
Applied a total of 361 rules in 23 ms. Remains 47 /234 variables (removed 187) and now considering 115/966 (removed 851) transitions.
Running SMT prover for 1 properties.
[2023-04-06 20:59:24] [INFO ] Invariant cache hit.
[2023-04-06 20:59:24] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:59:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 20:59:24] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 20:59:24] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:59:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:59:24] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Unable to solve all queries for examination StableMarking. Remains :1 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/StableMarking.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 127511 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 06
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 414 places, 1296 transitions, 5976 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 10063108 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16131624 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r537-tall-167987255000153"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;