fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654350700015
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2167.260 207029.00 265782.00 480.60 T?TT?TTT?FF?F?FF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350700015.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 07:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 07:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717195031232

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:37:12] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2024-05-31 22:37:12] [INFO ] Transformed 3606 places.
[2024-05-31 22:37:12] [INFO ] Transformed 5141 transitions.
[2024-05-31 22:37:12] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1264 resets) in 1950 ms. (20 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (320 resets) in 490 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (320 resets) in 491 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 282 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (320 resets) in 1230 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (320 resets) in 226 ms. (176 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (320 resets) in 306 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (320 resets) in 272 ms. (146 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (320 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (320 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (320 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
[2024-05-31 22:37:14] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2024-05-31 22:37:15] [INFO ] Computed 459 invariants in 214 ms
[2024-05-31 22:37:15] [INFO ] State equation strengthened by 1362 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 647/930 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/930 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/930 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 10/940 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1933/2873 variables, 196/251 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2873 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 733/3606 variables, 208/459 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3606 variables, 0/459 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4869/8475 variables, 3606/4065 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8475/8475 variables, and 5427 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 415/415 constraints, State Equation: 3606/3606 constraints, ReadFeed: 1362/1362 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/18 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 681/864 variables, 19/37 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 4/41 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-31 22:37:20] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 22 ms to minimize.
[2024-05-31 22:37:21] [INFO ] Deduced a trap composed of 98 places in 320 ms of which 5 ms to minimize.
[2024-05-31 22:37:21] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 8 ms to minimize.
[2024-05-31 22:37:21] [INFO ] Deduced a trap composed of 128 places in 247 ms of which 4 ms to minimize.
[2024-05-31 22:37:22] [INFO ] Deduced a trap composed of 189 places in 392 ms of which 4 ms to minimize.
[2024-05-31 22:37:22] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 9 ms to minimize.
[2024-05-31 22:37:22] [INFO ] Deduced a trap composed of 177 places in 261 ms of which 5 ms to minimize.
[2024-05-31 22:37:23] [INFO ] Deduced a trap composed of 173 places in 312 ms of which 4 ms to minimize.
[2024-05-31 22:37:23] [INFO ] Deduced a trap composed of 200 places in 280 ms of which 5 ms to minimize.
[2024-05-31 22:37:23] [INFO ] Deduced a trap composed of 179 places in 238 ms of which 4 ms to minimize.
[2024-05-31 22:37:24] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 4 ms to minimize.
[2024-05-31 22:37:24] [INFO ] Deduced a trap composed of 178 places in 254 ms of which 5 ms to minimize.
[2024-05-31 22:37:24] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 4 ms to minimize.
[2024-05-31 22:37:24] [INFO ] Deduced a trap composed of 203 places in 241 ms of which 5 ms to minimize.
[2024-05-31 22:37:25] [INFO ] Deduced a trap composed of 186 places in 237 ms of which 4 ms to minimize.
[2024-05-31 22:37:25] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 5 ms to minimize.
[2024-05-31 22:37:25] [INFO ] Deduced a trap composed of 181 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 10804ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 3580 transition count 4469
Reduce places removed 672 places and 0 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Iterating post reduction 1 with 799 rules applied. Total rules applied 1472 place count 2908 transition count 4342
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 1599 place count 2781 transition count 4342
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 1599 place count 2781 transition count 4256
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1771 place count 2695 transition count 4256
Discarding 680 places :
Symmetric choice reduction at 3 with 680 rule applications. Total rules 2451 place count 2015 transition count 3576
Iterating global reduction 3 with 680 rules applied. Total rules applied 3131 place count 2015 transition count 3576
Discarding 190 places :
Symmetric choice reduction at 3 with 190 rule applications. Total rules 3321 place count 1825 transition count 3006
Iterating global reduction 3 with 190 rules applied. Total rules applied 3511 place count 1825 transition count 3006
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3531 place count 1815 transition count 2996
Free-agglomeration rule (complex) applied 76 times.
Iterating global reduction 3 with 76 rules applied. Total rules applied 3607 place count 1815 transition count 2920
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 3683 place count 1739 transition count 2920
Partial Free-agglomeration rule applied 86 times.
Drop transitions (Partial Free agglomeration) removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 3769 place count 1739 transition count 2920
Applied a total of 3769 rules in 1262 ms. Remains 1739 /3606 variables (removed 1867) and now considering 2920/5141 (removed 2221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 ms. Remains : 1739/3606 places, 2920/5141 transitions.
RANDOM walk for 40000 steps (1729 resets) in 652 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 489 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (336 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 61564 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 5
Probabilistic random walk after 61564 steps, saw 28125 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-31 22:37:30] [INFO ] Flow matrix only has 2572 transitions (discarded 348 similar events)
// Phase 1: matrix 2572 rows 1739 cols
[2024-05-31 22:37:30] [INFO ] Computed 433 invariants in 48 ms
[2024-05-31 22:37:30] [INFO ] State equation strengthened by 982 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1014/1197 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1197 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1198 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1198 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 450/1648 variables, 302/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1648 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/1652 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1652 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 87/1739 variables, 87/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1739 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2572/4311 variables, 1739/2172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4311 variables, 982/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4311 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/4311 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4311/4311 variables, and 3154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3854 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 400/400 constraints, State Equation: 1739/1739 constraints, ReadFeed: 982/982 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1014/1197 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1197 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:37:35] [INFO ] Deduced a trap composed of 301 places in 471 ms of which 6 ms to minimize.
[2024-05-31 22:37:35] [INFO ] Deduced a trap composed of 327 places in 453 ms of which 6 ms to minimize.
[2024-05-31 22:37:36] [INFO ] Deduced a trap composed of 219 places in 455 ms of which 7 ms to minimize.
[2024-05-31 22:37:36] [INFO ] Deduced a trap composed of 350 places in 446 ms of which 6 ms to minimize.
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 185 places in 489 ms of which 7 ms to minimize.
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 302 places in 459 ms of which 6 ms to minimize.
[2024-05-31 22:37:38] [INFO ] Deduced a trap composed of 360 places in 434 ms of which 6 ms to minimize.
[2024-05-31 22:37:38] [INFO ] Deduced a trap composed of 247 places in 435 ms of which 6 ms to minimize.
[2024-05-31 22:37:39] [INFO ] Deduced a trap composed of 272 places in 462 ms of which 6 ms to minimize.
[2024-05-31 22:37:39] [INFO ] Deduced a trap composed of 294 places in 439 ms of which 6 ms to minimize.
[2024-05-31 22:37:39] [INFO ] Deduced a trap composed of 252 places in 428 ms of which 6 ms to minimize.
[2024-05-31 22:37:40] [INFO ] Deduced a trap composed of 391 places in 431 ms of which 6 ms to minimize.
[2024-05-31 22:37:40] [INFO ] Deduced a trap composed of 214 places in 430 ms of which 6 ms to minimize.
[2024-05-31 22:37:41] [INFO ] Deduced a trap composed of 343 places in 422 ms of which 6 ms to minimize.
[2024-05-31 22:37:41] [INFO ] Deduced a trap composed of 211 places in 402 ms of which 6 ms to minimize.
[2024-05-31 22:37:42] [INFO ] Deduced a trap composed of 330 places in 401 ms of which 6 ms to minimize.
[2024-05-31 22:37:42] [INFO ] Deduced a trap composed of 236 places in 398 ms of which 5 ms to minimize.
[2024-05-31 22:37:43] [INFO ] Deduced a trap composed of 335 places in 408 ms of which 6 ms to minimize.
[2024-05-31 22:37:43] [INFO ] Deduced a trap composed of 345 places in 411 ms of which 6 ms to minimize.
[2024-05-31 22:37:43] [INFO ] Deduced a trap composed of 276 places in 414 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:37:44] [INFO ] Deduced a trap composed of 328 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:37:44] [INFO ] Deduced a trap composed of 380 places in 408 ms of which 5 ms to minimize.
[2024-05-31 22:37:45] [INFO ] Deduced a trap composed of 318 places in 403 ms of which 5 ms to minimize.
[2024-05-31 22:37:45] [INFO ] Deduced a trap composed of 392 places in 388 ms of which 5 ms to minimize.
[2024-05-31 22:37:46] [INFO ] Deduced a trap composed of 344 places in 404 ms of which 5 ms to minimize.
[2024-05-31 22:37:46] [INFO ] Deduced a trap composed of 395 places in 389 ms of which 5 ms to minimize.
[2024-05-31 22:37:46] [INFO ] Deduced a trap composed of 321 places in 409 ms of which 5 ms to minimize.
[2024-05-31 22:37:47] [INFO ] Deduced a trap composed of 326 places in 404 ms of which 6 ms to minimize.
[2024-05-31 22:37:47] [INFO ] Deduced a trap composed of 295 places in 380 ms of which 5 ms to minimize.
[2024-05-31 22:37:48] [INFO ] Deduced a trap composed of 403 places in 376 ms of which 5 ms to minimize.
[2024-05-31 22:37:48] [INFO ] Deduced a trap composed of 312 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:37:49] [INFO ] Deduced a trap composed of 359 places in 406 ms of which 6 ms to minimize.
[2024-05-31 22:37:49] [INFO ] Deduced a trap composed of 347 places in 412 ms of which 5 ms to minimize.
[2024-05-31 22:37:49] [INFO ] Deduced a trap composed of 305 places in 405 ms of which 6 ms to minimize.
[2024-05-31 22:37:50] [INFO ] Deduced a trap composed of 340 places in 426 ms of which 6 ms to minimize.
[2024-05-31 22:37:50] [INFO ] Deduced a trap composed of 350 places in 407 ms of which 5 ms to minimize.
[2024-05-31 22:37:51] [INFO ] Deduced a trap composed of 312 places in 411 ms of which 5 ms to minimize.
[2024-05-31 22:37:51] [INFO ] Deduced a trap composed of 311 places in 422 ms of which 6 ms to minimize.
[2024-05-31 22:37:52] [INFO ] Deduced a trap composed of 354 places in 408 ms of which 5 ms to minimize.
[2024-05-31 22:37:52] [INFO ] Deduced a trap composed of 363 places in 422 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1197 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:37:53] [INFO ] Deduced a trap composed of 334 places in 400 ms of which 5 ms to minimize.
[2024-05-31 22:37:53] [INFO ] Deduced a trap composed of 344 places in 391 ms of which 6 ms to minimize.
[2024-05-31 22:37:53] [INFO ] Deduced a trap composed of 405 places in 387 ms of which 6 ms to minimize.
[2024-05-31 22:37:54] [INFO ] Deduced a trap composed of 368 places in 378 ms of which 5 ms to minimize.
[2024-05-31 22:37:54] [INFO ] Deduced a trap composed of 385 places in 382 ms of which 5 ms to minimize.
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 393 places in 394 ms of which 5 ms to minimize.
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 399 places in 393 ms of which 6 ms to minimize.
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 341 places in 401 ms of which 5 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 328 places in 413 ms of which 6 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 341 places in 408 ms of which 5 ms to minimize.
[2024-05-31 22:37:57] [INFO ] Deduced a trap composed of 388 places in 410 ms of which 6 ms to minimize.
[2024-05-31 22:37:57] [INFO ] Deduced a trap composed of 335 places in 447 ms of which 6 ms to minimize.
[2024-05-31 22:37:58] [INFO ] Deduced a trap composed of 385 places in 440 ms of which 6 ms to minimize.
[2024-05-31 22:37:58] [INFO ] Deduced a trap composed of 330 places in 446 ms of which 6 ms to minimize.
[2024-05-31 22:37:59] [INFO ] Deduced a trap composed of 368 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:37:59] [INFO ] Deduced a trap composed of 370 places in 470 ms of which 6 ms to minimize.
[2024-05-31 22:38:00] [INFO ] Deduced a trap composed of 419 places in 439 ms of which 6 ms to minimize.
[2024-05-31 22:38:00] [INFO ] Deduced a trap composed of 384 places in 409 ms of which 6 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 390 places in 418 ms of which 6 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 393 places in 435 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1197 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:02] [INFO ] Deduced a trap composed of 250 places in 443 ms of which 5 ms to minimize.
[2024-05-31 22:38:02] [INFO ] Deduced a trap composed of 343 places in 431 ms of which 6 ms to minimize.
[2024-05-31 22:38:02] [INFO ] Deduced a trap composed of 388 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:38:03] [INFO ] Deduced a trap composed of 350 places in 411 ms of which 6 ms to minimize.
[2024-05-31 22:38:03] [INFO ] Deduced a trap composed of 411 places in 436 ms of which 6 ms to minimize.
[2024-05-31 22:38:04] [INFO ] Deduced a trap composed of 434 places in 428 ms of which 5 ms to minimize.
[2024-05-31 22:38:04] [INFO ] Deduced a trap composed of 367 places in 411 ms of which 5 ms to minimize.
[2024-05-31 22:38:05] [INFO ] Deduced a trap composed of 359 places in 410 ms of which 6 ms to minimize.
[2024-05-31 22:38:05] [INFO ] Deduced a trap composed of 414 places in 371 ms of which 5 ms to minimize.
[2024-05-31 22:38:06] [INFO ] Deduced a trap composed of 420 places in 354 ms of which 5 ms to minimize.
[2024-05-31 22:38:06] [INFO ] Deduced a trap composed of 297 places in 419 ms of which 6 ms to minimize.
[2024-05-31 22:38:06] [INFO ] Deduced a trap composed of 319 places in 416 ms of which 5 ms to minimize.
[2024-05-31 22:38:07] [INFO ] Deduced a trap composed of 344 places in 413 ms of which 6 ms to minimize.
[2024-05-31 22:38:07] [INFO ] Deduced a trap composed of 350 places in 423 ms of which 5 ms to minimize.
[2024-05-31 22:38:08] [INFO ] Deduced a trap composed of 331 places in 425 ms of which 5 ms to minimize.
[2024-05-31 22:38:08] [INFO ] Deduced a trap composed of 347 places in 419 ms of which 5 ms to minimize.
[2024-05-31 22:38:09] [INFO ] Deduced a trap composed of 338 places in 404 ms of which 6 ms to minimize.
[2024-05-31 22:38:09] [INFO ] Deduced a trap composed of 333 places in 424 ms of which 6 ms to minimize.
[2024-05-31 22:38:10] [INFO ] Deduced a trap composed of 323 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:38:10] [INFO ] Deduced a trap composed of 238 places in 451 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1197 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:11] [INFO ] Deduced a trap composed of 383 places in 456 ms of which 6 ms to minimize.
[2024-05-31 22:38:11] [INFO ] Deduced a trap composed of 328 places in 467 ms of which 6 ms to minimize.
[2024-05-31 22:38:12] [INFO ] Deduced a trap composed of 377 places in 451 ms of which 6 ms to minimize.
[2024-05-31 22:38:12] [INFO ] Deduced a trap composed of 348 places in 465 ms of which 6 ms to minimize.
[2024-05-31 22:38:13] [INFO ] Deduced a trap composed of 380 places in 468 ms of which 6 ms to minimize.
[2024-05-31 22:38:13] [INFO ] Deduced a trap composed of 386 places in 462 ms of which 6 ms to minimize.
[2024-05-31 22:38:14] [INFO ] Deduced a trap composed of 345 places in 454 ms of which 6 ms to minimize.
[2024-05-31 22:38:14] [INFO ] Deduced a trap composed of 394 places in 463 ms of which 7 ms to minimize.
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 419 places in 414 ms of which 5 ms to minimize.
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 390 places in 418 ms of which 6 ms to minimize.
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 280 places in 429 ms of which 6 ms to minimize.
[2024-05-31 22:38:16] [INFO ] Deduced a trap composed of 467 places in 442 ms of which 5 ms to minimize.
[2024-05-31 22:38:16] [INFO ] Deduced a trap composed of 322 places in 470 ms of which 6 ms to minimize.
[2024-05-31 22:38:17] [INFO ] Deduced a trap composed of 323 places in 502 ms of which 6 ms to minimize.
[2024-05-31 22:38:17] [INFO ] Deduced a trap composed of 341 places in 458 ms of which 6 ms to minimize.
[2024-05-31 22:38:18] [INFO ] Deduced a trap composed of 342 places in 445 ms of which 6 ms to minimize.
[2024-05-31 22:38:18] [INFO ] Deduced a trap composed of 322 places in 455 ms of which 6 ms to minimize.
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 374 places in 455 ms of which 7 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 408 places in 502 ms of which 6 ms to minimize.
SMT process timed out in 49502ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 183 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 2920/2920 transitions.
Applied a total of 0 rules in 85 ms. Remains 1739 /1739 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1739/1739 places, 2920/2920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 2920/2920 transitions.
Applied a total of 0 rules in 130 ms. Remains 1739 /1739 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2024-05-31 22:38:20] [INFO ] Flow matrix only has 2572 transitions (discarded 348 similar events)
[2024-05-31 22:38:20] [INFO ] Invariant cache hit.
[2024-05-31 22:38:21] [INFO ] Implicit Places using invariants in 1529 ms returned [4, 8, 11, 12, 14, 20, 26, 37, 48, 61, 75, 90, 105, 107, 108, 120, 131, 143, 150, 154, 156, 173, 176, 177, 178, 179, 181, 185, 192, 201, 212, 224, 237, 250, 252, 253, 272, 279, 283, 290, 299, 305, 309, 311, 313, 318, 325, 335, 344, 354, 365, 376, 377, 378, 379, 388, 395, 400, 402, 406, 417, 423, 426, 429, 431, 437, 440, 445, 452, 460, 469, 480, 481, 488, 493, 499, 501, 503, 505, 517, 524, 527, 530, 532, 534, 536, 542, 547, 555, 562, 569, 571, 572, 576, 579, 581, 583, 588, 590, 600, 607, 610, 611, 612, 613, 615, 617, 619, 621, 630, 635, 642, 643, 650, 652, 655, 657, 659, 663, 673, 680, 683, 684, 685, 686, 688, 690, 692, 694, 699, 702, 705, 706, 707, 708, 710, 712, 714, 716, 718, 720, 735, 739, 740, 741, 743, 747, 749, 751, 753, 755, 757, 761, 763, 765, 767, 770, 772, 774, 778, 794, 797, 800, 801, 803, 807, 810, 812, 814, 818, 820, 823, 824, 825, 826, 828, 830, 832, 834, 836, 838, 848, 854, 857, 858, 861, 865, 868, 870, 872, 874, 877, 879, 882, 884, 885, 889, 892, 894, 896, 898, 901, 911, 917, 922, 923, 924, 928, 930, 932, 934, 936, 938, 940, 944, 946, 947, 949, 953, 955, 957, 959, 971, 978, 981, 982, 984, 986, 988, 990, 992, 994, 1000, 1004, 1010, 1011, 1013, 1019, 1021, 1023, 1026, 1028, 1030, 1048, 1051, 1052, 1054, 1056, 1061, 1063, 1065, 1068, 1073, 1079, 1087, 1088, 1090, 1096, 1100, 1103, 1105, 1107, 1109, 1127, 1131, 1132, 1133, 1137, 1139, 1141, 1144, 1149, 1156, 1164, 1174, 1175, 1177, 1187, 1193, 1198, 1201, 1203, 1205, 1216, 1222, 1225, 1226, 1227, 1228, 1231, 1233, 1235, 1240, 1247, 1256, 1266, 1278, 1280, 1281, 1291, 1302, 1309, 1314, 1316, 1319, 1328, 1337, 1339, 1340, 1342, 1344, 1348, 1358, 1367, 1378, 1390, 1405, 1406, 1407, 1422, 1432, 1441, 1448, 1452, 1454, 1465, 1469, 1472, 1473, 1474, 1475, 1477, 1481, 1487, 1496, 1507, 1520, 1534, 1550, 1551, 1552, 1553, 1567, 1579, 1590, 1599, 1605, 1609, 1618]
[2024-05-31 22:38:21] [INFO ] Actually due to overlaps returned [299, 417, 517, 600, 673, 848, 911, 971, 1216, 1328, 1618, 4, 11, 12, 48, 61, 105, 107, 120, 131, 154, 173, 176, 177, 178, 201, 212, 250, 252, 272, 305, 309, 335, 344, 376, 377, 378, 388, 395, 423, 426, 445, 452, 480, 488, 493, 503, 524, 527, 542, 547, 569, 571, 576, 579, 588, 607, 610, 611, 612, 621, 642, 650, 652, 659, 680, 683, 684, 685, 705, 706, 707, 710, 712, 718, 735, 739, 740, 753, 761, 765, 767, 774, 794, 797, 800, 801, 818, 823, 824, 825, 828, 830, 836, 854, 857, 858, 874, 877, 882, 884, 889, 892, 898, 917, 922, 923, 936, 938, 944, 946, 949, 957, 978, 981, 982, 994, 1000, 1010, 1011, 1021, 1028, 1048, 1051, 1052, 1068, 1073, 1087, 1088, 1100, 1107, 1127, 1131, 1132, 1149, 1156, 1174, 1175, 1193, 1198, 1203, 1222, 1225, 1226, 1227, 1247, 1256, 1278, 1280, 1302, 1309, 1316, 1337, 1339, 1367, 1378, 1405, 1406, 1432, 1441, 1465, 1469, 1472, 1473, 1474, 1507, 1520, 1550, 1551, 1552, 1579, 1590, 1609]
Discarding 173 places :
Implicit Place search using SMT only with invariants took 1541 ms to find 173 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1566/1739 places, 2920/2920 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 1501 transition count 2855
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 1501 transition count 2855
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 195 place count 1436 transition count 2790
Iterating global reduction 0 with 65 rules applied. Total rules applied 260 place count 1436 transition count 2790
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 267 place count 1429 transition count 2769
Iterating global reduction 0 with 7 rules applied. Total rules applied 274 place count 1429 transition count 2769
Applied a total of 274 rules in 184 ms. Remains 1429 /1566 variables (removed 137) and now considering 2769/2920 (removed 151) transitions.
[2024-05-31 22:38:21] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
// Phase 1: matrix 2421 rows 1429 cols
[2024-05-31 22:38:22] [INFO ] Computed 260 invariants in 46 ms
[2024-05-31 22:38:22] [INFO ] Implicit Places using invariants in 990 ms returned [7, 11, 17, 23, 34, 70, 85, 101, 134, 141, 146, 165, 167, 171, 178, 208, 221, 235, 260, 264, 271, 285, 287, 292, 299, 326, 337, 348, 367, 369, 373, 390, 392, 398, 401, 419, 428, 439, 455, 457, 460, 480, 482, 484, 486, 503, 510, 518, 525, 527, 533, 547, 549, 551, 553, 563, 568, 575, 585, 587, 592, 605, 607, 609, 611, 613, 618, 621, 623, 627, 629, 632, 644, 646, 650, 652, 654, 657, 659, 664, 669, 671, 676, 694, 698, 701, 703, 705, 710, 712, 716, 718, 721, 735, 739, 742, 744, 746, 751, 755, 762, 764, 768, 783, 787, 789, 791, 793, 797, 802, 807, 809, 812, 829, 831, 833, 835, 837, 847, 854, 860, 863, 866, 869, 886, 888, 893, 895, 897, 909, 918, 924, 930, 932, 935, 952, 956, 958, 960, 963, 981, 992, 1002, 1014, 1017, 1031, 1033, 1035, 1037, 1042, 1066, 1079, 1089, 1110, 1114, 1127, 1129, 1131, 1135, 1145, 1175, 1190, 1205, 1229, 1233, 1235, 1246, 1248, 1252, 1258, 1267, 1303, 1318, 1332, 1362, 1368]
Discarding 176 places :
Implicit Place search using SMT only with invariants took 994 ms to find 176 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1253/1739 places, 2769/2920 transitions.
Applied a total of 0 rules in 55 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2909 ms. Remains : 1253/1739 places, 2769/2920 transitions.
RANDOM walk for 40000 steps (1731 resets) in 654 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (336 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (344 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 68650 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 5
Probabilistic random walk after 68650 steps, saw 30452 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:38:26] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
// Phase 1: matrix 2421 rows 1253 cols
[2024-05-31 22:38:26] [INFO ] Computed 84 invariants in 25 ms
[2024-05-31 22:38:26] [INFO ] State equation strengthened by 968 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 749/932 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/932 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/933 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 316/1249 variables, 49/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/1253 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1253 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2421/3674 variables, 1253/1337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3674 variables, 968/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3674 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/3674 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3674/3674 variables, and 2305 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2622 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 1253/1253 constraints, ReadFeed: 968/968 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 749/932 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:29] [INFO ] Deduced a trap composed of 184 places in 145 ms of which 2 ms to minimize.
[2024-05-31 22:38:29] [INFO ] Deduced a trap composed of 182 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:38:30] [INFO ] Deduced a trap composed of 236 places in 191 ms of which 4 ms to minimize.
[2024-05-31 22:38:30] [INFO ] Deduced a trap composed of 261 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:38:30] [INFO ] Deduced a trap composed of 269 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:38:30] [INFO ] Deduced a trap composed of 146 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:38:30] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 184 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 219 places in 146 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 183 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 223 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 223 places in 153 ms of which 2 ms to minimize.
[2024-05-31 22:38:31] [INFO ] Deduced a trap composed of 146 places in 153 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 223 places in 150 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 186 places in 145 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 1 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 209 places in 143 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 196 places in 149 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 224 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:38:32] [INFO ] Deduced a trap composed of 186 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/932 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:33] [INFO ] Deduced a trap composed of 187 places in 141 ms of which 2 ms to minimize.
[2024-05-31 22:38:33] [INFO ] Deduced a trap composed of 198 places in 145 ms of which 2 ms to minimize.
[2024-05-31 22:38:33] [INFO ] Deduced a trap composed of 226 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:38:33] [INFO ] Deduced a trap composed of 225 places in 140 ms of which 2 ms to minimize.
[2024-05-31 22:38:33] [INFO ] Deduced a trap composed of 200 places in 143 ms of which 2 ms to minimize.
[2024-05-31 22:38:34] [INFO ] Deduced a trap composed of 227 places in 139 ms of which 2 ms to minimize.
[2024-05-31 22:38:34] [INFO ] Deduced a trap composed of 226 places in 137 ms of which 3 ms to minimize.
[2024-05-31 22:38:34] [INFO ] Deduced a trap composed of 227 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:34] [INFO ] Deduced a trap composed of 186 places in 360 ms of which 5 ms to minimize.
[2024-05-31 22:38:35] [INFO ] Deduced a trap composed of 186 places in 348 ms of which 5 ms to minimize.
[2024-05-31 22:38:35] [INFO ] Deduced a trap composed of 200 places in 379 ms of which 5 ms to minimize.
[2024-05-31 22:38:35] [INFO ] Deduced a trap composed of 213 places in 367 ms of which 6 ms to minimize.
[2024-05-31 22:38:36] [INFO ] Deduced a trap composed of 184 places in 383 ms of which 6 ms to minimize.
[2024-05-31 22:38:36] [INFO ] Deduced a trap composed of 207 places in 227 ms of which 4 ms to minimize.
[2024-05-31 22:38:37] [INFO ] Deduced a trap composed of 221 places in 357 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/933 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:37] [INFO ] Deduced a trap composed of 196 places in 160 ms of which 2 ms to minimize.
[2024-05-31 22:38:37] [INFO ] Deduced a trap composed of 197 places in 159 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:38] [INFO ] Deduced a trap composed of 224 places in 166 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:38] [INFO ] Deduced a trap composed of 225 places in 163 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 316/1249 variables, 49/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:39] [INFO ] Deduced a trap composed of 7 places in 587 ms of which 7 ms to minimize.
[2024-05-31 22:38:39] [INFO ] Deduced a trap composed of 229 places in 635 ms of which 8 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 230 places in 624 ms of which 8 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Deduced a trap composed of 289 places in 618 ms of which 8 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Deduced a trap composed of 315 places in 609 ms of which 8 ms to minimize.
[2024-05-31 22:38:42] [INFO ] Deduced a trap composed of 256 places in 598 ms of which 8 ms to minimize.
[2024-05-31 22:38:43] [INFO ] Deduced a trap composed of 264 places in 628 ms of which 8 ms to minimize.
[2024-05-31 22:38:43] [INFO ] Deduced a trap composed of 260 places in 617 ms of which 7 ms to minimize.
[2024-05-31 22:38:44] [INFO ] Deduced a trap composed of 322 places in 611 ms of which 8 ms to minimize.
[2024-05-31 22:38:45] [INFO ] Deduced a trap composed of 274 places in 628 ms of which 12 ms to minimize.
[2024-05-31 22:38:45] [INFO ] Deduced a trap composed of 339 places in 600 ms of which 7 ms to minimize.
[2024-05-31 22:38:46] [INFO ] Deduced a trap composed of 306 places in 639 ms of which 7 ms to minimize.
[2024-05-31 22:38:47] [INFO ] Deduced a trap composed of 240 places in 611 ms of which 7 ms to minimize.
[2024-05-31 22:38:47] [INFO ] Deduced a trap composed of 252 places in 608 ms of which 8 ms to minimize.
[2024-05-31 22:38:48] [INFO ] Deduced a trap composed of 331 places in 630 ms of which 7 ms to minimize.
[2024-05-31 22:38:48] [INFO ] Deduced a trap composed of 42 places in 615 ms of which 8 ms to minimize.
[2024-05-31 22:38:49] [INFO ] Deduced a trap composed of 220 places in 618 ms of which 8 ms to minimize.
[2024-05-31 22:38:50] [INFO ] Deduced a trap composed of 242 places in 596 ms of which 7 ms to minimize.
[2024-05-31 22:38:50] [INFO ] Deduced a trap composed of 236 places in 629 ms of which 8 ms to minimize.
[2024-05-31 22:38:51] [INFO ] Deduced a trap composed of 338 places in 626 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1249 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:38:52] [INFO ] Deduced a trap composed of 345 places in 627 ms of which 8 ms to minimize.
[2024-05-31 22:38:52] [INFO ] Deduced a trap composed of 359 places in 624 ms of which 8 ms to minimize.
[2024-05-31 22:38:53] [INFO ] Deduced a trap composed of 218 places in 623 ms of which 8 ms to minimize.
[2024-05-31 22:38:54] [INFO ] Deduced a trap composed of 221 places in 622 ms of which 8 ms to minimize.
[2024-05-31 22:38:54] [INFO ] Deduced a trap composed of 337 places in 617 ms of which 8 ms to minimize.
[2024-05-31 22:38:55] [INFO ] Deduced a trap composed of 239 places in 641 ms of which 8 ms to minimize.
[2024-05-31 22:38:56] [INFO ] Deduced a trap composed of 313 places in 616 ms of which 8 ms to minimize.
[2024-05-31 22:38:56] [INFO ] Deduced a trap composed of 268 places in 625 ms of which 8 ms to minimize.
[2024-05-31 22:38:57] [INFO ] Deduced a trap composed of 266 places in 625 ms of which 8 ms to minimize.
[2024-05-31 22:38:58] [INFO ] Deduced a trap composed of 256 places in 622 ms of which 9 ms to minimize.
[2024-05-31 22:38:58] [INFO ] Deduced a trap composed of 328 places in 586 ms of which 8 ms to minimize.
[2024-05-31 22:38:59] [INFO ] Deduced a trap composed of 245 places in 594 ms of which 8 ms to minimize.
[2024-05-31 22:39:00] [INFO ] Deduced a trap composed of 314 places in 597 ms of which 8 ms to minimize.
[2024-05-31 22:39:00] [INFO ] Deduced a trap composed of 286 places in 599 ms of which 7 ms to minimize.
[2024-05-31 22:39:01] [INFO ] Deduced a trap composed of 263 places in 550 ms of which 8 ms to minimize.
[2024-05-31 22:39:01] [INFO ] Deduced a trap composed of 384 places in 566 ms of which 8 ms to minimize.
[2024-05-31 22:39:02] [INFO ] Deduced a trap composed of 274 places in 566 ms of which 8 ms to minimize.
[2024-05-31 22:39:03] [INFO ] Deduced a trap composed of 264 places in 567 ms of which 7 ms to minimize.
[2024-05-31 22:39:03] [INFO ] Deduced a trap composed of 310 places in 572 ms of which 8 ms to minimize.
[2024-05-31 22:39:04] [INFO ] Deduced a trap composed of 317 places in 576 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1249 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:39:04] [INFO ] Deduced a trap composed of 338 places in 563 ms of which 8 ms to minimize.
[2024-05-31 22:39:05] [INFO ] Deduced a trap composed of 259 places in 601 ms of which 8 ms to minimize.
[2024-05-31 22:39:06] [INFO ] Deduced a trap composed of 368 places in 596 ms of which 8 ms to minimize.
[2024-05-31 22:39:06] [INFO ] Deduced a trap composed of 240 places in 607 ms of which 8 ms to minimize.
[2024-05-31 22:39:07] [INFO ] Deduced a trap composed of 244 places in 606 ms of which 8 ms to minimize.
[2024-05-31 22:39:08] [INFO ] Deduced a trap composed of 342 places in 616 ms of which 8 ms to minimize.
[2024-05-31 22:39:08] [INFO ] Deduced a trap composed of 363 places in 587 ms of which 7 ms to minimize.
[2024-05-31 22:39:09] [INFO ] Deduced a trap composed of 265 places in 592 ms of which 8 ms to minimize.
[2024-05-31 22:39:09] [INFO ] Deduced a trap composed of 365 places in 592 ms of which 7 ms to minimize.
[2024-05-31 22:39:10] [INFO ] Deduced a trap composed of 368 places in 592 ms of which 8 ms to minimize.
[2024-05-31 22:39:11] [INFO ] Deduced a trap composed of 219 places in 585 ms of which 7 ms to minimize.
[2024-05-31 22:39:11] [INFO ] Deduced a trap composed of 331 places in 593 ms of which 8 ms to minimize.
[2024-05-31 22:39:12] [INFO ] Deduced a trap composed of 219 places in 589 ms of which 7 ms to minimize.
[2024-05-31 22:39:13] [INFO ] Deduced a trap composed of 333 places in 603 ms of which 7 ms to minimize.
[2024-05-31 22:39:13] [INFO ] Deduced a trap composed of 342 places in 591 ms of which 8 ms to minimize.
[2024-05-31 22:39:14] [INFO ] Deduced a trap composed of 278 places in 615 ms of which 7 ms to minimize.
[2024-05-31 22:39:14] [INFO ] Deduced a trap composed of 268 places in 579 ms of which 7 ms to minimize.
[2024-05-31 22:39:15] [INFO ] Deduced a trap composed of 237 places in 587 ms of which 8 ms to minimize.
[2024-05-31 22:39:16] [INFO ] Deduced a trap composed of 243 places in 575 ms of which 8 ms to minimize.
[2024-05-31 22:39:16] [INFO ] Deduced a trap composed of 398 places in 587 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1249 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:39:17] [INFO ] Deduced a trap composed of 324 places in 583 ms of which 7 ms to minimize.
[2024-05-31 22:39:18] [INFO ] Deduced a trap composed of 327 places in 582 ms of which 7 ms to minimize.
[2024-05-31 22:39:18] [INFO ] Deduced a trap composed of 237 places in 597 ms of which 8 ms to minimize.
[2024-05-31 22:39:19] [INFO ] Deduced a trap composed of 340 places in 587 ms of which 8 ms to minimize.
[2024-05-31 22:39:19] [INFO ] Deduced a trap composed of 244 places in 607 ms of which 8 ms to minimize.
[2024-05-31 22:39:20] [INFO ] Deduced a trap composed of 339 places in 595 ms of which 8 ms to minimize.
[2024-05-31 22:39:21] [INFO ] Deduced a trap composed of 295 places in 581 ms of which 8 ms to minimize.
[2024-05-31 22:39:21] [INFO ] Deduced a trap composed of 230 places in 588 ms of which 8 ms to minimize.
[2024-05-31 22:39:22] [INFO ] Deduced a trap composed of 223 places in 588 ms of which 7 ms to minimize.
[2024-05-31 22:39:23] [INFO ] Deduced a trap composed of 304 places in 587 ms of which 8 ms to minimize.
[2024-05-31 22:39:23] [INFO ] Deduced a trap composed of 331 places in 592 ms of which 8 ms to minimize.
[2024-05-31 22:39:24] [INFO ] Deduced a trap composed of 345 places in 597 ms of which 7 ms to minimize.
[2024-05-31 22:39:24] [INFO ] Deduced a trap composed of 259 places in 595 ms of which 8 ms to minimize.
[2024-05-31 22:39:25] [INFO ] Deduced a trap composed of 332 places in 617 ms of which 8 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 265 places in 563 ms of which 8 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 247 places in 563 ms of which 8 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 265 places in 587 ms of which 9 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 319 places in 569 ms of which 8 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 241 places in 574 ms of which 8 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 303 places in 566 ms of which 7 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1249 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 282 places in 605 ms of which 8 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 242 places in 575 ms of which 7 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 232 places in 578 ms of which 8 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 280 places in 566 ms of which 8 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 257 places in 571 ms of which 7 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 330 places in 568 ms of which 8 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 249 places in 555 ms of which 8 ms to minimize.
[2024-05-31 22:39:34] [INFO ] Deduced a trap composed of 253 places in 555 ms of which 11 ms to minimize.
[2024-05-31 22:39:34] [INFO ] Deduced a trap composed of 268 places in 569 ms of which 8 ms to minimize.
[2024-05-31 22:39:35] [INFO ] Deduced a trap composed of 318 places in 551 ms of which 7 ms to minimize.
[2024-05-31 22:39:36] [INFO ] Deduced a trap composed of 240 places in 565 ms of which 8 ms to minimize.
[2024-05-31 22:39:36] [INFO ] Deduced a trap composed of 279 places in 570 ms of which 8 ms to minimize.
[2024-05-31 22:39:37] [INFO ] Deduced a trap composed of 278 places in 582 ms of which 9 ms to minimize.
[2024-05-31 22:39:37] [INFO ] Deduced a trap composed of 278 places in 567 ms of which 8 ms to minimize.
[2024-05-31 22:39:38] [INFO ] Deduced a trap composed of 255 places in 572 ms of which 8 ms to minimize.
[2024-05-31 22:39:39] [INFO ] Deduced a trap composed of 274 places in 578 ms of which 8 ms to minimize.
[2024-05-31 22:39:39] [INFO ] Deduced a trap composed of 277 places in 567 ms of which 8 ms to minimize.
[2024-05-31 22:39:40] [INFO ] Deduced a trap composed of 343 places in 502 ms of which 8 ms to minimize.
[2024-05-31 22:39:40] [INFO ] Deduced a trap composed of 352 places in 520 ms of which 8 ms to minimize.
[2024-05-31 22:39:41] [INFO ] Deduced a trap composed of 308 places in 510 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1249 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:39:42] [INFO ] Deduced a trap composed of 341 places in 554 ms of which 7 ms to minimize.
[2024-05-31 22:39:42] [INFO ] Deduced a trap composed of 266 places in 569 ms of which 7 ms to minimize.
[2024-05-31 22:39:43] [INFO ] Deduced a trap composed of 229 places in 576 ms of which 7 ms to minimize.
[2024-05-31 22:39:44] [INFO ] Deduced a trap composed of 233 places in 565 ms of which 8 ms to minimize.
[2024-05-31 22:39:44] [INFO ] Deduced a trap composed of 358 places in 533 ms of which 7 ms to minimize.
SMT process timed out in 78030ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 183 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 2769/2769 transitions.
Applied a total of 0 rules in 58 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1253/1253 places, 2769/2769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 2769/2769 transitions.
Applied a total of 0 rules in 56 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
[2024-05-31 22:39:44] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-31 22:39:44] [INFO ] Invariant cache hit.
[2024-05-31 22:39:45] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-31 22:39:45] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-31 22:39:45] [INFO ] Invariant cache hit.
[2024-05-31 22:39:46] [INFO ] State equation strengthened by 968 read => feed constraints.
[2024-05-31 22:39:59] [INFO ] Implicit Places using invariants and state equation in 13931 ms returned []
Implicit Place search using SMT with State Equation took 14647 ms to find 0 implicit places.
[2024-05-31 22:39:59] [INFO ] Redundant transitions in 124 ms returned []
Running 2752 sub problems to find dead transitions.
[2024-05-31 22:39:59] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-31 22:39:59] [INFO ] Invariant cache hit.
[2024-05-31 22:39:59] [INFO ] State equation strengthened by 968 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2752 unsolved
SMT process timed out in 33076ms, After SMT, problems are : Problem set: 0 solved, 2752 unsolved
Search for dead transitions found 0 dead transitions in 33101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47951 ms. Remains : 1253/1253 places, 2769/2769 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 736 edges and 1253 vertex of which 10 / 1253 are part of one of the 2 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 508 transitions.
Graph (complete) has 3721 edges and 1245 vertex of which 1242 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 1230 transition count 2232
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 86 rules applied. Total rules applied 129 place count 1201 transition count 2175
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 53 rules applied. Total rules applied 182 place count 1173 transition count 2150
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 30 rules applied. Total rules applied 212 place count 1163 transition count 2130
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 15 rules applied. Total rules applied 227 place count 1153 transition count 2125
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 236 place count 1148 transition count 2121
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 236 place count 1148 transition count 2084
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 310 place count 1111 transition count 2084
Discarding 90 places :
Symmetric choice reduction at 6 with 90 rule applications. Total rules 400 place count 1021 transition count 1994
Iterating global reduction 6 with 90 rules applied. Total rules applied 490 place count 1021 transition count 1994
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 513 place count 1021 transition count 1971
Performed 427 Post agglomeration using F-continuation condition.Transition count delta: 427
Deduced a syphon composed of 427 places in 1 ms
Reduce places removed 427 places and 0 transitions.
Iterating global reduction 7 with 854 rules applied. Total rules applied 1367 place count 594 transition count 1544
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 7 with 150 rules applied. Total rules applied 1517 place count 594 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1519 place count 592 transition count 1390
Iterating global reduction 8 with 2 rules applied. Total rules applied 1521 place count 592 transition count 1390
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -147
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 1571 place count 567 transition count 1537
Drop transitions (Redundant composition of simpler transitions.) removed 332 transitions
Redundant transition composition rules discarded 332 transitions
Iterating global reduction 8 with 332 rules applied. Total rules applied 1903 place count 567 transition count 1205
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 1913 place count 567 transition count 1195
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1923 place count 557 transition count 1195
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1931 place count 549 transition count 1176
Iterating global reduction 10 with 8 rules applied. Total rules applied 1939 place count 549 transition count 1176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1943 place count 549 transition count 1172
Free-agglomeration rule applied 16 times.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1959 place count 549 transition count 1156
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1976 place count 533 transition count 1155
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 1986 place count 533 transition count 1145
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 12 with 18 rules applied. Total rules applied 2004 place count 533 transition count 1127
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2024 place count 515 transition count 1125
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 2032 place count 515 transition count 1117
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 13 with 34 rules applied. Total rules applied 2066 place count 515 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2067 place count 515 transition count 1116
Partial Post-agglomeration rule applied 161 times.
Drop transitions (Partial Post agglomeration) removed 161 transitions
Iterating global reduction 13 with 161 rules applied. Total rules applied 2228 place count 515 transition count 1116
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2231 place count 512 transition count 1110
Iterating global reduction 13 with 3 rules applied. Total rules applied 2234 place count 512 transition count 1110
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2235 place count 512 transition count 1109
Applied a total of 2235 rules in 651 ms. Remains 512 /1253 variables (removed 741) and now considering 1109/2769 (removed 1660) transitions.
Running SMT prover for 5 properties.
[2024-05-31 22:40:33] [INFO ] Flow matrix only has 1061 transitions (discarded 48 similar events)
// Phase 1: matrix 1061 rows 512 cols
[2024-05-31 22:40:33] [INFO ] Computed 69 invariants in 18 ms
[2024-05-31 22:40:33] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-31 22:40:33] [INFO ] [Real]Absence check using 20 positive and 49 generalized place invariants in 15 ms returned sat
[2024-05-31 22:40:33] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 22:40:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-31 22:40:33] [INFO ] [Nat]Absence check using 20 positive and 49 generalized place invariants in 9 ms returned sat
[2024-05-31 22:40:34] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 22:40:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-31 22:40:35] [INFO ] After 803ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 22:40:36] [INFO ] After 1721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 22:40:37] [INFO ] After 3893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 4870 ms.
[2024-05-31 22:40:37] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-31 22:40:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 2769 transitions and 12693 arcs took 26 ms.
[2024-05-31 22:40:37] [INFO ] Flatten gal took : 199 ms
Total runtime 205583 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-04
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-08
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-11
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-13

BK_STOP 1717195238261

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1342/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1342/inv_1_
rfs formula name MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1342/inv_2_
rfs formula name MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1342/inv_3_
rfs formula name MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1342/inv_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="MultiCrashLeafsetExtension-PT-S16C03"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C03, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C03.tgz
mv MultiCrashLeafsetExtension-PT-S16C03 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;