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.r245-tall-171654349000031.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 4.6M 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-S16C05-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716567943101

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:25:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 16:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:25:44] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-24 16:25:44] [INFO ] Transformed 4914 places.
[2024-05-24 16:25:44] [INFO ] Transformed 6913 transitions.
[2024-05-24 16:25:44] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (766 resets) in 1831 ms. (21 steps per ms) remains 10/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (200 resets) in 894 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (200 resets) in 350 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 455 ms. (87 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (200 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 266 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (200 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (200 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (200 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
[2024-05-24 16:25:46] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-24 16:25:46] [INFO ] Computed 535 invariants in 377 ms
[2024-05-24 16:25:46] [INFO ] State equation strengthened by 1906 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 707/886 variables, 25/35 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 16/902 variables, 16/53 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 2723/3625 variables, 201/254 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3625 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1289/4914 variables, 281/535 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4914 variables, 0/535 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11555/11555 variables, and 5449 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 487/487 constraints, State Equation: 4914/4914 constraints, ReadFeed: 0/1906 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 716/840 variables, 19/28 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 1/29 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 16:25:52] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 17 ms to minimize.
[2024-05-24 16:25:52] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:25:53] [INFO ] Deduced a trap composed of 173 places in 293 ms of which 6 ms to minimize.
[2024-05-24 16:25:53] [INFO ] Deduced a trap composed of 173 places in 415 ms of which 5 ms to minimize.
[2024-05-24 16:25:53] [INFO ] Deduced a trap composed of 208 places in 402 ms of which 5 ms to minimize.
[2024-05-24 16:25:54] [INFO ] Deduced a trap composed of 203 places in 285 ms of which 5 ms to minimize.
[2024-05-24 16:25:54] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 5 ms to minimize.
[2024-05-24 16:25:54] [INFO ] Deduced a trap composed of 215 places in 282 ms of which 5 ms to minimize.
[2024-05-24 16:25:55] [INFO ] Deduced a trap composed of 215 places in 281 ms of which 5 ms to minimize.
[2024-05-24 16:25:55] [INFO ] Deduced a trap composed of 220 places in 289 ms of which 5 ms to minimize.
[2024-05-24 16:25:55] [INFO ] Deduced a trap composed of 235 places in 277 ms of which 5 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 220 places in 273 ms of which 4 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 4 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 257 places in 282 ms of which 4 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 220 places in 291 ms of which 4 ms to minimize.
[2024-05-24 16:25:57] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 5 ms to minimize.
SMT process timed out in 10872ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.19 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1236 transitions
Trivial Post-agglo rules discarded 1236 transitions
Performed 1236 trivial Post agglomeration. Transition count delta: 1236
Iterating post reduction 0 with 1236 rules applied. Total rules applied 1237 place count 4884 transition count 5677
Reduce places removed 1236 places and 0 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 1 with 1347 rules applied. Total rules applied 2584 place count 3648 transition count 5566
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 2 with 111 rules applied. Total rules applied 2695 place count 3537 transition count 5566
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 2695 place count 3537 transition count 5410
Deduced a syphon composed of 156 places in 5 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 3007 place count 3381 transition count 5410
Discarding 1164 places :
Symmetric choice reduction at 3 with 1164 rule applications. Total rules 4171 place count 2217 transition count 4246
Iterating global reduction 3 with 1164 rules applied. Total rules applied 5335 place count 2217 transition count 4246
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5335 place count 2217 transition count 4243
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 5341 place count 2214 transition count 4243
Discarding 195 places :
Symmetric choice reduction at 3 with 195 rule applications. Total rules 5536 place count 2019 transition count 3268
Iterating global reduction 3 with 195 rules applied. Total rules applied 5731 place count 2019 transition count 3268
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 5755 place count 2007 transition count 3256
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 3 with 81 rules applied. Total rules applied 5836 place count 2007 transition count 3175
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 5917 place count 1926 transition count 3175
Partial Free-agglomeration rule applied 105 times.
Drop transitions (Partial Free agglomeration) removed 105 transitions
Iterating global reduction 4 with 105 rules applied. Total rules applied 6022 place count 1926 transition count 3175
Applied a total of 6022 rules in 1421 ms. Remains 1926 /4914 variables (removed 2988) and now considering 3175/6913 (removed 3738) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1437 ms. Remains : 1926/4914 places, 3175/6913 transitions.
RANDOM walk for 40000 steps (1072 resets) in 695 ms. (57 steps per ms) remains 6/7 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (216 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (216 resets) in 357 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (216 resets) in 147 ms. (270 steps per ms) remains 5/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (216 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (216 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
[2024-05-24 16:25:59] [INFO ] Flow matrix only has 2822 transitions (discarded 353 similar events)
// Phase 1: matrix 2822 rows 1926 cols
[2024-05-24 16:25:59] [INFO ] Computed 505 invariants in 41 ms
[2024-05-24 16:25:59] [INFO ] State equation strengthened by 1126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1217/1293 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1293 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1293 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/1297 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 549/1846 variables, 401/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1846 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 12/1858 variables, 12/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1858 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 68/1926 variables, 68/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1926 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2822/4748 variables, 1926/2431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (INCLUDED_ONLY) 0/4748 variables, 1126/3557 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4748 variables, 0/3557 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/4748 variables, 0/3557 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4748/4748 variables, and 3557 constraints, problems are : Problem set: 2 solved, 3 unsolved in 3258 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 472/472 constraints, State Equation: 1926/1926 constraints, ReadFeed: 1126/1126 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1227/1233 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:03] [INFO ] Deduced a trap composed of 349 places in 221 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1233 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1233 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 27/1260 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:03] [INFO ] Deduced a trap composed of 487 places in 417 ms of which 6 ms to minimize.
[2024-05-24 16:26:04] [INFO ] Deduced a trap composed of 519 places in 396 ms of which 5 ms to minimize.
[2024-05-24 16:26:04] [INFO ] Deduced a trap composed of 533 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:26:05] [INFO ] Deduced a trap composed of 487 places in 427 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1260 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:05] [INFO ] Deduced a trap composed of 536 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:26:06] [INFO ] Deduced a trap composed of 526 places in 421 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1260 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:06] [INFO ] Deduced a trap composed of 527 places in 396 ms of which 6 ms to minimize.
[2024-05-24 16:26:06] [INFO ] Deduced a trap composed of 527 places in 399 ms of which 6 ms to minimize.
[2024-05-24 16:26:07] [INFO ] Deduced a trap composed of 535 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:26:07] [INFO ] Deduced a trap composed of 515 places in 434 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1260 variables, 4/20 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:08] [INFO ] Deduced a trap composed of 539 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:26:08] [INFO ] Deduced a trap composed of 494 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:26:09] [INFO ] Deduced a trap composed of 558 places in 387 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1260 variables, 3/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1260 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 567/1827 variables, 397/420 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:10] [INFO ] Deduced a trap composed of 20 places in 1097 ms of which 13 ms to minimize.
[2024-05-24 16:26:11] [INFO ] Deduced a trap composed of 262 places in 1131 ms of which 13 ms to minimize.
[2024-05-24 16:26:13] [INFO ] Deduced a trap composed of 197 places in 1172 ms of which 13 ms to minimize.
[2024-05-24 16:26:14] [INFO ] Deduced a trap composed of 187 places in 1153 ms of which 13 ms to minimize.
[2024-05-24 16:26:15] [INFO ] Deduced a trap composed of 204 places in 1243 ms of which 16 ms to minimize.
[2024-05-24 16:26:16] [INFO ] Deduced a trap composed of 43 places in 1108 ms of which 12 ms to minimize.
[2024-05-24 16:26:17] [INFO ] Deduced a trap composed of 205 places in 1190 ms of which 13 ms to minimize.
[2024-05-24 16:26:19] [INFO ] Deduced a trap composed of 229 places in 1157 ms of which 13 ms to minimize.
[2024-05-24 16:26:20] [INFO ] Deduced a trap composed of 273 places in 1142 ms of which 12 ms to minimize.
[2024-05-24 16:26:21] [INFO ] Deduced a trap composed of 314 places in 1133 ms of which 14 ms to minimize.
[2024-05-24 16:26:22] [INFO ] Deduced a trap composed of 358 places in 1135 ms of which 12 ms to minimize.
[2024-05-24 16:26:23] [INFO ] Deduced a trap composed of 253 places in 1144 ms of which 12 ms to minimize.
[2024-05-24 16:26:24] [INFO ] Deduced a trap composed of 302 places in 1125 ms of which 12 ms to minimize.
[2024-05-24 16:26:26] [INFO ] Deduced a trap composed of 245 places in 1166 ms of which 12 ms to minimize.
[2024-05-24 16:26:27] [INFO ] Deduced a trap composed of 254 places in 1112 ms of which 12 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 225 places in 1153 ms of which 12 ms to minimize.
[2024-05-24 16:26:29] [INFO ] Deduced a trap composed of 297 places in 1105 ms of which 12 ms to minimize.
[2024-05-24 16:26:30] [INFO ] Deduced a trap composed of 171 places in 1146 ms of which 13 ms to minimize.
[2024-05-24 16:26:32] [INFO ] Deduced a trap composed of 373 places in 1171 ms of which 12 ms to minimize.
[2024-05-24 16:26:33] [INFO ] Deduced a trap composed of 285 places in 1179 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1827 variables, 20/440 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 16:26:34] [INFO ] Deduced a trap composed of 307 places in 1051 ms of which 15 ms to minimize.
[2024-05-24 16:26:35] [INFO ] Deduced a trap composed of 300 places in 1049 ms of which 11 ms to minimize.
[2024-05-24 16:26:36] [INFO ] Deduced a trap composed of 43 places in 1068 ms of which 11 ms to minimize.
[2024-05-24 16:26:37] [INFO ] Deduced a trap composed of 73 places in 1101 ms of which 12 ms to minimize.
[2024-05-24 16:26:38] [INFO ] Deduced a trap composed of 392 places in 1103 ms of which 12 ms to minimize.
[2024-05-24 16:26:39] [INFO ] Deduced a trap composed of 262 places in 1072 ms of which 13 ms to minimize.
[2024-05-24 16:26:41] [INFO ] Deduced a trap composed of 304 places in 1049 ms of which 13 ms to minimize.
[2024-05-24 16:26:42] [INFO ] Deduced a trap composed of 264 places in 1062 ms of which 12 ms to minimize.
[2024-05-24 16:26:43] [INFO ] Deduced a trap composed of 241 places in 1153 ms of which 12 ms to minimize.
[2024-05-24 16:26:44] [INFO ] Deduced a trap composed of 261 places in 1190 ms of which 13 ms to minimize.
[2024-05-24 16:26:45] [INFO ] Deduced a trap composed of 241 places in 1161 ms of which 12 ms to minimize.
[2024-05-24 16:26:47] [INFO ] Deduced a trap composed of 230 places in 1180 ms of which 11 ms to minimize.
[2024-05-24 16:26:48] [INFO ] Deduced a trap composed of 222 places in 1124 ms of which 13 ms to minimize.
SMT process timed out in 48792ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 3175/3175 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1926 transition count 3162
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1913 transition count 3162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 1913 transition count 3148
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 1899 transition count 3148
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 87 place count 1866 transition count 3043
Iterating global reduction 2 with 33 rules applied. Total rules applied 120 place count 1866 transition count 3043
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 1866 transition count 3042
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 1865 transition count 3042
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 136 place count 1851 transition count 2972
Iterating global reduction 2 with 14 rules applied. Total rules applied 150 place count 1851 transition count 2972
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 1847 transition count 2968
Free-agglomeration rule (complex) applied 85 times.
Iterating global reduction 2 with 85 rules applied. Total rules applied 243 place count 1847 transition count 3763
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 328 place count 1762 transition count 3763
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 339 place count 1751 transition count 3752
Iterating global reduction 3 with 11 rules applied. Total rules applied 350 place count 1751 transition count 3752
Applied a total of 350 rules in 455 ms. Remains 1751 /1926 variables (removed 175) and now considering 3752/3175 (removed -577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 1751/1926 places, 3752/3175 transitions.
RANDOM walk for 40000 steps (1266 resets) in 944 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (224 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (224 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (224 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 53872 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 3
Probabilistic random walk after 53872 steps, saw 24078 distinct states, run finished after 3007 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 16:26:52] [INFO ] Flow matrix only has 3364 transitions (discarded 388 similar events)
// Phase 1: matrix 3364 rows 1751 cols
[2024-05-24 16:26:52] [INFO ] Computed 505 invariants in 62 ms
[2024-05-24 16:26:52] [INFO ] State equation strengthened by 1878 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1063/1069 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:26:53] [INFO ] Deduced a trap composed of 310 places in 519 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1069 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 28/1097 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:26:53] [INFO ] Deduced a trap composed of 377 places in 471 ms of which 8 ms to minimize.
[2024-05-24 16:26:54] [INFO ] Deduced a trap composed of 405 places in 446 ms of which 5 ms to minimize.
[2024-05-24 16:26:54] [INFO ] Deduced a trap composed of 394 places in 439 ms of which 4 ms to minimize.
[2024-05-24 16:26:55] [INFO ] Deduced a trap composed of 399 places in 493 ms of which 5 ms to minimize.
[2024-05-24 16:26:55] [INFO ] Deduced a trap composed of 404 places in 458 ms of which 5 ms to minimize.
[2024-05-24 16:26:56] [INFO ] Deduced a trap composed of 404 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:26:56] [INFO ] Deduced a trap composed of 409 places in 440 ms of which 5 ms to minimize.
[2024-05-24 16:26:57] [INFO ] Deduced a trap composed of 394 places in 431 ms of which 5 ms to minimize.
[2024-05-24 16:26:57] [INFO ] Deduced a trap composed of 397 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:26:58] [INFO ] Deduced a trap composed of 403 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:26:58] [INFO ] Deduced a trap composed of 454 places in 449 ms of which 4 ms to minimize.
[2024-05-24 16:26:59] [INFO ] Deduced a trap composed of 430 places in 449 ms of which 4 ms to minimize.
[2024-05-24 16:26:59] [INFO ] Deduced a trap composed of 418 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:26:59] [INFO ] Deduced a trap composed of 420 places in 427 ms of which 5 ms to minimize.
[2024-05-24 16:27:00] [INFO ] Deduced a trap composed of 394 places in 414 ms of which 5 ms to minimize.
[2024-05-24 16:27:00] [INFO ] Deduced a trap composed of 399 places in 444 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1097 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 535/1632 variables, 377/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:27:02] [INFO ] Deduced a trap composed of 5 places in 1282 ms of which 11 ms to minimize.
[2024-05-24 16:27:03] [INFO ] Deduced a trap composed of 185 places in 1294 ms of which 12 ms to minimize.
[2024-05-24 16:27:05] [INFO ] Deduced a trap composed of 199 places in 1224 ms of which 11 ms to minimize.
[2024-05-24 16:27:06] [INFO ] Deduced a trap composed of 181 places in 1231 ms of which 11 ms to minimize.
[2024-05-24 16:27:07] [INFO ] Deduced a trap composed of 197 places in 1212 ms of which 11 ms to minimize.
[2024-05-24 16:27:08] [INFO ] Deduced a trap composed of 197 places in 1276 ms of which 11 ms to minimize.
[2024-05-24 16:27:10] [INFO ] Deduced a trap composed of 218 places in 1286 ms of which 11 ms to minimize.
[2024-05-24 16:27:11] [INFO ] Deduced a trap composed of 27 places in 1277 ms of which 10 ms to minimize.
[2024-05-24 16:27:12] [INFO ] Deduced a trap composed of 257 places in 1236 ms of which 11 ms to minimize.
[2024-05-24 16:27:14] [INFO ] Deduced a trap composed of 235 places in 1273 ms of which 11 ms to minimize.
[2024-05-24 16:27:15] [INFO ] Deduced a trap composed of 220 places in 1290 ms of which 10 ms to minimize.
[2024-05-24 16:27:16] [INFO ] Deduced a trap composed of 214 places in 1243 ms of which 11 ms to minimize.
[2024-05-24 16:27:17] [INFO ] Deduced a trap composed of 232 places in 1229 ms of which 12 ms to minimize.
[2024-05-24 16:27:19] [INFO ] Deduced a trap composed of 191 places in 1213 ms of which 11 ms to minimize.
[2024-05-24 16:27:20] [INFO ] Deduced a trap composed of 233 places in 1220 ms of which 11 ms to minimize.
[2024-05-24 16:27:21] [INFO ] Deduced a trap composed of 212 places in 1235 ms of which 11 ms to minimize.
[2024-05-24 16:27:22] [INFO ] Deduced a trap composed of 200 places in 1209 ms of which 11 ms to minimize.
[2024-05-24 16:27:24] [INFO ] Deduced a trap composed of 203 places in 1213 ms of which 11 ms to minimize.
[2024-05-24 16:27:25] [INFO ] Deduced a trap composed of 222 places in 1221 ms of which 10 ms to minimize.
[2024-05-24 16:27:26] [INFO ] Deduced a trap composed of 210 places in 1235 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1632 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:27:28] [INFO ] Deduced a trap composed of 176 places in 1300 ms of which 10 ms to minimize.
[2024-05-24 16:27:29] [INFO ] Deduced a trap composed of 195 places in 1270 ms of which 10 ms to minimize.
[2024-05-24 16:27:30] [INFO ] Deduced a trap composed of 201 places in 1261 ms of which 11 ms to minimize.
[2024-05-24 16:27:31] [INFO ] Deduced a trap composed of 194 places in 1241 ms of which 11 ms to minimize.
[2024-05-24 16:27:33] [INFO ] Deduced a trap composed of 199 places in 1271 ms of which 11 ms to minimize.
[2024-05-24 16:27:34] [INFO ] Deduced a trap composed of 189 places in 1308 ms of which 11 ms to minimize.
[2024-05-24 16:27:35] [INFO ] Deduced a trap composed of 192 places in 1263 ms of which 11 ms to minimize.
[2024-05-24 16:27:37] [INFO ] Deduced a trap composed of 210 places in 1188 ms of which 11 ms to minimize.
[2024-05-24 16:27:38] [INFO ] Deduced a trap composed of 234 places in 1302 ms of which 11 ms to minimize.
[2024-05-24 16:27:39] [INFO ] Deduced a trap composed of 189 places in 1301 ms of which 11 ms to minimize.
[2024-05-24 16:27:41] [INFO ] Deduced a trap composed of 211 places in 1282 ms of which 13 ms to minimize.
[2024-05-24 16:27:42] [INFO ] Deduced a trap composed of 150 places in 1211 ms of which 11 ms to minimize.
[2024-05-24 16:27:43] [INFO ] Deduced a trap composed of 162 places in 1222 ms of which 14 ms to minimize.
[2024-05-24 16:27:44] [INFO ] Deduced a trap composed of 174 places in 1280 ms of which 10 ms to minimize.
[2024-05-24 16:27:46] [INFO ] Deduced a trap composed of 187 places in 1216 ms of which 11 ms to minimize.
[2024-05-24 16:27:47] [INFO ] Deduced a trap composed of 165 places in 1168 ms of which 11 ms to minimize.
[2024-05-24 16:27:48] [INFO ] Deduced a trap composed of 214 places in 1294 ms of which 12 ms to minimize.
[2024-05-24 16:27:50] [INFO ] Deduced a trap composed of 193 places in 1320 ms of which 11 ms to minimize.
[2024-05-24 16:27:51] [INFO ] Deduced a trap composed of 201 places in 1170 ms of which 11 ms to minimize.
[2024-05-24 16:27:52] [INFO ] Deduced a trap composed of 198 places in 1309 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1632 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:27:54] [INFO ] Deduced a trap composed of 167 places in 1315 ms of which 10 ms to minimize.
[2024-05-24 16:27:55] [INFO ] Deduced a trap composed of 153 places in 1214 ms of which 11 ms to minimize.
[2024-05-24 16:27:56] [INFO ] Deduced a trap composed of 177 places in 1297 ms of which 12 ms to minimize.
[2024-05-24 16:27:57] [INFO ] Deduced a trap composed of 173 places in 1209 ms of which 11 ms to minimize.
[2024-05-24 16:27:59] [INFO ] Deduced a trap composed of 242 places in 1100 ms of which 9 ms to minimize.
[2024-05-24 16:28:00] [INFO ] Deduced a trap composed of 174 places in 1319 ms of which 12 ms to minimize.
[2024-05-24 16:28:01] [INFO ] Deduced a trap composed of 195 places in 1260 ms of which 11 ms to minimize.
[2024-05-24 16:28:03] [INFO ] Deduced a trap composed of 261 places in 1232 ms of which 11 ms to minimize.
[2024-05-24 16:28:04] [INFO ] Deduced a trap composed of 232 places in 1205 ms of which 11 ms to minimize.
[2024-05-24 16:28:05] [INFO ] Deduced a trap composed of 180 places in 1273 ms of which 11 ms to minimize.
[2024-05-24 16:28:06] [INFO ] Deduced a trap composed of 189 places in 1247 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1632 variables, 11/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:08] [INFO ] Deduced a trap composed of 219 places in 1227 ms of which 12 ms to minimize.
SMT process timed out in 76049ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1751/1751 places, 3752/3752 transitions.
Applied a total of 0 rules in 100 ms. Remains 1751 /1751 variables (removed 0) and now considering 3752/3752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1751/1751 places, 3752/3752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1751/1751 places, 3752/3752 transitions.
Applied a total of 0 rules in 95 ms. Remains 1751 /1751 variables (removed 0) and now considering 3752/3752 (removed 0) transitions.
[2024-05-24 16:28:08] [INFO ] Flow matrix only has 3364 transitions (discarded 388 similar events)
[2024-05-24 16:28:08] [INFO ] Invariant cache hit.
[2024-05-24 16:28:12] [INFO ] Implicit Places using invariants in 3557 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 115, 125, 133, 139, 143, 145, 158, 164, 166, 167, 168, 169, 170, 171, 173, 177, 183, 192, 202, 214, 227, 239, 240, 241, 242, 243, 244, 254, 262, 268, 272, 274, 276, 289, 295, 297, 298, 299, 300, 301, 302, 304, 306, 310, 317, 325, 335, 346, 356, 357, 358, 359, 360, 361, 369, 375, 379, 381, 383, 385, 398, 404, 406, 407, 408, 409, 410, 411, 413, 415, 417, 422, 428, 436, 445, 453, 454, 455, 456, 457, 458, 464, 468, 470, 472, 474, 476, 489, 495, 497, 498, 499, 500, 501, 502, 504, 506, 508, 511, 515, 521, 528, 534, 535, 536, 537, 538, 539, 543, 545, 547, 549, 551, 553, 566, 573, 575, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 594, 599, 603, 604, 605, 606, 607, 608, 610, 612, 614, 616, 618, 620, 633, 639, 641, 642, 643, 644, 645, 646, 648, 650, 652, 654, 656, 658, 661, 663, 664, 665, 666, 667, 668, 670, 672, 674, 676, 678, 680, 693, 699, 701, 702, 703, 704, 705, 706, 708, 710, 712, 714, 716, 718, 720, 722, 723, 724, 725, 726, 727, 729, 731, 733, 735, 737, 739, 752, 754, 757, 759, 760, 761, 762, 763, 764, 766, 768, 770, 772, 774, 776, 778, 780, 781, 782, 783, 784, 785, 787, 789, 791, 793, 795, 797, 810, 816, 818, 819, 820, 821, 822, 823, 825, 827, 829, 831, 833, 835, 837, 839, 840, 841, 842, 843, 844, 846, 848, 850, 852, 854, 856, 869, 875, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 896, 899, 900, 901, 902, 903, 904, 906, 908, 910, 912, 914, 916, 929, 935, 937, 938, 939, 940, 941, 942, 944, 946, 948, 950, 952, 954, 958, 963, 964, 965, 966, 967, 968, 972, 974, 976, 978, 980, 982, 995, 1001, 1003, 1004, 1005, 1006, 1007, 1008, 1010, 1012, 1014, 1016, 1019, 1023, 1029, 1036, 1037, 1038, 1039, 1040, 1041, 1047, 1051, 1053, 1055, 1057, 1059, 1072, 1078, 1081, 1082, 1083, 1084, 1085, 1086, 1088, 1090, 1092, 1094, 1099, 1105, 1113, 1122, 1123, 1124, 1125, 1126, 1127, 1135, 1141, 1145, 1147, 1149, 1151, 1164, 1170, 1172, 1173, 1174, 1175, 1176, 1177, 1179, 1181, 1183, 1187, 1194, 1202, 1212, 1223, 1224, 1225, 1226, 1227, 1228, 1238, 1246, 1252, 1256, 1258, 1260, 1273, 1279, 1281, 1282, 1283, 1284, 1285, 1286, 1288, 1290, 1294, 1300, 1309, 1319, 1331, 1344, 1345, 1346, 1347, 1348, 1349, 1361, 1371, 1379, 1385, 1389, 1391, 1404, 1406, 1409, 1411, 1412, 1413, 1414, 1415, 1416, 1418, 1422, 1428, 1436, 1447, 1459, 1473, 1488, 1489, 1490, 1491, 1492, 1493, 1507, 1519, 1529, 1537, 1543, 1547, 1560]
[2024-05-24 16:28:12] [INFO ] Actually due to overlaps returned [810, 869, 929, 995, 1072, 1164, 1273, 1404, 1560, 158, 289, 398, 489, 566, 633, 693, 752, 4, 9, 10, 11, 12, 13, 98, 99, 100, 101, 102, 166, 167, 168, 169, 170, 239, 240, 241, 242, 243, 297, 298, 299, 300, 301, 356, 357, 358, 359, 360, 406, 407, 408, 409, 410, 453, 454, 455, 456, 457, 497, 498, 499, 500, 501, 534, 535, 536, 537, 538, 575, 576, 577, 578, 579, 603, 604, 605, 606, 607, 641, 642, 643, 644, 645, 663, 664, 665, 666, 667, 701, 702, 703, 704, 705, 722, 723, 724, 725, 726, 754, 759, 760, 761, 762, 763, 780, 781, 782, 783, 784, 818, 819, 820, 821, 822, 839, 840, 841, 842, 843, 877, 878, 879, 880, 881, 899, 900, 901, 902, 903, 937, 938, 939, 940, 941, 963, 964, 965, 966, 967, 1003, 1004, 1005, 1006, 1007, 1036, 1037, 1038, 1039, 1040, 1081, 1082, 1083, 1084, 1085, 1122, 1123, 1124, 1125, 1126, 1172, 1173, 1174, 1175, 1176, 1223, 1224, 1225, 1226, 1227, 1281, 1282, 1283, 1284, 1285, 1344, 1345, 1346, 1347, 1348, 1406, 1411, 1412, 1413, 1414, 1415, 1488, 1489, 1490, 1491, 1492]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 3581 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1561/1751 places, 3752/3752 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1401 transition count 3592
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1401 transition count 3592
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1241 transition count 3432
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1241 transition count 3432
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1241 transition count 3429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1238 transition count 3429
Applied a total of 646 rules in 254 ms. Remains 1238 /1561 variables (removed 323) and now considering 3429/3752 (removed 323) transitions.
[2024-05-24 16:28:12] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
// Phase 1: matrix 3041 rows 1238 cols
[2024-05-24 16:28:12] [INFO ] Computed 315 invariants in 27 ms
[2024-05-24 16:28:14] [INFO ] Implicit Places using invariants in 2285 ms returned [6, 8, 12, 18, 26, 37, 49, 63, 78, 92, 104, 114, 122, 128, 132, 134, 151, 153, 155, 159, 165, 174, 184, 196, 209, 221, 231, 239, 245, 249, 251, 253, 261, 263, 265, 267, 271, 278, 286, 296, 307, 317, 325, 331, 335, 337, 339, 341, 349, 351, 353, 355, 357, 362, 368, 376, 385, 393, 399, 403, 405, 407, 409, 411, 419, 421, 423, 425, 427, 430, 434, 440, 447, 453, 457, 459, 461, 463, 465, 467, 476, 478, 480, 482, 484, 486, 488, 492, 497, 501, 503, 505, 507, 509, 511, 513, 521, 523, 525, 527, 529, 531, 533, 535, 538, 540, 542, 544, 546, 548, 550, 552, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 588, 590, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 626, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 671, 673, 675, 677, 679, 681, 683, 685, 687, 690, 692, 694, 696, 698, 700, 702, 710, 712, 714, 716, 718, 720, 722, 724, 728, 733, 737, 739, 741, 743, 745, 747, 755, 757, 759, 761, 763, 765, 768, 772, 778, 785, 791, 795, 797, 799, 801, 803, 811, 814, 816, 818, 820, 822, 827, 833, 841, 850, 858, 864, 868, 870, 872, 874, 882, 884, 886, 888, 890, 894, 901, 909, 919, 930, 940, 948, 954, 958, 960, 962, 970, 972, 974, 976, 980, 986, 995, 1005, 1017, 1030, 1042, 1052, 1060, 1066, 1070, 1072, 1078, 1080, 1082, 1086, 1092, 1100, 1111, 1123, 1137, 1152, 1166, 1178, 1188, 1196, 1202, 1206]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2298 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 966/1751 places, 3429/3752 transitions.
Applied a total of 0 rules in 92 ms. Remains 966 /966 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6323 ms. Remains : 966/1751 places, 3429/3752 transitions.
RANDOM walk for 40000 steps (1354 resets) in 1032 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (161 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (137 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (156 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 65056 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 65056 steps, saw 27234 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 16:28:18] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
// Phase 1: matrix 3041 rows 966 cols
[2024-05-24 16:28:18] [INFO ] Computed 43 invariants in 30 ms
[2024-05-24 16:28:18] [INFO ] State equation strengthened by 1878 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 881/887 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:18] [INFO ] Deduced a trap composed of 310 places in 451 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 19/906 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/932 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 24/956 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/966 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3041/4007 variables, 966/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4007 variables, 1878/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4007 variables, 0/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4007 variables, 0/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4007/4007 variables, and 2888 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2759 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 966/966 constraints, ReadFeed: 1878/1878 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 881/887 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 19/906 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:21] [INFO ] Deduced a trap composed of 86 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:28:22] [INFO ] Deduced a trap composed of 87 places in 520 ms of which 5 ms to minimize.
[2024-05-24 16:28:22] [INFO ] Deduced a trap composed of 68 places in 530 ms of which 5 ms to minimize.
[2024-05-24 16:28:23] [INFO ] Deduced a trap composed of 85 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:28:23] [INFO ] Deduced a trap composed of 93 places in 489 ms of which 6 ms to minimize.
[2024-05-24 16:28:24] [INFO ] Deduced a trap composed of 81 places in 490 ms of which 6 ms to minimize.
[2024-05-24 16:28:24] [INFO ] Deduced a trap composed of 69 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:28:25] [INFO ] Deduced a trap composed of 69 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:28:26] [INFO ] Deduced a trap composed of 69 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:28:26] [INFO ] Deduced a trap composed of 101 places in 476 ms of which 9 ms to minimize.
[2024-05-24 16:28:27] [INFO ] Deduced a trap composed of 76 places in 470 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 26/932 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:27] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:28:28] [INFO ] Deduced a trap composed of 27 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:28:28] [INFO ] Deduced a trap composed of 125 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:28:29] [INFO ] Deduced a trap composed of 162 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:28:29] [INFO ] Deduced a trap composed of 154 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:28:30] [INFO ] Deduced a trap composed of 149 places in 481 ms of which 5 ms to minimize.
[2024-05-24 16:28:30] [INFO ] Deduced a trap composed of 150 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:28:31] [INFO ] Deduced a trap composed of 145 places in 423 ms of which 6 ms to minimize.
[2024-05-24 16:28:31] [INFO ] Deduced a trap composed of 157 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:28:31] [INFO ] Deduced a trap composed of 144 places in 449 ms of which 6 ms to minimize.
[2024-05-24 16:28:32] [INFO ] Deduced a trap composed of 146 places in 436 ms of which 6 ms to minimize.
[2024-05-24 16:28:32] [INFO ] Deduced a trap composed of 166 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:28:33] [INFO ] Deduced a trap composed of 96 places in 537 ms of which 6 ms to minimize.
[2024-05-24 16:28:34] [INFO ] Deduced a trap composed of 86 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:28:34] [INFO ] Deduced a trap composed of 96 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:28:35] [INFO ] Deduced a trap composed of 205 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:28:35] [INFO ] Deduced a trap composed of 101 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:28:36] [INFO ] Deduced a trap composed of 86 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:28:36] [INFO ] Deduced a trap composed of 121 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:28:37] [INFO ] Deduced a trap composed of 27 places in 496 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:37] [INFO ] Deduced a trap composed of 146 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:28:38] [INFO ] Deduced a trap composed of 167 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:28:38] [INFO ] Deduced a trap composed of 163 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:28:39] [INFO ] Deduced a trap composed of 147 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:28:39] [INFO ] Deduced a trap composed of 151 places in 470 ms of which 7 ms to minimize.
[2024-05-24 16:28:40] [INFO ] Deduced a trap composed of 148 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:28:40] [INFO ] Deduced a trap composed of 150 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:28:41] [INFO ] Deduced a trap composed of 162 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:28:41] [INFO ] Deduced a trap composed of 145 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:28:42] [INFO ] Deduced a trap composed of 161 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:28:42] [INFO ] Deduced a trap composed of 129 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:28:42] [INFO ] Deduced a trap composed of 169 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:28:43] [INFO ] Deduced a trap composed of 57 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:28:44] [INFO ] Deduced a trap composed of 86 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:28:44] [INFO ] Deduced a trap composed of 128 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:28:45] [INFO ] Deduced a trap composed of 204 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:28:45] [INFO ] Deduced a trap composed of 189 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:28:46] [INFO ] Deduced a trap composed of 221 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:28:46] [INFO ] Deduced a trap composed of 210 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:28:47] [INFO ] Deduced a trap composed of 206 places in 461 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:47] [INFO ] Deduced a trap composed of 151 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:28:48] [INFO ] Deduced a trap composed of 153 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:28:48] [INFO ] Deduced a trap composed of 128 places in 428 ms of which 5 ms to minimize.
[2024-05-24 16:28:48] [INFO ] Deduced a trap composed of 128 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:28:49] [INFO ] Deduced a trap composed of 121 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:28:49] [INFO ] Deduced a trap composed of 131 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:28:50] [INFO ] Deduced a trap composed of 155 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:28:50] [INFO ] Deduced a trap composed of 133 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:28:51] [INFO ] Deduced a trap composed of 145 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:28:51] [INFO ] Deduced a trap composed of 146 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:28:52] [INFO ] Deduced a trap composed of 151 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:28:52] [INFO ] Deduced a trap composed of 151 places in 417 ms of which 5 ms to minimize.
[2024-05-24 16:28:53] [INFO ] Deduced a trap composed of 160 places in 421 ms of which 6 ms to minimize.
[2024-05-24 16:28:53] [INFO ] Deduced a trap composed of 154 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:28:53] [INFO ] Deduced a trap composed of 161 places in 425 ms of which 5 ms to minimize.
[2024-05-24 16:28:54] [INFO ] Deduced a trap composed of 177 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:28:54] [INFO ] Deduced a trap composed of 163 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:28:55] [INFO ] Deduced a trap composed of 159 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:28:55] [INFO ] Deduced a trap composed of 162 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:28:56] [INFO ] Deduced a trap composed of 155 places in 440 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:28:56] [INFO ] Deduced a trap composed of 150 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:28:57] [INFO ] Deduced a trap composed of 152 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:28:57] [INFO ] Deduced a trap composed of 153 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:28:58] [INFO ] Deduced a trap composed of 165 places in 416 ms of which 5 ms to minimize.
[2024-05-24 16:28:58] [INFO ] Deduced a trap composed of 176 places in 420 ms of which 8 ms to minimize.
[2024-05-24 16:28:58] [INFO ] Deduced a trap composed of 167 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:28:59] [INFO ] Deduced a trap composed of 168 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:28:59] [INFO ] Deduced a trap composed of 150 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:29:00] [INFO ] Deduced a trap composed of 153 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:29:00] [INFO ] Deduced a trap composed of 169 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:29:01] [INFO ] Deduced a trap composed of 167 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:29:01] [INFO ] Deduced a trap composed of 170 places in 432 ms of which 6 ms to minimize.
[2024-05-24 16:29:02] [INFO ] Deduced a trap composed of 146 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:29:02] [INFO ] Deduced a trap composed of 147 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:29:02] [INFO ] Deduced a trap composed of 161 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:29:03] [INFO ] Deduced a trap composed of 135 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:29:03] [INFO ] Deduced a trap composed of 137 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:29:04] [INFO ] Deduced a trap composed of 169 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:29:04] [INFO ] Deduced a trap composed of 170 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:29:05] [INFO ] Deduced a trap composed of 151 places in 443 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:29:05] [INFO ] Deduced a trap composed of 146 places in 450 ms of which 5 ms to minimize.
[2024-05-24 16:29:06] [INFO ] Deduced a trap composed of 147 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:29:06] [INFO ] Deduced a trap composed of 147 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:29:07] [INFO ] Deduced a trap composed of 155 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:29:07] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:29:08] [INFO ] Deduced a trap composed of 163 places in 429 ms of which 5 ms to minimize.
[2024-05-24 16:29:08] [INFO ] Deduced a trap composed of 170 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:29:08] [INFO ] Deduced a trap composed of 169 places in 403 ms of which 6 ms to minimize.
[2024-05-24 16:29:09] [INFO ] Deduced a trap composed of 188 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:29:09] [INFO ] Deduced a trap composed of 170 places in 396 ms of which 5 ms to minimize.
[2024-05-24 16:29:10] [INFO ] Deduced a trap composed of 168 places in 417 ms of which 5 ms to minimize.
[2024-05-24 16:29:10] [INFO ] Deduced a trap composed of 170 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:29:11] [INFO ] Deduced a trap composed of 153 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:29:11] [INFO ] Deduced a trap composed of 154 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:29:12] [INFO ] Deduced a trap composed of 147 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:29:12] [INFO ] Deduced a trap composed of 155 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:29:13] [INFO ] Deduced a trap composed of 155 places in 449 ms of which 6 ms to minimize.
[2024-05-24 16:29:13] [INFO ] Deduced a trap composed of 170 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:29:13] [INFO ] Deduced a trap composed of 133 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:29:14] [INFO ] Deduced a trap composed of 139 places in 428 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:29:14] [INFO ] Deduced a trap composed of 146 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:29:15] [INFO ] Deduced a trap composed of 149 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:29:15] [INFO ] Deduced a trap composed of 147 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:29:16] [INFO ] Deduced a trap composed of 149 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:29:16] [INFO ] Deduced a trap composed of 164 places in 463 ms of which 7 ms to minimize.
[2024-05-24 16:29:17] [INFO ] Deduced a trap composed of 149 places in 450 ms of which 7 ms to minimize.
[2024-05-24 16:29:17] [INFO ] Deduced a trap composed of 138 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:29:18] [INFO ] Deduced a trap composed of 133 places in 427 ms of which 5 ms to minimize.
[2024-05-24 16:29:18] [INFO ] Deduced a trap composed of 134 places in 455 ms of which 11 ms to minimize.
[2024-05-24 16:29:19] [INFO ] Deduced a trap composed of 138 places in 397 ms of which 6 ms to minimize.
[2024-05-24 16:29:19] [INFO ] Deduced a trap composed of 155 places in 468 ms of which 7 ms to minimize.
[2024-05-24 16:29:20] [INFO ] Deduced a trap composed of 139 places in 417 ms of which 5 ms to minimize.
[2024-05-24 16:29:20] [INFO ] Deduced a trap composed of 155 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:29:20] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:29:21] [INFO ] Deduced a trap composed of 154 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:29:21] [INFO ] Deduced a trap composed of 155 places in 429 ms of which 5 ms to minimize.
[2024-05-24 16:29:22] [INFO ] Deduced a trap composed of 116 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:29:22] [INFO ] Deduced a trap composed of 149 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:29:23] [INFO ] Deduced a trap composed of 113 places in 449 ms of which 6 ms to minimize.
[2024-05-24 16:29:23] [INFO ] Deduced a trap composed of 187 places in 431 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:29:24] [INFO ] Deduced a trap composed of 161 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:29:24] [INFO ] Deduced a trap composed of 163 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:29:25] [INFO ] Deduced a trap composed of 185 places in 434 ms of which 5 ms to minimize.
[2024-05-24 16:29:25] [INFO ] Deduced a trap composed of 170 places in 437 ms of which 6 ms to minimize.
[2024-05-24 16:29:26] [INFO ] Deduced a trap composed of 163 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:29:26] [INFO ] Deduced a trap composed of 170 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:29:26] [INFO ] Deduced a trap composed of 164 places in 434 ms of which 6 ms to minimize.
[2024-05-24 16:29:27] [INFO ] Deduced a trap composed of 170 places in 416 ms of which 5 ms to minimize.
[2024-05-24 16:29:27] [INFO ] Deduced a trap composed of 165 places in 406 ms of which 6 ms to minimize.
[2024-05-24 16:29:28] [INFO ] Deduced a trap composed of 171 places in 436 ms of which 6 ms to minimize.
[2024-05-24 16:29:28] [INFO ] Deduced a trap composed of 150 places in 453 ms of which 5 ms to minimize.
[2024-05-24 16:29:29] [INFO ] Deduced a trap composed of 191 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:29:29] [INFO ] Deduced a trap composed of 200 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:29:30] [INFO ] Deduced a trap composed of 201 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:29:30] [INFO ] Deduced a trap composed of 219 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:29:31] [INFO ] Deduced a trap composed of 222 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:29:31] [INFO ] Deduced a trap composed of 212 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:29:32] [INFO ] Deduced a trap composed of 194 places in 447 ms of which 5 ms to minimize.
[2024-05-24 16:29:32] [INFO ] Deduced a trap composed of 207 places in 438 ms of which 5 ms to minimize.
[2024-05-24 16:29:32] [INFO ] Deduced a trap composed of 208 places in 435 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:29:33] [INFO ] Deduced a trap composed of 177 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:29:34] [INFO ] Deduced a trap composed of 117 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:29:34] [INFO ] Deduced a trap composed of 118 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:29:35] [INFO ] Deduced a trap composed of 185 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:29:35] [INFO ] Deduced a trap composed of 120 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:29:35] [INFO ] Deduced a trap composed of 191 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:29:36] [INFO ] Deduced a trap composed of 130 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:29:36] [INFO ] Deduced a trap composed of 203 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:29:37] [INFO ] Deduced a trap composed of 202 places in 411 ms of which 5 ms to minimize.
[2024-05-24 16:29:37] [INFO ] Deduced a trap composed of 203 places in 433 ms of which 5 ms to minimize.
[2024-05-24 16:29:38] [INFO ] Deduced a trap composed of 212 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:29:38] [INFO ] Deduced a trap composed of 203 places in 438 ms of which 5 ms to minimize.
[2024-05-24 16:29:39] [INFO ] Deduced a trap composed of 201 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:29:39] [INFO ] Deduced a trap composed of 204 places in 436 ms of which 5 ms to minimize.
[2024-05-24 16:29:40] [INFO ] Deduced a trap composed of 203 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:29:40] [INFO ] Deduced a trap composed of 221 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:29:41] [INFO ] Deduced a trap composed of 206 places in 461 ms of which 5 ms to minimize.
[2024-05-24 16:29:41] [INFO ] Deduced a trap composed of 207 places in 456 ms of which 5 ms to minimize.
[2024-05-24 16:29:42] [INFO ] Deduced a trap composed of 208 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:29:42] [INFO ] Deduced a trap composed of 209 places in 398 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:29:43] [INFO ] Deduced a trap composed of 134 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:29:43] [INFO ] Deduced a trap composed of 143 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:29:44] [INFO ] Deduced a trap composed of 179 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:29:44] [INFO ] Deduced a trap composed of 144 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:29:44] [INFO ] Deduced a trap composed of 147 places in 408 ms of which 5 ms to minimize.
[2024-05-24 16:29:45] [INFO ] Deduced a trap composed of 144 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:29:45] [INFO ] Deduced a trap composed of 144 places in 413 ms of which 5 ms to minimize.
[2024-05-24 16:29:46] [INFO ] Deduced a trap composed of 144 places in 461 ms of which 5 ms to minimize.
[2024-05-24 16:29:46] [INFO ] Deduced a trap composed of 148 places in 427 ms of which 5 ms to minimize.
[2024-05-24 16:29:47] [INFO ] Deduced a trap composed of 208 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:29:47] [INFO ] Deduced a trap composed of 224 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:29:48] [INFO ] Deduced a trap composed of 206 places in 412 ms of which 5 ms to minimize.
[2024-05-24 16:29:48] [INFO ] Deduced a trap composed of 224 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:29:48] [INFO ] Deduced a trap composed of 223 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:29:49] [INFO ] Deduced a trap composed of 210 places in 415 ms of which 5 ms to minimize.
[2024-05-24 16:29:49] [INFO ] Deduced a trap composed of 222 places in 406 ms of which 5 ms to minimize.
[2024-05-24 16:29:50] [INFO ] Deduced a trap composed of 222 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:29:50] [INFO ] Deduced a trap composed of 193 places in 395 ms of which 5 ms to minimize.
[2024-05-24 16:29:51] [INFO ] Deduced a trap composed of 206 places in 406 ms of which 5 ms to minimize.
SMT process timed out in 92940ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3429/3429 transitions.
Applied a total of 0 rules in 81 ms. Remains 966 /966 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 966/966 places, 3429/3429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3429/3429 transitions.
Applied a total of 0 rules in 78 ms. Remains 966 /966 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
[2024-05-24 16:29:51] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-24 16:29:51] [INFO ] Invariant cache hit.
[2024-05-24 16:29:52] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2024-05-24 16:29:52] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-24 16:29:52] [INFO ] Invariant cache hit.
[2024-05-24 16:29:53] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-24 16:30:19] [INFO ] Implicit Places using invariants and state equation in 27253 ms returned []
Implicit Place search using SMT with State Equation took 28428 ms to find 0 implicit places.
[2024-05-24 16:30:19] [INFO ] Redundant transitions in 205 ms returned []
Running 3367 sub problems to find dead transitions.
[2024-05-24 16:30:19] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-24 16:30:19] [INFO ] Invariant cache hit.
[2024-05-24 16:30:19] [INFO ] State equation strengthened by 1878 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/964 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3367 unsolved
SMT process timed out in 50342ms, After SMT, problems are : Problem set: 0 solved, 3367 unsolved
Search for dead transitions found 0 dead transitions in 50382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79120 ms. Remains : 966/966 places, 3429/3429 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1039 edges and 966 vertex of which 16 / 966 are part of one of the 1 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 259 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 650 transitions.
Graph (complete) has 3990 edges and 951 vertex of which 938 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 921 transition count 2689
Reduce places removed 88 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 1 with 253 rules applied. Total rules applied 345 place count 833 transition count 2524
Reduce places removed 82 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 2 with 218 rules applied. Total rules applied 563 place count 751 transition count 2388
Reduce places removed 59 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 3 with 166 rules applied. Total rules applied 729 place count 692 transition count 2281
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 4 with 139 rules applied. Total rules applied 868 place count 639 transition count 2195
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 5 with 101 rules applied. Total rules applied 969 place count 602 transition count 2131
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 6 with 78 rules applied. Total rules applied 1047 place count 570 transition count 2085
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 7 with 46 rules applied. Total rules applied 1093 place count 551 transition count 2058
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 26 rules applied. Total rules applied 1119 place count 538 transition count 2045
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 9 with 15 rules applied. Total rules applied 1134 place count 533 transition count 2035
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1146 place count 523 transition count 2033
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 1146 place count 523 transition count 2023
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1166 place count 513 transition count 2023
Discarding 228 places :
Symmetric choice reduction at 11 with 228 rule applications. Total rules 1394 place count 285 transition count 957
Iterating global reduction 11 with 228 rules applied. Total rules applied 1622 place count 285 transition count 957
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 11 with 195 rules applied. Total rules applied 1817 place count 285 transition count 762
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 4 rules applied. Total rules applied 1821 place count 282 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1822 place count 281 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1822 place count 281 transition count 760
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1824 place count 280 transition count 760
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1830 place count 274 transition count 751
Iterating global reduction 14 with 6 rules applied. Total rules applied 1836 place count 274 transition count 751
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1839 place count 271 transition count 748
Iterating global reduction 14 with 3 rules applied. Total rules applied 1842 place count 271 transition count 748
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 14 with 314 rules applied. Total rules applied 2156 place count 114 transition count 591
Drop transitions (Empty/Sink Transition effects.) removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 14 with 151 rules applied. Total rules applied 2307 place count 114 transition count 440
Discarding 46 places :
Symmetric choice reduction at 15 with 46 rule applications. Total rules 2353 place count 68 transition count 172
Iterating global reduction 15 with 46 rules applied. Total rules applied 2399 place count 68 transition count 172
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 15 with 34 rules applied. Total rules applied 2433 place count 68 transition count 138
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2434 place count 67 transition count 134
Iterating global reduction 16 with 1 rules applied. Total rules applied 2435 place count 67 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2437 place count 66 transition count 141
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2439 place count 64 transition count 130
Iterating global reduction 16 with 2 rules applied. Total rules applied 2441 place count 64 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2444 place count 64 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 2454 place count 64 transition count 117
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 1 rules applied. Total rules applied 2455 place count 64 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 18 with 2 rules applied. Total rules applied 2457 place count 63 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2458 place count 62 transition count 115
Discarding 8 places :
Symmetric choice reduction at 20 with 8 rule applications. Total rules 2466 place count 54 transition count 75
Iterating global reduction 20 with 8 rules applied. Total rules applied 2474 place count 54 transition count 75
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 20 with 15 rules applied. Total rules applied 2489 place count 54 transition count 60
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 2491 place count 52 transition count 58
Iterating global reduction 21 with 2 rules applied. Total rules applied 2493 place count 52 transition count 58
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 21 with 7 rules applied. Total rules applied 2500 place count 52 transition count 51
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 21 with 7 rules applied. Total rules applied 2507 place count 45 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 2508 place count 45 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2509 place count 45 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 2510 place count 44 transition count 49
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 23 with 15 rules applied. Total rules applied 2525 place count 44 transition count 49
Applied a total of 2525 rules in 569 ms. Remains 44 /966 variables (removed 922) and now considering 49/3429 (removed 3380) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 49 rows 44 cols
[2024-05-24 16:31:10] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 16:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-24 16:31:10] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-24 16:31:10] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 16:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 16:31:10] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-24 16:31:11] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 16:31:11] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 16:31:11] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 728 ms.
[2024-05-24 16:31:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-24 16:31:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 966 places, 3429 transitions and 17028 arcs took 22 ms.
[2024-05-24 16:31:11] [INFO ] Flatten gal took : 280 ms
Total runtime 327263 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 966
TRANSITIONS: 3429
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.082s, Sys 0.008s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1565
MODEL NAME: /home/mcc/execution/406/model
966 places, 3429 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
MEDDLY ERROR: Insufficient memory

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-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r245-tall-171654349000031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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