About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1187.747 | 1800000.00 | 2555168.00 | 2466.00 | [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/mcc2022-input.r085-tall-165260115500128.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-tall-165260115500128
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 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 1652702184663
Running Version 202205111006
[2022-05-16 11:56:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 11:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:56:26] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-05-16 11:56:26] [INFO ] Transformed 1064 places.
[2022-05-16 11:56:26] [INFO ] Transformed 998 transitions.
[2022-05-16 11:56:26] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 237 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 1176 ms. (steps per millisecond=8 ) properties (out of 1053) seen :44
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 1793 ms. (steps per millisecond=16 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
[2022-05-16 11:56:29] [INFO ] Invariants computation overflowed in 134 ms
[2022-05-16 11:56:54] [INFO ] After 24737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:918
[2022-05-16 11:57:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 11:57:19] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:918
Fused 918 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 918 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1064 transition count 968
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1034 transition count 968
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 1034 transition count 963
Deduced a syphon composed of 5 places in 16 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 1029 transition count 963
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 999 transition count 933
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 45 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 994 transition count 933
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 994 transition count 927
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 988 transition count 927
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 988 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 987 transition count 926
Applied a total of 164 rules in 342 ms. Remains 987 /1064 variables (removed 77) and now considering 926/998 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 987/1064 places, 926/998 transitions.
Interrupted random walk after 327396 steps, including 41985 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 63826 ms. (steps per millisecond=15 ) properties seen :51
Running SMT prover for 867 properties.
// Phase 1: matrix 926 rows 987 cols
[2022-05-16 11:58:57] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-16 11:59:19] [INFO ] After 21590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2022-05-16 12:00:40] [INFO ] After 55996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2022-05-16 12:00:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 12:01:33] [INFO ] After 52539ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2022-05-16 12:01:33] [INFO ] Deduced a trap composed of 391 places in 307 ms of which 4 ms to minimize.
[2022-05-16 12:01:34] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 2 ms to minimize.
[2022-05-16 12:01:35] [INFO ] Deduced a trap composed of 397 places in 830 ms of which 2 ms to minimize.
[2022-05-16 12:01:35] [INFO ] Deduced a trap composed of 119 places in 413 ms of which 2 ms to minimize.
[2022-05-16 12:01:35] [INFO ] Deduced a trap composed of 186 places in 346 ms of which 1 ms to minimize.
[2022-05-16 12:01:36] [INFO ] Deduced a trap composed of 185 places in 556 ms of which 0 ms to minimize.
[2022-05-16 12:01:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3102 ms
[2022-05-16 12:01:38] [INFO ] Deduced a trap composed of 406 places in 314 ms of which 1 ms to minimize.
[2022-05-16 12:01:38] [INFO ] Deduced a trap composed of 380 places in 294 ms of which 1 ms to minimize.
[2022-05-16 12:01:39] [INFO ] Deduced a trap composed of 381 places in 302 ms of which 1 ms to minimize.
[2022-05-16 12:01:39] [INFO ] Deduced a trap composed of 95 places in 305 ms of which 1 ms to minimize.
[2022-05-16 12:01:39] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 1 ms to minimize.
[2022-05-16 12:01:40] [INFO ] Deduced a trap composed of 387 places in 287 ms of which 1 ms to minimize.
[2022-05-16 12:01:40] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 1 ms to minimize.
[2022-05-16 12:01:40] [INFO ] Deduced a trap composed of 319 places in 294 ms of which 0 ms to minimize.
[2022-05-16 12:01:41] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 1 ms to minimize.
[2022-05-16 12:01:41] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 1 ms to minimize.
[2022-05-16 12:01:41] [INFO ] Deduced a trap composed of 85 places in 296 ms of which 1 ms to minimize.
[2022-05-16 12:01:42] [INFO ] Deduced a trap composed of 399 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:01:42] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 0 ms to minimize.
[2022-05-16 12:01:42] [INFO ] Deduced a trap composed of 380 places in 287 ms of which 0 ms to minimize.
[2022-05-16 12:01:43] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 1 ms to minimize.
[2022-05-16 12:01:43] [INFO ] Deduced a trap composed of 402 places in 304 ms of which 2 ms to minimize.
[2022-05-16 12:01:43] [INFO ] Deduced a trap composed of 397 places in 295 ms of which 1 ms to minimize.
[2022-05-16 12:01:44] [INFO ] Deduced a trap composed of 392 places in 285 ms of which 1 ms to minimize.
[2022-05-16 12:01:44] [INFO ] Deduced a trap composed of 404 places in 315 ms of which 1 ms to minimize.
[2022-05-16 12:01:44] [INFO ] Deduced a trap composed of 400 places in 294 ms of which 1 ms to minimize.
[2022-05-16 12:01:45] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 1 ms to minimize.
[2022-05-16 12:01:45] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7453 ms
[2022-05-16 12:01:45] [INFO ] Deduced a trap composed of 217 places in 141 ms of which 1 ms to minimize.
[2022-05-16 12:01:46] [INFO ] Deduced a trap composed of 211 places in 150 ms of which 0 ms to minimize.
[2022-05-16 12:01:46] [INFO ] Deduced a trap composed of 203 places in 163 ms of which 1 ms to minimize.
[2022-05-16 12:01:46] [INFO ] Deduced a trap composed of 205 places in 151 ms of which 0 ms to minimize.
[2022-05-16 12:01:46] [INFO ] Deduced a trap composed of 191 places in 137 ms of which 0 ms to minimize.
[2022-05-16 12:01:46] [INFO ] Deduced a trap composed of 193 places in 158 ms of which 1 ms to minimize.
[2022-05-16 12:01:47] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 1 ms to minimize.
[2022-05-16 12:01:47] [INFO ] Deduced a trap composed of 210 places in 143 ms of which 2 ms to minimize.
[2022-05-16 12:01:47] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 1 ms to minimize.
[2022-05-16 12:01:47] [INFO ] Deduced a trap composed of 189 places in 199 ms of which 1 ms to minimize.
[2022-05-16 12:01:48] [INFO ] Deduced a trap composed of 157 places in 169 ms of which 1 ms to minimize.
[2022-05-16 12:01:48] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 1 ms to minimize.
[2022-05-16 12:01:48] [INFO ] Deduced a trap composed of 222 places in 176 ms of which 1 ms to minimize.
[2022-05-16 12:01:48] [INFO ] Deduced a trap composed of 181 places in 163 ms of which 0 ms to minimize.
[2022-05-16 12:01:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3106 ms
[2022-05-16 12:01:49] [INFO ] Deduced a trap composed of 214 places in 186 ms of which 0 ms to minimize.
[2022-05-16 12:01:49] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 0 ms to minimize.
[2022-05-16 12:01:50] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2022-05-16 12:01:50] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 0 ms to minimize.
[2022-05-16 12:01:50] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 1 ms to minimize.
[2022-05-16 12:01:51] [INFO ] Deduced a trap composed of 107 places in 237 ms of which 1 ms to minimize.
[2022-05-16 12:01:51] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2022-05-16 12:01:51] [INFO ] Deduced a trap composed of 73 places in 239 ms of which 0 ms to minimize.
[2022-05-16 12:01:51] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 0 ms to minimize.
[2022-05-16 12:01:52] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 1 ms to minimize.
[2022-05-16 12:01:52] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 0 ms to minimize.
[2022-05-16 12:01:52] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 1 ms to minimize.
[2022-05-16 12:01:53] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:01:53] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 2 ms to minimize.
[2022-05-16 12:01:54] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 9 ms to minimize.
[2022-05-16 12:01:54] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2022-05-16 12:01:54] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 1 ms to minimize.
[2022-05-16 12:01:55] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 1 ms to minimize.
[2022-05-16 12:01:55] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 1 ms to minimize.
[2022-05-16 12:01:55] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 1 ms to minimize.
[2022-05-16 12:01:56] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 0 ms to minimize.
[2022-05-16 12:01:56] [INFO ] Deduced a trap composed of 131 places in 203 ms of which 1 ms to minimize.
[2022-05-16 12:01:56] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 1 ms to minimize.
[2022-05-16 12:01:57] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 1 ms to minimize.
[2022-05-16 12:01:58] [INFO ] Deduced a trap composed of 77 places in 226 ms of which 2 ms to minimize.
[2022-05-16 12:02:00] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 2 ms to minimize.
[2022-05-16 12:02:02] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 1 ms to minimize.
[2022-05-16 12:02:05] [INFO ] Deduced a trap composed of 114 places in 192 ms of which 0 ms to minimize.
[2022-05-16 12:02:05] [INFO ] Deduced a trap composed of 102 places in 216 ms of which 0 ms to minimize.
[2022-05-16 12:02:07] [INFO ] Deduced a trap composed of 181 places in 156 ms of which 1 ms to minimize.
[2022-05-16 12:02:09] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 1 ms to minimize.
[2022-05-16 12:02:09] [INFO ] Deduced a trap composed of 184 places in 206 ms of which 1 ms to minimize.
[2022-05-16 12:02:10] [INFO ] Deduced a trap composed of 126 places in 172 ms of which 1 ms to minimize.
[2022-05-16 12:02:10] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 1 ms to minimize.
[2022-05-16 12:02:11] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 1 ms to minimize.
[2022-05-16 12:02:11] [INFO ] Deduced a trap composed of 224 places in 165 ms of which 0 ms to minimize.
[2022-05-16 12:02:12] [INFO ] Deduced a trap composed of 196 places in 187 ms of which 0 ms to minimize.
[2022-05-16 12:02:12] [INFO ] Deduced a trap composed of 186 places in 161 ms of which 0 ms to minimize.
[2022-05-16 12:02:12] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 0 ms to minimize.
[2022-05-16 12:02:13] [INFO ] Deduced a trap composed of 209 places in 154 ms of which 1 ms to minimize.
[2022-05-16 12:02:20] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2022-05-16 12:02:20] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 1 ms to minimize.
[2022-05-16 12:02:21] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 0 ms to minimize.
[2022-05-16 12:02:30] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2022-05-16 12:02:30] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2022-05-16 12:02:30] [INFO ] Deduced a trap composed of 209 places in 204 ms of which 1 ms to minimize.
[2022-05-16 12:02:31] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 1 ms to minimize.
[2022-05-16 12:02:36] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 1 ms to minimize.
[2022-05-16 12:02:36] [INFO ] Deduced a trap composed of 78 places in 286 ms of which 0 ms to minimize.
[2022-05-16 12:02:36] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 0 ms to minimize.
[2022-05-16 12:02:36] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 47675 ms
[2022-05-16 12:02:45] [INFO ] Deduced a trap composed of 385 places in 285 ms of which 0 ms to minimize.
[2022-05-16 12:02:45] [INFO ] Deduced a trap composed of 391 places in 278 ms of which 1 ms to minimize.
[2022-05-16 12:02:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 769 ms
[2022-05-16 12:02:56] [INFO ] Deduced a trap composed of 348 places in 355 ms of which 1 ms to minimize.
[2022-05-16 12:02:56] [INFO ] Deduced a trap composed of 351 places in 332 ms of which 0 ms to minimize.
[2022-05-16 12:02:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 865 ms
[2022-05-16 12:02:58] [INFO ] Deduced a trap composed of 375 places in 323 ms of which 1 ms to minimize.
[2022-05-16 12:02:58] [INFO ] Deduced a trap composed of 360 places in 297 ms of which 1 ms to minimize.
[2022-05-16 12:02:58] [INFO ] Deduced a trap composed of 373 places in 328 ms of which 0 ms to minimize.
[2022-05-16 12:02:59] [INFO ] Deduced a trap composed of 339 places in 322 ms of which 0 ms to minimize.
[2022-05-16 12:02:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1513 ms
[2022-05-16 12:03:00] [INFO ] Deduced a trap composed of 307 places in 273 ms of which 0 ms to minimize.
[2022-05-16 12:03:00] [INFO ] Deduced a trap composed of 327 places in 338 ms of which 0 ms to minimize.
[2022-05-16 12:03:00] [INFO ] Deduced a trap composed of 344 places in 267 ms of which 0 ms to minimize.
[2022-05-16 12:03:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1082 ms
[2022-05-16 12:03:01] [INFO ] Deduced a trap composed of 326 places in 286 ms of which 1 ms to minimize.
[2022-05-16 12:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2022-05-16 12:03:03] [INFO ] Deduced a trap composed of 348 places in 284 ms of which 1 ms to minimize.
[2022-05-16 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2022-05-16 12:03:04] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 1 ms to minimize.
[2022-05-16 12:03:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 12:03:04] [INFO ] After 225344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 831 different solutions.
Parikh walk visited 0 properties in 30026 ms.
Support contains 867 out of 987 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 987/987 places, 926/926 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 987 transition count 915
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 976 transition count 915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 976 transition count 913
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 974 transition count 913
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 11 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 965 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 963 transition count 904
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 963 transition count 900
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 959 transition count 900
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 959 transition count 900
Applied a total of 60 rules in 162 ms. Remains 959 /987 variables (removed 28) and now considering 900/926 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 959/987 places, 900/926 transitions.
Interrupted random walk after 336306 steps, including 43102 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 60569 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2022-05-16 12:05:07] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-16 12:05:27] [INFO ] After 19767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2022-05-16 12:07:03] [INFO ] After 71228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2022-05-16 12:07:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:08:17] [INFO ] After 74596ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2022-05-16 12:08:18] [INFO ] Deduced a trap composed of 372 places in 285 ms of which 0 ms to minimize.
[2022-05-16 12:08:18] [INFO ] Deduced a trap composed of 389 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:08:18] [INFO ] Deduced a trap composed of 392 places in 284 ms of which 1 ms to minimize.
[2022-05-16 12:08:19] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 1 ms to minimize.
[2022-05-16 12:08:19] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 1 ms to minimize.
[2022-05-16 12:08:19] [INFO ] Deduced a trap composed of 148 places in 156 ms of which 0 ms to minimize.
[2022-05-16 12:08:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1643 ms
[2022-05-16 12:08:20] [INFO ] Deduced a trap composed of 190 places in 133 ms of which 1 ms to minimize.
[2022-05-16 12:08:20] [INFO ] Deduced a trap composed of 209 places in 212 ms of which 0 ms to minimize.
[2022-05-16 12:08:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
[2022-05-16 12:08:23] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2022-05-16 12:08:23] [INFO ] Deduced a trap composed of 205 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:08:23] [INFO ] Deduced a trap composed of 196 places in 136 ms of which 0 ms to minimize.
[2022-05-16 12:08:24] [INFO ] Deduced a trap composed of 182 places in 151 ms of which 0 ms to minimize.
[2022-05-16 12:08:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 953 ms
[2022-05-16 12:08:24] [INFO ] Deduced a trap composed of 184 places in 146 ms of which 1 ms to minimize.
[2022-05-16 12:08:24] [INFO ] Deduced a trap composed of 183 places in 162 ms of which 0 ms to minimize.
[2022-05-16 12:08:24] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 0 ms to minimize.
[2022-05-16 12:08:25] [INFO ] Deduced a trap composed of 181 places in 149 ms of which 0 ms to minimize.
[2022-05-16 12:08:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 906 ms
[2022-05-16 12:08:25] [INFO ] Deduced a trap composed of 208 places in 145 ms of which 0 ms to minimize.
[2022-05-16 12:08:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-05-16 12:08:26] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 1 ms to minimize.
[2022-05-16 12:08:26] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2022-05-16 12:08:27] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 1 ms to minimize.
[2022-05-16 12:08:27] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 0 ms to minimize.
[2022-05-16 12:08:27] [INFO ] Deduced a trap composed of 124 places in 198 ms of which 0 ms to minimize.
[2022-05-16 12:08:28] [INFO ] Deduced a trap composed of 212 places in 166 ms of which 0 ms to minimize.
[2022-05-16 12:08:28] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 0 ms to minimize.
[2022-05-16 12:08:29] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 1 ms to minimize.
[2022-05-16 12:08:29] [INFO ] Deduced a trap composed of 112 places in 180 ms of which 0 ms to minimize.
[2022-05-16 12:08:29] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 0 ms to minimize.
[2022-05-16 12:08:29] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 0 ms to minimize.
[2022-05-16 12:08:30] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 1 ms to minimize.
[2022-05-16 12:08:30] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 1 ms to minimize.
[2022-05-16 12:08:30] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 1 ms to minimize.
[2022-05-16 12:08:32] [INFO ] Deduced a trap composed of 182 places in 233 ms of which 0 ms to minimize.
[2022-05-16 12:08:32] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 1 ms to minimize.
[2022-05-16 12:08:32] [INFO ] Deduced a trap composed of 149 places in 206 ms of which 0 ms to minimize.
[2022-05-16 12:08:32] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 0 ms to minimize.
[2022-05-16 12:08:33] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 1 ms to minimize.
[2022-05-16 12:08:33] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 0 ms to minimize.
[2022-05-16 12:08:34] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 1 ms to minimize.
[2022-05-16 12:08:34] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 0 ms to minimize.
[2022-05-16 12:08:34] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 1 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:08:36] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2022-05-16 12:08:36] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 0 ms to minimize.
[2022-05-16 12:08:45] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 19098 ms
[2022-05-16 12:08:53] [INFO ] Deduced a trap composed of 200 places in 139 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9375 ms
[2022-05-16 12:09:12] [INFO ] After 129354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :863
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 12:09:12] [INFO ] After 225023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :863
Fused 867 Parikh solutions to 826 different solutions.
Parikh walk visited 0 properties in 30017 ms.
Support contains 867 out of 959 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 23 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 959/959 places, 900/900 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 22 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 959 cols
[2022-05-16 12:09:42] [INFO ] Invariants computation overflowed in 107 ms
[2022-05-16 12:09:43] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2022-05-16 12:09:43] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-16 12:09:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:09:52] [INFO ] Implicit Places using invariants and state equation in 9729 ms returned [85, 287, 412, 780, 906]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 10035 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 954/959 places, 900/900 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 954 transition count 898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 952 transition count 898
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 952 transition count 898
Applied a total of 5 rules in 57 ms. Remains 952 /954 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 952 cols
[2022-05-16 12:09:52] [INFO ] Computed 99 place invariants in 111 ms
[2022-05-16 12:09:53] [INFO ] Implicit Places using invariants in 341 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 951/959 places, 898/900 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 897
Applied a total of 2 rules in 60 ms. Remains 950 /951 variables (removed 1) and now considering 897/898 (removed 1) transitions.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:09:53] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-16 12:09:53] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:09:53] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-16 12:09:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:10:07] [INFO ] Implicit Places using invariants and state equation in 13637 ms returned []
Implicit Place search using SMT with State Equation took 13863 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 950/959 places, 897/900 transitions.
Finished structural reductions, in 3 iterations. Remains : 950/959 places, 897/900 transitions.
Interrupted random walk after 353958 steps, including 51093 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 56354 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:11:36] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-16 12:11:57] [INFO ] After 21344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2022-05-16 12:13:08] [INFO ] After 45761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2022-05-16 12:13:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:13:49] [INFO ] After 40513ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2022-05-16 12:13:49] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2022-05-16 12:13:49] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 0 ms to minimize.
[2022-05-16 12:13:49] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 0 ms to minimize.
[2022-05-16 12:13:49] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 0 ms to minimize.
[2022-05-16 12:13:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1057 ms
[2022-05-16 12:13:51] [INFO ] Deduced a trap composed of 374 places in 264 ms of which 1 ms to minimize.
[2022-05-16 12:13:51] [INFO ] Deduced a trap composed of 367 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:13:52] [INFO ] Deduced a trap composed of 368 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:13:52] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 1 ms to minimize.
[2022-05-16 12:13:52] [INFO ] Deduced a trap composed of 364 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:13:53] [INFO ] Deduced a trap composed of 368 places in 270 ms of which 1 ms to minimize.
[2022-05-16 12:13:53] [INFO ] Deduced a trap composed of 359 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:13:53] [INFO ] Deduced a trap composed of 360 places in 264 ms of which 1 ms to minimize.
[2022-05-16 12:13:53] [INFO ] Deduced a trap composed of 361 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:13:54] [INFO ] Deduced a trap composed of 379 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:13:54] [INFO ] Deduced a trap composed of 380 places in 251 ms of which 1 ms to minimize.
[2022-05-16 12:13:54] [INFO ] Deduced a trap composed of 369 places in 250 ms of which 1 ms to minimize.
[2022-05-16 12:13:55] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:13:55] [INFO ] Deduced a trap composed of 396 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:13:55] [INFO ] Deduced a trap composed of 374 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:13:56] [INFO ] Deduced a trap composed of 372 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:13:56] [INFO ] Deduced a trap composed of 364 places in 251 ms of which 1 ms to minimize.
[2022-05-16 12:13:56] [INFO ] Deduced a trap composed of 397 places in 250 ms of which 0 ms to minimize.
[2022-05-16 12:13:57] [INFO ] Deduced a trap composed of 364 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:13:57] [INFO ] Deduced a trap composed of 368 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:13:57] [INFO ] Deduced a trap composed of 399 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:13:57] [INFO ] Deduced a trap composed of 369 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:13:58] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 1 ms to minimize.
[2022-05-16 12:13:58] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 0 ms to minimize.
[2022-05-16 12:13:58] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7563 ms
[2022-05-16 12:13:59] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2022-05-16 12:13:59] [INFO ] Deduced a trap composed of 202 places in 130 ms of which 1 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 194 places in 152 ms of which 0 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 196 places in 135 ms of which 0 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 184 places in 138 ms of which 0 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 182 places in 135 ms of which 0 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 170 places in 140 ms of which 0 ms to minimize.
[2022-05-16 12:14:00] [INFO ] Deduced a trap composed of 172 places in 155 ms of which 1 ms to minimize.
[2022-05-16 12:14:01] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-16 12:14:01] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 1 ms to minimize.
[2022-05-16 12:14:01] [INFO ] Deduced a trap composed of 146 places in 151 ms of which 0 ms to minimize.
[2022-05-16 12:14:01] [INFO ] Deduced a trap composed of 210 places in 169 ms of which 0 ms to minimize.
[2022-05-16 12:14:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2331 ms
[2022-05-16 12:14:03] [INFO ] Deduced a trap composed of 207 places in 146 ms of which 0 ms to minimize.
[2022-05-16 12:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2022-05-16 12:14:04] [INFO ] Deduced a trap composed of 355 places in 262 ms of which 0 ms to minimize.
[2022-05-16 12:14:04] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 0 ms to minimize.
[2022-05-16 12:14:04] [INFO ] Deduced a trap composed of 366 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:14:05] [INFO ] Deduced a trap composed of 370 places in 271 ms of which 0 ms to minimize.
[2022-05-16 12:14:05] [INFO ] Deduced a trap composed of 372 places in 266 ms of which 1 ms to minimize.
[2022-05-16 12:14:05] [INFO ] Deduced a trap composed of 359 places in 273 ms of which 1 ms to minimize.
[2022-05-16 12:14:06] [INFO ] Deduced a trap composed of 354 places in 279 ms of which 1 ms to minimize.
[2022-05-16 12:14:06] [INFO ] Deduced a trap composed of 362 places in 274 ms of which 0 ms to minimize.
[2022-05-16 12:14:06] [INFO ] Deduced a trap composed of 413 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:14:07] [INFO ] Deduced a trap composed of 372 places in 270 ms of which 1 ms to minimize.
[2022-05-16 12:14:07] [INFO ] Deduced a trap composed of 404 places in 278 ms of which 1 ms to minimize.
[2022-05-16 12:14:07] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 0 ms to minimize.
[2022-05-16 12:14:08] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 1 ms to minimize.
[2022-05-16 12:14:08] [INFO ] Deduced a trap composed of 98 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:14:08] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 0 ms to minimize.
[2022-05-16 12:14:09] [INFO ] Deduced a trap composed of 122 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:14:09] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 2 ms to minimize.
[2022-05-16 12:14:09] [INFO ] Deduced a trap composed of 86 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:14:10] [INFO ] Deduced a trap composed of 342 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:14:10] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 0 ms to minimize.
[2022-05-16 12:14:11] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 0 ms to minimize.
[2022-05-16 12:14:11] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 0 ms to minimize.
[2022-05-16 12:14:11] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 1 ms to minimize.
[2022-05-16 12:14:11] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 0 ms to minimize.
[2022-05-16 12:14:11] [INFO ] Deduced a trap composed of 214 places in 173 ms of which 1 ms to minimize.
[2022-05-16 12:14:12] [INFO ] Deduced a trap composed of 204 places in 162 ms of which 1 ms to minimize.
[2022-05-16 12:14:12] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 0 ms to minimize.
[2022-05-16 12:14:13] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 1 ms to minimize.
[2022-05-16 12:14:16] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 0 ms to minimize.
[2022-05-16 12:14:16] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 1 ms to minimize.
[2022-05-16 12:14:17] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 0 ms to minimize.
[2022-05-16 12:14:17] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2022-05-16 12:14:18] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:20] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 0 ms to minimize.
[2022-05-16 12:14:20] [INFO ] Deduced a trap composed of 301 places in 231 ms of which 1 ms to minimize.
[2022-05-16 12:14:21] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 1 ms to minimize.
[2022-05-16 12:14:23] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 1 ms to minimize.
[2022-05-16 12:14:25] [INFO ] Deduced a trap composed of 343 places in 286 ms of which 1 ms to minimize.
[2022-05-16 12:14:25] [INFO ] Deduced a trap composed of 384 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:14:26] [INFO ] Deduced a trap composed of 93 places in 185 ms of which 1 ms to minimize.
[2022-05-16 12:14:30] [INFO ] Deduced a trap composed of 231 places in 192 ms of which 0 ms to minimize.
[2022-05-16 12:14:30] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 1 ms to minimize.
[2022-05-16 12:14:30] [INFO ] Deduced a trap composed of 157 places in 167 ms of which 0 ms to minimize.
[2022-05-16 12:14:31] [INFO ] Deduced a trap composed of 376 places in 271 ms of which 1 ms to minimize.
[2022-05-16 12:14:31] [INFO ] Deduced a trap composed of 373 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:14:32] [INFO ] Deduced a trap composed of 351 places in 260 ms of which 1 ms to minimize.
[2022-05-16 12:14:32] [INFO ] Deduced a trap composed of 353 places in 272 ms of which 1 ms to minimize.
[2022-05-16 12:14:32] [INFO ] Deduced a trap composed of 371 places in 248 ms of which 1 ms to minimize.
[2022-05-16 12:14:33] [INFO ] Deduced a trap composed of 375 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:14:33] [INFO ] Deduced a trap composed of 396 places in 266 ms of which 1 ms to minimize.
[2022-05-16 12:14:33] [INFO ] Deduced a trap composed of 405 places in 269 ms of which 1 ms to minimize.
[2022-05-16 12:14:34] [INFO ] Deduced a trap composed of 380 places in 266 ms of which 1 ms to minimize.
[2022-05-16 12:14:34] [INFO ] Deduced a trap composed of 376 places in 261 ms of which 0 ms to minimize.
[2022-05-16 12:14:34] [INFO ] Deduced a trap composed of 383 places in 274 ms of which 0 ms to minimize.
[2022-05-16 12:14:35] [INFO ] Deduced a trap composed of 373 places in 314 ms of which 1 ms to minimize.
[2022-05-16 12:14:35] [INFO ] Deduced a trap composed of 358 places in 250 ms of which 0 ms to minimize.
[2022-05-16 12:14:35] [INFO ] Deduced a trap composed of 394 places in 272 ms of which 1 ms to minimize.
[2022-05-16 12:14:35] [INFO ] Deduced a trap composed of 390 places in 255 ms of which 2 ms to minimize.
[2022-05-16 12:14:36] [INFO ] Deduced a trap composed of 385 places in 269 ms of which 2 ms to minimize.
[2022-05-16 12:14:36] [INFO ] Deduced a trap composed of 375 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:36] [INFO ] Deduced a trap composed of 441 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:14:37] [INFO ] Deduced a trap composed of 441 places in 312 ms of which 1 ms to minimize.
[2022-05-16 12:14:37] [INFO ] Deduced a trap composed of 456 places in 275 ms of which 0 ms to minimize.
[2022-05-16 12:14:37] [INFO ] Deduced a trap composed of 441 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:14:38] [INFO ] Deduced a trap composed of 440 places in 251 ms of which 2 ms to minimize.
[2022-05-16 12:14:38] [INFO ] Deduced a trap composed of 436 places in 274 ms of which 1 ms to minimize.
[2022-05-16 12:14:38] [INFO ] Deduced a trap composed of 424 places in 275 ms of which 1 ms to minimize.
[2022-05-16 12:14:39] [INFO ] Deduced a trap composed of 451 places in 272 ms of which 0 ms to minimize.
[2022-05-16 12:14:39] [INFO ] Deduced a trap composed of 436 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:14:39] [INFO ] Deduced a trap composed of 388 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:14:40] [INFO ] Deduced a trap composed of 436 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:40] [INFO ] Deduced a trap composed of 409 places in 274 ms of which 1 ms to minimize.
[2022-05-16 12:14:40] [INFO ] Deduced a trap composed of 105 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:14:41] [INFO ] Deduced a trap composed of 243 places in 278 ms of which 1 ms to minimize.
[2022-05-16 12:14:41] [INFO ] Deduced a trap composed of 188 places in 134 ms of which 0 ms to minimize.
[2022-05-16 12:14:45] [INFO ] Deduced a trap composed of 434 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:14:45] [INFO ] Deduced a trap composed of 419 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:14:46] [INFO ] Deduced a trap composed of 457 places in 264 ms of which 1 ms to minimize.
[2022-05-16 12:14:46] [INFO ] Deduced a trap composed of 430 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:46] [INFO ] Deduced a trap composed of 427 places in 284 ms of which 0 ms to minimize.
[2022-05-16 12:14:47] [INFO ] Deduced a trap composed of 397 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:14:47] [INFO ] Deduced a trap composed of 441 places in 268 ms of which 0 ms to minimize.
[2022-05-16 12:14:47] [INFO ] Deduced a trap composed of 444 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:14:48] [INFO ] Deduced a trap composed of 446 places in 275 ms of which 1 ms to minimize.
[2022-05-16 12:14:48] [INFO ] Deduced a trap composed of 427 places in 272 ms of which 1 ms to minimize.
[2022-05-16 12:14:48] [INFO ] Deduced a trap composed of 452 places in 271 ms of which 1 ms to minimize.
[2022-05-16 12:14:49] [INFO ] Deduced a trap composed of 439 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:14:49] [INFO ] Deduced a trap composed of 431 places in 288 ms of which 1 ms to minimize.
[2022-05-16 12:14:49] [INFO ] Deduced a trap composed of 423 places in 271 ms of which 1 ms to minimize.
[2022-05-16 12:14:50] [INFO ] Deduced a trap composed of 393 places in 269 ms of which 1 ms to minimize.
[2022-05-16 12:14:50] [INFO ] Deduced a trap composed of 444 places in 267 ms of which 0 ms to minimize.
[2022-05-16 12:14:51] [INFO ] Deduced a trap composed of 414 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:14:51] [INFO ] Deduced a trap composed of 116 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:51] [INFO ] Deduced a trap composed of 297 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:14:52] [INFO ] Deduced a trap composed of 400 places in 279 ms of which 1 ms to minimize.
[2022-05-16 12:14:52] [INFO ] Deduced a trap composed of 380 places in 267 ms of which 1 ms to minimize.
[2022-05-16 12:14:52] [INFO ] Deduced a trap composed of 140 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:14:53] [INFO ] Deduced a trap composed of 408 places in 257 ms of which 0 ms to minimize.
[2022-05-16 12:14:53] [INFO ] Deduced a trap composed of 411 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:14:53] [INFO ] Deduced a trap composed of 282 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:14:54] [INFO ] Deduced a trap composed of 112 places in 258 ms of which 0 ms to minimize.
[2022-05-16 12:14:54] [INFO ] Deduced a trap composed of 368 places in 277 ms of which 1 ms to minimize.
[2022-05-16 12:14:54] [INFO ] Deduced a trap composed of 370 places in 264 ms of which 1 ms to minimize.
[2022-05-16 12:14:55] [INFO ] Deduced a trap composed of 375 places in 270 ms of which 1 ms to minimize.
[2022-05-16 12:14:55] [INFO ] Deduced a trap composed of 382 places in 276 ms of which 1 ms to minimize.
[2022-05-16 12:14:56] [INFO ] Deduced a trap composed of 359 places in 288 ms of which 1 ms to minimize.
[2022-05-16 12:14:56] [INFO ] Deduced a trap composed of 380 places in 265 ms of which 0 ms to minimize.
[2022-05-16 12:14:56] [INFO ] Deduced a trap composed of 370 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:14:57] [INFO ] Deduced a trap composed of 394 places in 267 ms of which 1 ms to minimize.
[2022-05-16 12:14:57] [INFO ] Deduced a trap composed of 128 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:14:58] [INFO ] Deduced a trap composed of 391 places in 274 ms of which 1 ms to minimize.
[2022-05-16 12:14:58] [INFO ] Deduced a trap composed of 394 places in 271 ms of which 0 ms to minimize.
[2022-05-16 12:15:00] [INFO ] Deduced a trap composed of 371 places in 265 ms of which 1 ms to minimize.
[2022-05-16 12:15:00] [INFO ] Deduced a trap composed of 377 places in 288 ms of which 1 ms to minimize.
[2022-05-16 12:15:01] [INFO ] Deduced a trap composed of 388 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:15:02] [INFO ] Deduced a trap composed of 153 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:15:03] [INFO ] Deduced a trap composed of 136 places in 260 ms of which 1 ms to minimize.
[2022-05-16 12:15:03] [INFO ] Deduced a trap composed of 184 places in 141 ms of which 0 ms to minimize.
[2022-05-16 12:15:03] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 0 ms to minimize.
[2022-05-16 12:15:05] [INFO ] Deduced a trap composed of 212 places in 137 ms of which 0 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 72995 ms
[2022-05-16 12:15:42] [INFO ] After 154108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :864
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 12:15:42] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :864
Fused 867 Parikh solutions to 831 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 23 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 20 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:16:12] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-16 12:16:12] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:16:12] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-16 12:16:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:16:50] [INFO ] Performed 87/950 implicitness test of which 0 returned IMPLICIT in 37 seconds.
[2022-05-16 12:17:00] [INFO ] Implicit Places using invariants and state equation in 47678 ms returned []
Implicit Place search using SMT with State Equation took 47886 ms to find 0 implicit places.
[2022-05-16 12:17:00] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:17:00] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-16 12:17:01] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 897/897 transitions.
Incomplete random walk after 100000 steps, including 14423 resets, run finished after 8962 ms. (steps per millisecond=11 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:17:10] [INFO ] Invariants computation overflowed in 67 ms
[2022-05-16 12:17:30] [INFO ] After 20528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2022-05-16 12:18:39] [INFO ] After 43984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2022-05-16 12:18:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:19:10] [INFO ] After 31635ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2022-05-16 12:19:10] [INFO ] After 31635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :867
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 12:19:10] [INFO ] After 100008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :867
Interrupted random walk after 344138 steps, including 49562 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 56859 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:20:40] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-16 12:21:00] [INFO ] After 19858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2022-05-16 12:22:10] [INFO ] After 45395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2022-05-16 12:22:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:22:50] [INFO ] After 39965ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2022-05-16 12:22:50] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2022-05-16 12:22:50] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2022-05-16 12:22:51] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 1 ms to minimize.
[2022-05-16 12:22:51] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 0 ms to minimize.
[2022-05-16 12:22:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1044 ms
[2022-05-16 12:22:52] [INFO ] Deduced a trap composed of 374 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:22:53] [INFO ] Deduced a trap composed of 367 places in 250 ms of which 0 ms to minimize.
[2022-05-16 12:22:53] [INFO ] Deduced a trap composed of 368 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:22:53] [INFO ] Deduced a trap composed of 100 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:22:53] [INFO ] Deduced a trap composed of 364 places in 256 ms of which 0 ms to minimize.
[2022-05-16 12:22:54] [INFO ] Deduced a trap composed of 368 places in 251 ms of which 1 ms to minimize.
[2022-05-16 12:22:54] [INFO ] Deduced a trap composed of 359 places in 257 ms of which 0 ms to minimize.
[2022-05-16 12:22:54] [INFO ] Deduced a trap composed of 360 places in 250 ms of which 1 ms to minimize.
[2022-05-16 12:22:55] [INFO ] Deduced a trap composed of 361 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:22:55] [INFO ] Deduced a trap composed of 379 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:22:55] [INFO ] Deduced a trap composed of 380 places in 258 ms of which 0 ms to minimize.
[2022-05-16 12:22:56] [INFO ] Deduced a trap composed of 369 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:22:56] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 0 ms to minimize.
[2022-05-16 12:22:56] [INFO ] Deduced a trap composed of 396 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:22:57] [INFO ] Deduced a trap composed of 374 places in 258 ms of which 0 ms to minimize.
[2022-05-16 12:22:57] [INFO ] Deduced a trap composed of 372 places in 260 ms of which 0 ms to minimize.
[2022-05-16 12:22:57] [INFO ] Deduced a trap composed of 364 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:22:58] [INFO ] Deduced a trap composed of 397 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:22:58] [INFO ] Deduced a trap composed of 364 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:22:58] [INFO ] Deduced a trap composed of 368 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:22:58] [INFO ] Deduced a trap composed of 399 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:22:59] [INFO ] Deduced a trap composed of 369 places in 252 ms of which 0 ms to minimize.
[2022-05-16 12:22:59] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:22:59] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:23:00] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7627 ms
[2022-05-16 12:23:00] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2022-05-16 12:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2022-05-16 12:23:01] [INFO ] Deduced a trap composed of 202 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:23:01] [INFO ] Deduced a trap composed of 194 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:23:01] [INFO ] Deduced a trap composed of 196 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:23:01] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:23:01] [INFO ] Deduced a trap composed of 182 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:23:02] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 1 ms to minimize.
[2022-05-16 12:23:02] [INFO ] Deduced a trap composed of 172 places in 134 ms of which 0 ms to minimize.
[2022-05-16 12:23:02] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 0 ms to minimize.
[2022-05-16 12:23:02] [INFO ] Deduced a trap composed of 160 places in 145 ms of which 1 ms to minimize.
[2022-05-16 12:23:02] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2022-05-16 12:23:03] [INFO ] Deduced a trap composed of 210 places in 149 ms of which 1 ms to minimize.
[2022-05-16 12:23:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2246 ms
[2022-05-16 12:23:04] [INFO ] Deduced a trap composed of 207 places in 126 ms of which 0 ms to minimize.
[2022-05-16 12:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2022-05-16 12:23:05] [INFO ] Deduced a trap composed of 355 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:23:05] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:23:06] [INFO ] Deduced a trap composed of 366 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:23:06] [INFO ] Deduced a trap composed of 370 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:23:06] [INFO ] Deduced a trap composed of 372 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:23:07] [INFO ] Deduced a trap composed of 359 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:23:07] [INFO ] Deduced a trap composed of 354 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:23:07] [INFO ] Deduced a trap composed of 362 places in 248 ms of which 1 ms to minimize.
[2022-05-16 12:23:08] [INFO ] Deduced a trap composed of 413 places in 253 ms of which 0 ms to minimize.
[2022-05-16 12:23:08] [INFO ] Deduced a trap composed of 372 places in 248 ms of which 0 ms to minimize.
[2022-05-16 12:23:08] [INFO ] Deduced a trap composed of 404 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:23:08] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 1 ms to minimize.
[2022-05-16 12:23:09] [INFO ] Deduced a trap composed of 74 places in 240 ms of which 1 ms to minimize.
[2022-05-16 12:23:09] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:23:09] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:23:10] [INFO ] Deduced a trap composed of 122 places in 257 ms of which 1 ms to minimize.
[2022-05-16 12:23:10] [INFO ] Deduced a trap composed of 76 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:23:10] [INFO ] Deduced a trap composed of 86 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:23:11] [INFO ] Deduced a trap composed of 342 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:23:11] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 1 ms to minimize.
[2022-05-16 12:23:12] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 1 ms to minimize.
[2022-05-16 12:23:12] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 0 ms to minimize.
[2022-05-16 12:23:12] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 0 ms to minimize.
[2022-05-16 12:23:12] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 1 ms to minimize.
[2022-05-16 12:23:13] [INFO ] Deduced a trap composed of 214 places in 159 ms of which 0 ms to minimize.
[2022-05-16 12:23:13] [INFO ] Deduced a trap composed of 204 places in 159 ms of which 1 ms to minimize.
[2022-05-16 12:23:13] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 1 ms to minimize.
[2022-05-16 12:23:15] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 0 ms to minimize.
[2022-05-16 12:23:18] [INFO ] Deduced a trap composed of 56 places in 234 ms of which 1 ms to minimize.
[2022-05-16 12:23:18] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 0 ms to minimize.
[2022-05-16 12:23:18] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2022-05-16 12:23:19] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2022-05-16 12:23:20] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2022-05-16 12:23:21] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2022-05-16 12:23:22] [INFO ] Deduced a trap composed of 301 places in 195 ms of which 1 ms to minimize.
[2022-05-16 12:23:23] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 1 ms to minimize.
[2022-05-16 12:23:24] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 1 ms to minimize.
[2022-05-16 12:23:27] [INFO ] Deduced a trap composed of 343 places in 255 ms of which 0 ms to minimize.
[2022-05-16 12:23:27] [INFO ] Deduced a trap composed of 384 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:23:27] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 1 ms to minimize.
[2022-05-16 12:23:31] [INFO ] Deduced a trap composed of 231 places in 169 ms of which 0 ms to minimize.
[2022-05-16 12:23:31] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 1 ms to minimize.
[2022-05-16 12:23:32] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 1 ms to minimize.
[2022-05-16 12:23:32] [INFO ] Deduced a trap composed of 376 places in 263 ms of which 0 ms to minimize.
[2022-05-16 12:23:33] [INFO ] Deduced a trap composed of 373 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:23:33] [INFO ] Deduced a trap composed of 351 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:23:33] [INFO ] Deduced a trap composed of 353 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:23:34] [INFO ] Deduced a trap composed of 371 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:23:34] [INFO ] Deduced a trap composed of 375 places in 254 ms of which 1 ms to minimize.
[2022-05-16 12:23:34] [INFO ] Deduced a trap composed of 396 places in 255 ms of which 1 ms to minimize.
[2022-05-16 12:23:35] [INFO ] Deduced a trap composed of 405 places in 261 ms of which 0 ms to minimize.
[2022-05-16 12:23:35] [INFO ] Deduced a trap composed of 380 places in 272 ms of which 0 ms to minimize.
[2022-05-16 12:23:35] [INFO ] Deduced a trap composed of 376 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:23:36] [INFO ] Deduced a trap composed of 383 places in 260 ms of which 5 ms to minimize.
[2022-05-16 12:23:36] [INFO ] Deduced a trap composed of 373 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:23:36] [INFO ] Deduced a trap composed of 358 places in 270 ms of which 1 ms to minimize.
[2022-05-16 12:23:36] [INFO ] Deduced a trap composed of 394 places in 266 ms of which 1 ms to minimize.
[2022-05-16 12:23:37] [INFO ] Deduced a trap composed of 390 places in 272 ms of which 1 ms to minimize.
[2022-05-16 12:23:37] [INFO ] Deduced a trap composed of 385 places in 315 ms of which 1 ms to minimize.
[2022-05-16 12:23:37] [INFO ] Deduced a trap composed of 375 places in 294 ms of which 0 ms to minimize.
[2022-05-16 12:23:38] [INFO ] Deduced a trap composed of 441 places in 267 ms of which 0 ms to minimize.
[2022-05-16 12:23:38] [INFO ] Deduced a trap composed of 441 places in 279 ms of which 1 ms to minimize.
[2022-05-16 12:23:38] [INFO ] Deduced a trap composed of 456 places in 248 ms of which 0 ms to minimize.
[2022-05-16 12:23:39] [INFO ] Deduced a trap composed of 441 places in 249 ms of which 0 ms to minimize.
[2022-05-16 12:23:39] [INFO ] Deduced a trap composed of 440 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:23:39] [INFO ] Deduced a trap composed of 436 places in 256 ms of which 1 ms to minimize.
[2022-05-16 12:23:40] [INFO ] Deduced a trap composed of 424 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:23:40] [INFO ] Deduced a trap composed of 451 places in 244 ms of which 1 ms to minimize.
[2022-05-16 12:23:40] [INFO ] Deduced a trap composed of 436 places in 247 ms of which 1 ms to minimize.
[2022-05-16 12:23:41] [INFO ] Deduced a trap composed of 388 places in 250 ms of which 1 ms to minimize.
[2022-05-16 12:23:41] [INFO ] Deduced a trap composed of 436 places in 246 ms of which 1 ms to minimize.
[2022-05-16 12:23:41] [INFO ] Deduced a trap composed of 409 places in 248 ms of which 0 ms to minimize.
[2022-05-16 12:23:41] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 1 ms to minimize.
[2022-05-16 12:23:42] [INFO ] Deduced a trap composed of 243 places in 246 ms of which 1 ms to minimize.
[2022-05-16 12:23:43] [INFO ] Deduced a trap composed of 188 places in 136 ms of which 0 ms to minimize.
[2022-05-16 12:23:46] [INFO ] Deduced a trap composed of 434 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:23:47] [INFO ] Deduced a trap composed of 419 places in 262 ms of which 1 ms to minimize.
[2022-05-16 12:23:47] [INFO ] Deduced a trap composed of 457 places in 260 ms of which 1 ms to minimize.
[2022-05-16 12:23:47] [INFO ] Deduced a trap composed of 430 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:23:48] [INFO ] Deduced a trap composed of 427 places in 263 ms of which 0 ms to minimize.
[2022-05-16 12:23:48] [INFO ] Deduced a trap composed of 397 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:23:48] [INFO ] Deduced a trap composed of 441 places in 243 ms of which 1 ms to minimize.
[2022-05-16 12:23:49] [INFO ] Deduced a trap composed of 444 places in 241 ms of which 1 ms to minimize.
[2022-05-16 12:23:49] [INFO ] Deduced a trap composed of 446 places in 255 ms of which 0 ms to minimize.
[2022-05-16 12:23:49] [INFO ] Deduced a trap composed of 427 places in 239 ms of which 1 ms to minimize.
[2022-05-16 12:23:49] [INFO ] Deduced a trap composed of 452 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:23:50] [INFO ] Deduced a trap composed of 439 places in 238 ms of which 1 ms to minimize.
[2022-05-16 12:23:50] [INFO ] Deduced a trap composed of 431 places in 240 ms of which 1 ms to minimize.
[2022-05-16 12:23:50] [INFO ] Deduced a trap composed of 423 places in 242 ms of which 0 ms to minimize.
[2022-05-16 12:23:51] [INFO ] Deduced a trap composed of 393 places in 245 ms of which 1 ms to minimize.
[2022-05-16 12:23:51] [INFO ] Deduced a trap composed of 444 places in 243 ms of which 1 ms to minimize.
[2022-05-16 12:23:52] [INFO ] Deduced a trap composed of 414 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:23:52] [INFO ] Deduced a trap composed of 116 places in 242 ms of which 0 ms to minimize.
[2022-05-16 12:23:52] [INFO ] Deduced a trap composed of 297 places in 240 ms of which 0 ms to minimize.
[2022-05-16 12:23:52] [INFO ] Deduced a trap composed of 400 places in 239 ms of which 1 ms to minimize.
[2022-05-16 12:23:53] [INFO ] Deduced a trap composed of 380 places in 267 ms of which 4 ms to minimize.
[2022-05-16 12:23:53] [INFO ] Deduced a trap composed of 140 places in 253 ms of which 1 ms to minimize.
[2022-05-16 12:23:54] [INFO ] Deduced a trap composed of 408 places in 258 ms of which 1 ms to minimize.
[2022-05-16 12:23:54] [INFO ] Deduced a trap composed of 411 places in 247 ms of which 1 ms to minimize.
[2022-05-16 12:23:54] [INFO ] Deduced a trap composed of 282 places in 249 ms of which 0 ms to minimize.
[2022-05-16 12:23:55] [INFO ] Deduced a trap composed of 112 places in 261 ms of which 1 ms to minimize.
[2022-05-16 12:23:55] [INFO ] Deduced a trap composed of 368 places in 240 ms of which 1 ms to minimize.
[2022-05-16 12:23:55] [INFO ] Deduced a trap composed of 370 places in 237 ms of which 0 ms to minimize.
[2022-05-16 12:23:55] [INFO ] Deduced a trap composed of 375 places in 243 ms of which 0 ms to minimize.
[2022-05-16 12:23:56] [INFO ] Deduced a trap composed of 382 places in 253 ms of which 0 ms to minimize.
[2022-05-16 12:23:56] [INFO ] Deduced a trap composed of 359 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:23:57] [INFO ] Deduced a trap composed of 380 places in 260 ms of which 1 ms to minimize.
[2022-05-16 12:23:57] [INFO ] Deduced a trap composed of 370 places in 257 ms of which 0 ms to minimize.
[2022-05-16 12:23:58] [INFO ] Deduced a trap composed of 394 places in 254 ms of which 0 ms to minimize.
[2022-05-16 12:23:58] [INFO ] Deduced a trap composed of 128 places in 258 ms of which 0 ms to minimize.
[2022-05-16 12:23:59] [INFO ] Deduced a trap composed of 391 places in 259 ms of which 1 ms to minimize.
[2022-05-16 12:23:59] [INFO ] Deduced a trap composed of 394 places in 263 ms of which 1 ms to minimize.
[2022-05-16 12:24:01] [INFO ] Deduced a trap composed of 371 places in 287 ms of which 1 ms to minimize.
[2022-05-16 12:24:02] [INFO ] Deduced a trap composed of 377 places in 275 ms of which 1 ms to minimize.
[2022-05-16 12:24:02] [INFO ] Deduced a trap composed of 388 places in 268 ms of which 1 ms to minimize.
[2022-05-16 12:24:04] [INFO ] Deduced a trap composed of 153 places in 252 ms of which 1 ms to minimize.
[2022-05-16 12:24:04] [INFO ] Deduced a trap composed of 136 places in 243 ms of which 1 ms to minimize.
[2022-05-16 12:24:04] [INFO ] Deduced a trap composed of 184 places in 134 ms of which 1 ms to minimize.
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 0 ms to minimize.
[2022-05-16 12:24:06] [INFO ] Deduced a trap composed of 212 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:24:18] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 73684 ms
[2022-05-16 12:24:45] [INFO ] After 155075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :864
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 12:24:45] [INFO ] After 225030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :864
Fused 867 Parikh solutions to 831 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 27 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 19 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:25:15] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-16 12:25:15] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:25:15] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-16 12:25:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:25:30] [INFO ] Implicit Places using invariants and state equation in 15156 ms returned []
Implicit Place search using SMT with State Equation took 15343 ms to find 0 implicit places.
[2022-05-16 12:25:30] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:25:30] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-16 12:25:31] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 897/897 transitions.
Incomplete random walk after 100000 steps, including 14548 resets, run finished after 9542 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2022-05-16 12:25:40] [INFO ] Invariants computation overflowed in 57 ms
[2022-05-16 12:26:01] [INFO ] After 20917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DoubleExponent-PT-020"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, 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 r085-tall-165260115500128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 '
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 ;