Execution Chart

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

Trace from the execution

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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:48:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:48:29] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-31 22:48:29] [INFO ] Transformed 4914 places.
[2024-05-31 22:48:29] [INFO ] Transformed 6913 transitions.
[2024-05-31 22:48:29] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (768 resets) in 2668 ms. (14 steps per ms) remains 9/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
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (200 resets) in 464 ms. (86 steps per ms) remains 8/9 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (200 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (200 resets) in 409 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (200 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (200 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (200 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (200 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (200 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
[2024-05-31 22:48:31] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-31 22:48:32] [INFO ] Computed 535 invariants in 524 ms
[2024-05-31 22:48:32] [INFO ] State equation strengthened by 1906 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 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) 716/849 variables, 28/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/849 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 16/865 variables, 16/51 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 7 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) 2692/3557 variables, 191/242 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3557 variables, 0/242 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1357/4914 variables, 293/535 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4914 variables, 0/535 constraints. Problems are: Problem set: 3 solved, 5 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, 5 unsolved in 5072 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 725/801 variables, 20/24 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 1/25 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 22:48:38] [INFO ] Deduced a trap composed of 128 places in 343 ms of which 43 ms to minimize.
[2024-05-31 22:48:38] [INFO ] Deduced a trap composed of 200 places in 308 ms of which 5 ms to minimize.
[2024-05-31 22:48:38] [INFO ] Deduced a trap composed of 216 places in 317 ms of which 10 ms to minimize.
[2024-05-31 22:48:39] [INFO ] Deduced a trap composed of 220 places in 307 ms of which 6 ms to minimize.
[2024-05-31 22:48:39] [INFO ] Deduced a trap composed of 262 places in 281 ms of which 5 ms to minimize.
[2024-05-31 22:48:39] [INFO ] Deduced a trap composed of 243 places in 286 ms of which 4 ms to minimize.
[2024-05-31 22:48:40] [INFO ] Deduced a trap composed of 271 places in 309 ms of which 5 ms to minimize.
[2024-05-31 22:48:40] [INFO ] Deduced a trap composed of 243 places in 286 ms of which 5 ms to minimize.
[2024-05-31 22:48:40] [INFO ] Deduced a trap composed of 256 places in 276 ms of which 4 ms to minimize.
[2024-05-31 22:48:40] [INFO ] Deduced a trap composed of 220 places in 268 ms of which 4 ms to minimize.
[2024-05-31 22:48:41] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 4 ms to minimize.
[2024-05-31 22:48:41] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 5 ms to minimize.
[2024-05-31 22:48:41] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 4 ms to minimize.
[2024-05-31 22:48:42] [INFO ] Deduced a trap composed of 208 places in 263 ms of which 5 ms to minimize.
[2024-05-31 22:48:42] [INFO ] Deduced a trap composed of 193 places in 254 ms of which 5 ms to minimize.
SMT process timed out in 10910ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 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.18 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1297 transitions
Trivial Post-agglo rules discarded 1297 transitions
Performed 1297 trivial Post agglomeration. Transition count delta: 1297
Iterating post reduction 0 with 1297 rules applied. Total rules applied 1298 place count 4884 transition count 5616
Reduce places removed 1297 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 1 with 1353 rules applied. Total rules applied 2651 place count 3587 transition count 5560
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 2707 place count 3531 transition count 5560
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 163 Pre rules applied. Total rules applied 2707 place count 3531 transition count 5397
Deduced a syphon composed of 163 places in 5 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 326 rules applied. Total rules applied 3033 place count 3368 transition count 5397
Discarding 1176 places :
Symmetric choice reduction at 3 with 1176 rule applications. Total rules 4209 place count 2192 transition count 4221
Iterating global reduction 3 with 1176 rules applied. Total rules applied 5385 place count 2192 transition count 4221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5385 place count 2192 transition count 4218
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 5391 place count 2189 transition count 4218
Discarding 213 places :
Symmetric choice reduction at 3 with 213 rule applications. Total rules 5604 place count 1976 transition count 3153
Iterating global reduction 3 with 213 rules applied. Total rules applied 5817 place count 1976 transition count 3153
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 5845 place count 1962 transition count 3139
Free-agglomeration rule (complex) applied 103 times.
Iterating global reduction 3 with 103 rules applied. Total rules applied 5948 place count 1962 transition count 3036
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 3 with 103 rules applied. Total rules applied 6051 place count 1859 transition count 3036
Partial Free-agglomeration rule applied 112 times.
Drop transitions (Partial Free agglomeration) removed 112 transitions
Iterating global reduction 4 with 112 rules applied. Total rules applied 6163 place count 1859 transition count 3036
Applied a total of 6163 rules in 1300 ms. Remains 1859 /4914 variables (removed 3055) and now considering 3036/6913 (removed 3877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1311 ms. Remains : 1859/4914 places, 3036/6913 transitions.
RANDOM walk for 40000 steps (1088 resets) in 647 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (219 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (219 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (220 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (219 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (220 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 62452 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 5
Probabilistic random walk after 62452 steps, saw 28440 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-31 22:48:47] [INFO ] Flow matrix only has 2661 transitions (discarded 375 similar events)
// Phase 1: matrix 2661 rows 1859 cols
[2024-05-31 22:48:47] [INFO ] Computed 505 invariants in 37 ms
[2024-05-31 22:48:47] [INFO ] State equation strengthened by 1054 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, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1193/1269 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1269 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1269 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/1273 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 509/1782 variables, 405/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/1794 variables, 12/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1794 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 65/1859 variables, 65/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1859 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2661/4520 variables, 1859/2364 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 14 (INCLUDED_ONLY) 0/4520 variables, 1054/3418 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4520 variables, 0/3418 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/4520 variables, 0/3418 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4520/4520 variables, and 3418 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2799 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 472/472 constraints, State Equation: 1859/1859 constraints, ReadFeed: 1054/1054 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) 1205/1211 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 783 places in 444 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1211 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1211 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 25/1236 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 22:48:51] [INFO ] Deduced a trap composed of 528 places in 539 ms of which 7 ms to minimize.
[2024-05-31 22:48:52] [INFO ] Deduced a trap composed of 535 places in 528 ms of which 7 ms to minimize.
[2024-05-31 22:48:52] [INFO ] Deduced a trap composed of 592 places in 468 ms of which 6 ms to minimize.
[2024-05-31 22:48:53] [INFO ] Deduced a trap composed of 530 places in 520 ms of which 7 ms to minimize.
[2024-05-31 22:48:53] [INFO ] Deduced a trap composed of 560 places in 477 ms of which 6 ms to minimize.
[2024-05-31 22:48:54] [INFO ] Deduced a trap composed of 501 places in 481 ms of which 9 ms to minimize.
[2024-05-31 22:48:54] [INFO ] Deduced a trap composed of 505 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:48:55] [INFO ] Deduced a trap composed of 624 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:48:55] [INFO ] Deduced a trap composed of 535 places in 584 ms of which 15 ms to minimize.
[2024-05-31 22:48:56] [INFO ] Deduced a trap composed of 597 places in 477 ms of which 6 ms to minimize.
[2024-05-31 22:48:56] [INFO ] Deduced a trap composed of 668 places in 478 ms of which 7 ms to minimize.
[2024-05-31 22:48:57] [INFO ] Deduced a trap composed of 547 places in 492 ms of which 7 ms to minimize.
[2024-05-31 22:48:57] [INFO ] Deduced a trap composed of 510 places in 498 ms of which 6 ms to minimize.
[2024-05-31 22:48:58] [INFO ] Deduced a trap composed of 504 places in 460 ms of which 7 ms to minimize.
[2024-05-31 22:48:59] [INFO ] Deduced a trap composed of 569 places in 544 ms of which 7 ms to minimize.
[2024-05-31 22:48:59] [INFO ] Deduced a trap composed of 629 places in 502 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1236 variables, 16/26 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 22:49:00] [INFO ] Deduced a trap composed of 550 places in 502 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1236 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1236 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 526/1762 variables, 399/426 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 22:49:01] [INFO ] Deduced a trap composed of 170 places in 1084 ms of which 12 ms to minimize.
[2024-05-31 22:49:02] [INFO ] Deduced a trap composed of 156 places in 1058 ms of which 16 ms to minimize.
[2024-05-31 22:49:03] [INFO ] Deduced a trap composed of 5 places in 1093 ms of which 11 ms to minimize.
[2024-05-31 22:49:04] [INFO ] Deduced a trap composed of 28 places in 1039 ms of which 11 ms to minimize.
[2024-05-31 22:49:05] [INFO ] Deduced a trap composed of 141 places in 1065 ms of which 11 ms to minimize.
[2024-05-31 22:49:07] [INFO ] Deduced a trap composed of 145 places in 1100 ms of which 12 ms to minimize.
[2024-05-31 22:49:08] [INFO ] Deduced a trap composed of 190 places in 1088 ms of which 12 ms to minimize.
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 209 places in 1018 ms of which 11 ms to minimize.
[2024-05-31 22:49:10] [INFO ] Deduced a trap composed of 28 places in 1073 ms of which 12 ms to minimize.
[2024-05-31 22:49:11] [INFO ] Deduced a trap composed of 191 places in 1110 ms of which 11 ms to minimize.
[2024-05-31 22:49:12] [INFO ] Deduced a trap composed of 174 places in 1024 ms of which 10 ms to minimize.
[2024-05-31 22:49:13] [INFO ] Deduced a trap composed of 181 places in 1040 ms of which 12 ms to minimize.
[2024-05-31 22:49:14] [INFO ] Deduced a trap composed of 216 places in 1048 ms of which 12 ms to minimize.
[2024-05-31 22:49:15] [INFO ] Deduced a trap composed of 58 places in 1042 ms of which 11 ms to minimize.
[2024-05-31 22:49:16] [INFO ] Deduced a trap composed of 145 places in 1058 ms of which 12 ms to minimize.
[2024-05-31 22:49:18] [INFO ] Deduced a trap composed of 204 places in 1080 ms of which 11 ms to minimize.
[2024-05-31 22:49:19] [INFO ] Deduced a trap composed of 193 places in 1001 ms of which 11 ms to minimize.
[2024-05-31 22:49:20] [INFO ] Deduced a trap composed of 171 places in 1037 ms of which 13 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 177 places in 1003 ms of which 13 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 283 places in 1047 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1762 variables, 20/446 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 22:49:23] [INFO ] Deduced a trap composed of 175 places in 1067 ms of which 12 ms to minimize.
[2024-05-31 22:49:24] [INFO ] Deduced a trap composed of 189 places in 1063 ms of which 14 ms to minimize.
[2024-05-31 22:49:25] [INFO ] Deduced a trap composed of 203 places in 1005 ms of which 11 ms to minimize.
[2024-05-31 22:49:26] [INFO ] Deduced a trap composed of 216 places in 1038 ms of which 23 ms to minimize.
[2024-05-31 22:49:27] [INFO ] Deduced a trap composed of 224 places in 1025 ms of which 11 ms to minimize.
[2024-05-31 22:49:28] [INFO ] Deduced a trap composed of 185 places in 1096 ms of which 12 ms to minimize.
[2024-05-31 22:49:29] [INFO ] Deduced a trap composed of 225 places in 1026 ms of which 11 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 252 places in 997 ms of which 11 ms to minimize.
[2024-05-31 22:49:31] [INFO ] Deduced a trap composed of 223 places in 1065 ms of which 11 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 211 places in 1064 ms of which 12 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 237 places in 1030 ms of which 12 ms to minimize.
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 171 places in 1051 ms of which 12 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 152 places in 1043 ms of which 12 ms to minimize.
SMT process timed out in 48940ms, 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 1859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1859/1859 places, 3036/3036 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1859 transition count 3029
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1852 transition count 3029
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 1852 transition count 3022
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 1845 transition count 3022
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 47 place count 1826 transition count 2955
Iterating global reduction 2 with 19 rules applied. Total rules applied 66 place count 1826 transition count 2955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 66 place count 1826 transition count 2953
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 1824 transition count 2953
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 1818 transition count 2923
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 1818 transition count 2923
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 1816 transition count 2921
Free-agglomeration rule (complex) applied 58 times.
Iterating global reduction 2 with 58 rules applied. Total rules applied 144 place count 1816 transition count 3759
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 202 place count 1758 transition count 3759
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 209 place count 1751 transition count 3752
Iterating global reduction 3 with 7 rules applied. Total rules applied 216 place count 1751 transition count 3752
Applied a total of 216 rules in 423 ms. Remains 1751 /1859 variables (removed 108) and now considering 3752/3036 (removed -716) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 1751/1859 places, 3752/3036 transitions.
RANDOM walk for 40000 steps (1268 resets) in 1060 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (224 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (224 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (224 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 67792 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 3
Probabilistic random walk after 67792 steps, saw 30229 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:49:40] [INFO ] Flow matrix only has 3364 transitions (discarded 388 similar events)
// Phase 1: matrix 3364 rows 1751 cols
[2024-05-31 22:49:40] [INFO ] Computed 505 invariants in 68 ms
[2024-05-31 22:49:40] [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-31 22:49:40] [INFO ] Deduced a trap composed of 310 places in 481 ms of which 6 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-31 22:49:41] [INFO ] Deduced a trap composed of 377 places in 458 ms of which 5 ms to minimize.
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 416 places in 437 ms of which 5 ms to minimize.
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 391 places in 437 ms of which 4 ms to minimize.
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 422 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:49:43] [INFO ] Deduced a trap composed of 385 places in 447 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1097 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:49:43] [INFO ] Deduced a trap composed of 405 places in 407 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1097 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 535/1632 variables, 377/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:49:45] [INFO ] Deduced a trap composed of 5 places in 1190 ms of which 10 ms to minimize.
[2024-05-31 22:49:46] [INFO ] Deduced a trap composed of 177 places in 1266 ms of which 11 ms to minimize.
[2024-05-31 22:49:48] [INFO ] Deduced a trap composed of 214 places in 1230 ms of which 11 ms to minimize.
[2024-05-31 22:49:49] [INFO ] Deduced a trap composed of 209 places in 1268 ms of which 11 ms to minimize.
[2024-05-31 22:49:50] [INFO ] Deduced a trap composed of 174 places in 1193 ms of which 11 ms to minimize.
[2024-05-31 22:49:51] [INFO ] Deduced a trap composed of 222 places in 1234 ms of which 11 ms to minimize.
[2024-05-31 22:49:53] [INFO ] Deduced a trap composed of 27 places in 1231 ms of which 10 ms to minimize.
[2024-05-31 22:49:54] [INFO ] Deduced a trap composed of 261 places in 1181 ms of which 10 ms to minimize.
[2024-05-31 22:49:55] [INFO ] Deduced a trap composed of 252 places in 1225 ms of which 10 ms to minimize.
[2024-05-31 22:49:56] [INFO ] Deduced a trap composed of 233 places in 1223 ms of which 11 ms to minimize.
[2024-05-31 22:49:58] [INFO ] Deduced a trap composed of 191 places in 1199 ms of which 10 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 232 places in 1172 ms of which 11 ms to minimize.
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 241 places in 1134 ms of which 10 ms to minimize.
[2024-05-31 22:50:01] [INFO ] Deduced a trap composed of 145 places in 1186 ms of which 11 ms to minimize.
[2024-05-31 22:50:02] [INFO ] Deduced a trap composed of 192 places in 1187 ms of which 10 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 195 places in 1162 ms of which 10 ms to minimize.
[2024-05-31 22:50:05] [INFO ] Deduced a trap composed of 209 places in 1222 ms of which 10 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 222 places in 1130 ms of which 9 ms to minimize.
[2024-05-31 22:50:07] [INFO ] Deduced a trap composed of 244 places in 1169 ms of which 15 ms to minimize.
[2024-05-31 22:50:08] [INFO ] Deduced a trap composed of 210 places in 1150 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1632 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:50:10] [INFO ] Deduced a trap composed of 230 places in 1148 ms of which 10 ms to minimize.
[2024-05-31 22:50:11] [INFO ] Deduced a trap composed of 243 places in 1145 ms of which 10 ms to minimize.
[2024-05-31 22:50:12] [INFO ] Deduced a trap composed of 180 places in 1180 ms of which 10 ms to minimize.
[2024-05-31 22:50:13] [INFO ] Deduced a trap composed of 160 places in 1104 ms of which 10 ms to minimize.
[2024-05-31 22:50:14] [INFO ] Deduced a trap composed of 243 places in 1156 ms of which 10 ms to minimize.
[2024-05-31 22:50:15] [INFO ] Deduced a trap composed of 246 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 22:50:17] [INFO ] Deduced a trap composed of 238 places in 1145 ms of which 10 ms to minimize.
[2024-05-31 22:50:18] [INFO ] Deduced a trap composed of 241 places in 1197 ms of which 10 ms to minimize.
[2024-05-31 22:50:19] [INFO ] Deduced a trap composed of 251 places in 1152 ms of which 11 ms to minimize.
[2024-05-31 22:50:20] [INFO ] Deduced a trap composed of 206 places in 1208 ms of which 11 ms to minimize.
[2024-05-31 22:50:21] [INFO ] Deduced a trap composed of 232 places in 1139 ms of which 10 ms to minimize.
[2024-05-31 22:50:23] [INFO ] Deduced a trap composed of 163 places in 1187 ms of which 11 ms to minimize.
[2024-05-31 22:50:24] [INFO ] Deduced a trap composed of 226 places in 1141 ms of which 10 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 216 places in 1210 ms of which 11 ms to minimize.
[2024-05-31 22:50:26] [INFO ] Deduced a trap composed of 222 places in 1172 ms of which 10 ms to minimize.
[2024-05-31 22:50:28] [INFO ] Deduced a trap composed of 201 places in 1193 ms of which 10 ms to minimize.
[2024-05-31 22:50:29] [INFO ] Deduced a trap composed of 242 places in 1193 ms of which 10 ms to minimize.
[2024-05-31 22:50:30] [INFO ] Deduced a trap composed of 280 places in 1165 ms of which 10 ms to minimize.
[2024-05-31 22:50:31] [INFO ] Deduced a trap composed of 235 places in 1196 ms of which 10 ms to minimize.
[2024-05-31 22:50:32] [INFO ] Deduced a trap composed of 178 places in 1201 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1632 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:50:34] [INFO ] Deduced a trap composed of 199 places in 1195 ms of which 9 ms to minimize.
[2024-05-31 22:50:35] [INFO ] Deduced a trap composed of 179 places in 1155 ms of which 11 ms to minimize.
[2024-05-31 22:50:36] [INFO ] Deduced a trap composed of 175 places in 1167 ms of which 10 ms to minimize.
[2024-05-31 22:50:37] [INFO ] Deduced a trap composed of 261 places in 1235 ms of which 10 ms to minimize.
[2024-05-31 22:50:38] [INFO ] Deduced a trap composed of 216 places in 1105 ms of which 10 ms to minimize.
[2024-05-31 22:50:40] [INFO ] Deduced a trap composed of 236 places in 1236 ms of which 11 ms to minimize.
[2024-05-31 22:50:41] [INFO ] Deduced a trap composed of 154 places in 1220 ms of which 11 ms to minimize.
[2024-05-31 22:50:42] [INFO ] Deduced a trap composed of 227 places in 1171 ms of which 11 ms to minimize.
[2024-05-31 22:50:44] [INFO ] Deduced a trap composed of 178 places in 1260 ms of which 10 ms to minimize.
[2024-05-31 22:50:45] [INFO ] Deduced a trap composed of 202 places in 1184 ms of which 11 ms to minimize.
[2024-05-31 22:50:46] [INFO ] Deduced a trap composed of 223 places in 1169 ms of which 10 ms to minimize.
[2024-05-31 22:50:47] [INFO ] Deduced a trap composed of 205 places in 1207 ms of which 10 ms to minimize.
[2024-05-31 22:50:48] [INFO ] Deduced a trap composed of 220 places in 1196 ms of which 11 ms to minimize.
[2024-05-31 22:50:50] [INFO ] Deduced a trap composed of 193 places in 1155 ms of which 11 ms to minimize.
[2024-05-31 22:50:51] [INFO ] Deduced a trap composed of 199 places in 1254 ms of which 11 ms to minimize.
[2024-05-31 22:50:52] [INFO ] Deduced a trap composed of 263 places in 1187 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1632 variables, 16/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:50:53] [INFO ] Deduced a trap composed of 197 places in 1182 ms of which 11 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1632 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1632 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 24/1656 variables, 24/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 95/1751 variables, 95/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:50:55] [INFO ] Deduced a trap composed of 254 places in 1330 ms of which 11 ms to minimize.
SMT process timed out in 75788ms, 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 97 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 98 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 107 ms. Remains 1751 /1751 variables (removed 0) and now considering 3752/3752 (removed 0) transitions.
[2024-05-31 22:50:56] [INFO ] Flow matrix only has 3364 transitions (discarded 388 similar events)
[2024-05-31 22:50:56] [INFO ] Invariant cache hit.
[2024-05-31 22:50:59] [INFO ] Implicit Places using invariants in 3253 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-31 22:50:59] [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 3272 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 238 ms. Remains 1238 /1561 variables (removed 323) and now considering 3429/3752 (removed 323) transitions.
[2024-05-31 22:50:59] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
// Phase 1: matrix 3041 rows 1238 cols
[2024-05-31 22:50:59] [INFO ] Computed 315 invariants in 30 ms
[2024-05-31 22:51:01] [INFO ] Implicit Places using invariants in 1991 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 1999 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 87 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 5704 ms. Remains : 966/1751 places, 3429/3752 transitions.
RANDOM walk for 40000 steps (1354 resets) in 799 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (159 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (139 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 79185 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 79185 steps, saw 33077 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-31 22:51:05] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
// Phase 1: matrix 3041 rows 966 cols
[2024-05-31 22:51:05] [INFO ] Computed 43 invariants in 27 ms
[2024-05-31 22:51:05] [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-31 22:51:05] [INFO ] Deduced a trap composed of 310 places in 403 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 2470 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-31 22:51:08] [INFO ] Deduced a trap composed of 94 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:51:08] [INFO ] Deduced a trap composed of 90 places in 520 ms of which 6 ms to minimize.
[2024-05-31 22:51:09] [INFO ] Deduced a trap composed of 105 places in 515 ms of which 9 ms to minimize.
[2024-05-31 22:51:09] [INFO ] Deduced a trap composed of 89 places in 513 ms of which 6 ms to minimize.
[2024-05-31 22:51:10] [INFO ] Deduced a trap composed of 115 places in 505 ms of which 6 ms to minimize.
[2024-05-31 22:51:10] [INFO ] Deduced a trap composed of 122 places in 505 ms of which 5 ms to minimize.
[2024-05-31 22:51:11] [INFO ] Deduced a trap composed of 69 places in 516 ms of which 5 ms to minimize.
[2024-05-31 22:51:12] [INFO ] Deduced a trap composed of 98 places in 495 ms of which 6 ms to minimize.
[2024-05-31 22:51:12] [INFO ] Deduced a trap composed of 85 places in 521 ms of which 6 ms to minimize.
[2024-05-31 22:51:13] [INFO ] Deduced a trap composed of 133 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:51:13] [INFO ] Deduced a trap composed of 139 places in 518 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:14] [INFO ] Deduced a trap composed of 69 places in 491 ms of which 5 ms to minimize.
[2024-05-31 22:51:14] [INFO ] Deduced a trap composed of 167 places in 497 ms of which 6 ms to minimize.
[2024-05-31 22:51:15] [INFO ] Deduced a trap composed of 180 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:51:15] [INFO ] Deduced a trap composed of 87 places in 507 ms of which 6 ms to minimize.
[2024-05-31 22:51:16] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 5 ms to minimize.
[2024-05-31 22:51:16] [INFO ] Deduced a trap composed of 87 places in 483 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/932 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:17] [INFO ] Deduced a trap composed of 57 places in 547 ms of which 6 ms to minimize.
[2024-05-31 22:51:18] [INFO ] Deduced a trap composed of 5 places in 523 ms of which 5 ms to minimize.
[2024-05-31 22:51:18] [INFO ] Deduced a trap composed of 58 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:51:19] [INFO ] Deduced a trap composed of 27 places in 532 ms of which 5 ms to minimize.
[2024-05-31 22:51:19] [INFO ] Deduced a trap composed of 154 places in 538 ms of which 5 ms to minimize.
[2024-05-31 22:51:20] [INFO ] Deduced a trap composed of 76 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:51:20] [INFO ] Deduced a trap composed of 69 places in 537 ms of which 7 ms to minimize.
[2024-05-31 22:51:21] [INFO ] Deduced a trap composed of 162 places in 519 ms of which 5 ms to minimize.
[2024-05-31 22:51:21] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:51:22] [INFO ] Deduced a trap composed of 141 places in 456 ms of which 5 ms to minimize.
[2024-05-31 22:51:22] [INFO ] Deduced a trap composed of 146 places in 467 ms of which 6 ms to minimize.
[2024-05-31 22:51:23] [INFO ] Deduced a trap composed of 184 places in 440 ms of which 5 ms to minimize.
[2024-05-31 22:51:23] [INFO ] Deduced a trap composed of 195 places in 443 ms of which 5 ms to minimize.
[2024-05-31 22:51:24] [INFO ] Deduced a trap composed of 194 places in 440 ms of which 5 ms to minimize.
[2024-05-31 22:51:24] [INFO ] Deduced a trap composed of 209 places in 437 ms of which 5 ms to minimize.
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 201 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 202 places in 436 ms of which 5 ms to minimize.
[2024-05-31 22:51:26] [INFO ] Deduced a trap composed of 86 places in 468 ms of which 9 ms to minimize.
[2024-05-31 22:51:26] [INFO ] Deduced a trap composed of 209 places in 432 ms of which 5 ms to minimize.
[2024-05-31 22:51:26] [INFO ] Deduced a trap composed of 219 places in 429 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:27] [INFO ] Deduced a trap composed of 83 places in 547 ms of which 6 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 88 places in 556 ms of which 6 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 82 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 86 places in 515 ms of which 6 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 96 places in 546 ms of which 6 ms to minimize.
[2024-05-31 22:51:30] [INFO ] Deduced a trap composed of 101 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:51:30] [INFO ] Deduced a trap composed of 83 places in 525 ms of which 6 ms to minimize.
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 90 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 77 places in 475 ms of which 5 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 146 places in 418 ms of which 6 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 132 places in 435 ms of which 6 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Deduced a trap composed of 151 places in 412 ms of which 6 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Deduced a trap composed of 169 places in 464 ms of which 6 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 147 places in 417 ms of which 5 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 148 places in 414 ms of which 5 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 144 places in 407 ms of which 6 ms to minimize.
[2024-05-31 22:51:35] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 6 ms to minimize.
[2024-05-31 22:51:35] [INFO ] Deduced a trap composed of 138 places in 398 ms of which 6 ms to minimize.
[2024-05-31 22:51:36] [INFO ] Deduced a trap composed of 136 places in 390 ms of which 5 ms to minimize.
[2024-05-31 22:51:36] [INFO ] Deduced a trap composed of 136 places in 423 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:37] [INFO ] Deduced a trap composed of 137 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:51:37] [INFO ] Deduced a trap composed of 137 places in 426 ms of which 5 ms to minimize.
[2024-05-31 22:51:38] [INFO ] Deduced a trap composed of 131 places in 461 ms of which 6 ms to minimize.
[2024-05-31 22:51:38] [INFO ] Deduced a trap composed of 127 places in 426 ms of which 5 ms to minimize.
[2024-05-31 22:51:38] [INFO ] Deduced a trap composed of 131 places in 460 ms of which 6 ms to minimize.
[2024-05-31 22:51:39] [INFO ] Deduced a trap composed of 128 places in 429 ms of which 6 ms to minimize.
[2024-05-31 22:51:39] [INFO ] Deduced a trap composed of 132 places in 470 ms of which 6 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 145 places in 462 ms of which 5 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 145 places in 457 ms of which 6 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 162 places in 428 ms of which 6 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 147 places in 429 ms of which 6 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 147 places in 461 ms of which 5 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 88 places in 551 ms of which 6 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 161 places in 521 ms of which 6 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 75 places in 549 ms of which 6 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 96 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 6 ms to minimize.
[2024-05-31 22:51:45] [INFO ] Deduced a trap composed of 70 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:51:46] [INFO ] Deduced a trap composed of 82 places in 532 ms of which 6 ms to minimize.
[2024-05-31 22:51:46] [INFO ] Deduced a trap composed of 81 places in 535 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:47] [INFO ] Deduced a trap composed of 67 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:51:47] [INFO ] Deduced a trap composed of 63 places in 527 ms of which 6 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 61 places in 513 ms of which 5 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 138 places in 425 ms of which 6 ms to minimize.
[2024-05-31 22:51:49] [INFO ] Deduced a trap composed of 134 places in 431 ms of which 5 ms to minimize.
[2024-05-31 22:51:49] [INFO ] Deduced a trap composed of 138 places in 427 ms of which 5 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 69 places in 489 ms of which 6 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 63 places in 534 ms of which 5 ms to minimize.
[2024-05-31 22:51:51] [INFO ] Deduced a trap composed of 81 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:51:51] [INFO ] Deduced a trap composed of 102 places in 526 ms of which 5 ms to minimize.
[2024-05-31 22:51:52] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 5 ms to minimize.
[2024-05-31 22:51:52] [INFO ] Deduced a trap composed of 87 places in 515 ms of which 6 ms to minimize.
[2024-05-31 22:51:53] [INFO ] Deduced a trap composed of 57 places in 528 ms of which 6 ms to minimize.
[2024-05-31 22:51:53] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 6 ms to minimize.
[2024-05-31 22:51:54] [INFO ] Deduced a trap composed of 92 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:51:55] [INFO ] Deduced a trap composed of 77 places in 542 ms of which 6 ms to minimize.
[2024-05-31 22:51:55] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:51:56] [INFO ] Deduced a trap composed of 214 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:51:56] [INFO ] Deduced a trap composed of 28 places in 542 ms of which 5 ms to minimize.
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 90 places in 528 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 145 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:51:58] [INFO ] Deduced a trap composed of 153 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:51:58] [INFO ] Deduced a trap composed of 148 places in 417 ms of which 6 ms to minimize.
[2024-05-31 22:51:59] [INFO ] Deduced a trap composed of 153 places in 429 ms of which 6 ms to minimize.
[2024-05-31 22:51:59] [INFO ] Deduced a trap composed of 146 places in 443 ms of which 6 ms to minimize.
[2024-05-31 22:52:00] [INFO ] Deduced a trap composed of 152 places in 439 ms of which 5 ms to minimize.
[2024-05-31 22:52:00] [INFO ] Deduced a trap composed of 161 places in 454 ms of which 6 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 167 places in 478 ms of which 5 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 202 places in 460 ms of which 6 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 163 places in 431 ms of which 6 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 169 places in 488 ms of which 6 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 223 places in 467 ms of which 6 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 103 places in 532 ms of which 6 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 105 places in 467 ms of which 5 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 175 places in 434 ms of which 5 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 168 places in 453 ms of which 6 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 183 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 103 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 194 places in 467 ms of which 6 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 174 places in 477 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 138 places in 425 ms of which 6 ms to minimize.
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 134 places in 419 ms of which 6 ms to minimize.
[2024-05-31 22:52:08] [INFO ] Deduced a trap composed of 153 places in 438 ms of which 5 ms to minimize.
[2024-05-31 22:52:08] [INFO ] Deduced a trap composed of 138 places in 429 ms of which 6 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 137 places in 433 ms of which 5 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 153 places in 429 ms of which 5 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 138 places in 441 ms of which 9 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 134 places in 428 ms of which 5 ms to minimize.
[2024-05-31 22:52:11] [INFO ] Deduced a trap composed of 133 places in 419 ms of which 6 ms to minimize.
[2024-05-31 22:52:11] [INFO ] Deduced a trap composed of 139 places in 427 ms of which 5 ms to minimize.
[2024-05-31 22:52:11] [INFO ] Deduced a trap composed of 163 places in 427 ms of which 6 ms to minimize.
[2024-05-31 22:52:12] [INFO ] Deduced a trap composed of 170 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:52:13] [INFO ] Deduced a trap composed of 57 places in 493 ms of which 6 ms to minimize.
[2024-05-31 22:52:13] [INFO ] Deduced a trap composed of 86 places in 475 ms of which 6 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 218 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 226 places in 461 ms of which 6 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 219 places in 457 ms of which 5 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 221 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 140 places in 477 ms of which 6 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 190 places in 492 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 147 places in 415 ms of which 5 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 101 places in 461 ms of which 5 ms to minimize.
[2024-05-31 22:52:18] [INFO ] Deduced a trap composed of 152 places in 444 ms of which 5 ms to minimize.
[2024-05-31 22:52:18] [INFO ] Deduced a trap composed of 198 places in 447 ms of which 6 ms to minimize.
[2024-05-31 22:52:19] [INFO ] Deduced a trap composed of 227 places in 438 ms of which 6 ms to minimize.
[2024-05-31 22:52:19] [INFO ] Deduced a trap composed of 233 places in 442 ms of which 5 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 121 places in 438 ms of which 6 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 203 places in 411 ms of which 5 ms to minimize.
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 195 places in 410 ms of which 6 ms to minimize.
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 203 places in 419 ms of which 6 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Deduced a trap composed of 204 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Deduced a trap composed of 191 places in 414 ms of which 5 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Deduced a trap composed of 202 places in 415 ms of which 5 ms to minimize.
[2024-05-31 22:52:23] [INFO ] Deduced a trap composed of 203 places in 446 ms of which 6 ms to minimize.
[2024-05-31 22:52:23] [INFO ] Deduced a trap composed of 203 places in 440 ms of which 6 ms to minimize.
[2024-05-31 22:52:24] [INFO ] Deduced a trap composed of 194 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:52:24] [INFO ] Deduced a trap composed of 203 places in 437 ms of which 5 ms to minimize.
[2024-05-31 22:52:25] [INFO ] Deduced a trap composed of 193 places in 421 ms of which 5 ms to minimize.
[2024-05-31 22:52:25] [INFO ] Deduced a trap composed of 203 places in 450 ms of which 5 ms to minimize.
[2024-05-31 22:52:26] [INFO ] Deduced a trap composed of 203 places in 427 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:52:27] [INFO ] Deduced a trap composed of 148 places in 405 ms of which 5 ms to minimize.
[2024-05-31 22:52:28] [INFO ] Deduced a trap composed of 188 places in 414 ms of which 5 ms to minimize.
[2024-05-31 22:52:28] [INFO ] Deduced a trap composed of 169 places in 432 ms of which 6 ms to minimize.
[2024-05-31 22:52:29] [INFO ] Deduced a trap composed of 166 places in 440 ms of which 6 ms to minimize.
[2024-05-31 22:52:29] [INFO ] Deduced a trap composed of 131 places in 454 ms of which 6 ms to minimize.
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 207 places in 427 ms of which 5 ms to minimize.
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 232 places in 438 ms of which 5 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 220 places in 435 ms of which 5 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 198 places in 464 ms of which 6 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 75 places in 519 ms of which 5 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 6 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 113 places in 541 ms of which 5 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 124 places in 510 ms of which 6 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 103 places in 531 ms of which 5 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 59 places in 528 ms of which 5 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 170 places in 442 ms of which 6 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 181 places in 422 ms of which 6 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 189 places in 449 ms of which 6 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 154 places in 405 ms of which 5 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 181 places in 396 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/932 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 181 places in 401 ms of which 6 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 190 places in 405 ms of which 6 ms to minimize.
SMT process timed out in 92900ms, 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 103 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 103 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 85 ms. Remains 966 /966 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
[2024-05-31 22:52:38] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-31 22:52:38] [INFO ] Invariant cache hit.
[2024-05-31 22:52:39] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-05-31 22:52:39] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-31 22:52:39] [INFO ] Invariant cache hit.
[2024-05-31 22:52:40] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-31 22:53:07] [INFO ] Implicit Places using invariants and state equation in 27877 ms returned []
Implicit Place search using SMT with State Equation took 29011 ms to find 0 implicit places.
[2024-05-31 22:53:07] [INFO ] Redundant transitions in 192 ms returned []
Running 3367 sub problems to find dead transitions.
[2024-05-31 22:53:07] [INFO ] Flow matrix only has 3041 transitions (discarded 388 similar events)
[2024-05-31 22:53:07] [INFO ] Invariant cache hit.
[2024-05-31 22:53:07] [INFO ] State equation strengthened by 1878 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 48143ms, After SMT, problems are : Problem set: 0 solved, 3367 unsolved
Search for dead transitions found 0 dead transitions in 48176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77491 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 7 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 1 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 679 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-31 22:53:56] [INFO ] Computed 14 invariants in 9 ms
[2024-05-31 22:53:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 22:53:56] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-31 22:53:56] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 22:53:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-31 22:53:56] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-31 22:53:56] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 22:53:56] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 22:53:56] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 964 ms.
[2024-05-31 22:53:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-31 22:53:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 966 places, 3429 transitions and 17028 arcs took 20 ms.
[2024-05-31 22:53:57] [INFO ] Flatten gal took : 278 ms
Total runtime 327800 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-03
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-2024-05

BK_STOP 1717196037348

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-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 r508-tall-171654350700031"
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 ;