fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399700542
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BusinessProcesses-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1650.707 196928.00 454454.00 63.50 FFFTTFTFTTFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399700542.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 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 BusinessProcesses-PT-12-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716335228757

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:47:10] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-21 23:47:10] [INFO ] Transformed 586 places.
[2024-05-21 23:47:10] [INFO ] Transformed 525 transitions.
[2024-05-21 23:47:10] [INFO ] Found NUPN structural information;
[2024-05-21 23:47:10] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 114 ms
RANDOM walk for 40000 steps (292 resets) in 1679 ms. (23 steps per ms) remains 10/14 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 60 ms
[2024-05-21 23:47:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14294491949390693356.gal : 20 ms
[2024-05-21 23:47:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7904254161139002918.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14294491949390693356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7904254161139002918.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (67 resets) in 230 ms. (173 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (53 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality7904254161139002918.prop.
BEST_FIRST walk for 40004 steps (50 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 328 ms. (121 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (72 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 6
BEST_FIRST walk for 40004 steps (51 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :61 after 201
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :381 after 3788
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :3788 after 39961
BEST_FIRST walk for 40004 steps (49 resets) in 823 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (58 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4096
BEST_FIRST walk for 40004 steps (53 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
SDD size :2.8345e+06 after 4.54137e+06
BEST_FIRST walk for 40004 steps (56 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
// Phase 1: matrix 521 rows 582 cols
[2024-05-21 23:47:11] [INFO ] Computed 98 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 362/453 variables, 51/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :4.54137e+06 after 6.26726e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 362/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 15/468 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 15/525 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 112/580 variables, 39/564 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 112/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/582 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 521/1103 variables, 582/1262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
SDD proceeding with computation,10 properties remain. new max is 16384
After SMT solving in domain Real declared 1103/1103 variables, and 1262 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2430 ms.
Refiners :[Domain max(s): 582/582 constraints, Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
SDD size :6.26726e+07 after 4.23526e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 362/453 variables, 51/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 362/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 26 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 115 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 115 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 20/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :4.23526e+10 after 6.36148e+10
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 120 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 118 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 106 places in 77 ms of which 2 ms to minimize.
SMT process timed out in 7600ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 238 edges and 582 vertex of which 4 / 582 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1182 edges and 579 vertex of which 576 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 576 transition count 438
Reduce places removed 78 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 91 rules applied. Total rules applied 171 place count 498 transition count 425
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 184 place count 485 transition count 425
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 184 place count 485 transition count 350
Deduced a syphon composed of 75 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 340 place count 404 transition count 350
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 391 place count 353 transition count 299
Iterating global reduction 3 with 51 rules applied. Total rules applied 442 place count 353 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 442 place count 353 transition count 297
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 447 place count 350 transition count 297
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 575 place count 286 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 285 transition count 237
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 578 place count 285 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 579 place count 284 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 283 transition count 235
Applied a total of 580 rules in 114 ms. Remains 283 /582 variables (removed 299) and now considering 235/521 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 283/582 places, 235/521 transitions.
RANDOM walk for 40000 steps (1000 resets) in 813 ms. (49 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (273 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (222 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (235 resets) in 145 ms. (273 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (238 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (274 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (221 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (248 resets) in 107 ms. (370 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 235 rows 283 cols
[2024-05-21 23:47:20] [INFO ] Computed 89 invariants in 5 ms
[2024-05-21 23:47:20] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 137/220 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/228 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 53/281 variables, 33/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 235/516 variables, 281/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/518 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/518 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 375 constraints, problems are : Problem set: 0 solved, 7 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 283/283 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 137/220 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
SDD size :6.36148e+10 after 1.03046e+11
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 19 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 131072
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 8/228 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :1.03046e+11 after 4.32289e+16
At refinement iteration 15 (OVERLAPS) 53/281 variables, 33/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 10/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 6 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/281 variables, 9/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/281 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 235/516 variables, 281/581 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 3/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/516 variables, 6/590 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:37] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/516 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:38] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:47:38] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:38] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/516 variables, 20/611 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/516 variables, 6/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/516 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/516 variables, 7/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/516 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/516 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem BusinessProcesses-PT-12-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 31 (OVERLAPS) 2/518 variables, 2/648 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/518 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/518 variables, 1/650 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/518 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 0/518 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 650 constraints, problems are : Problem set: 1 solved, 6 unsolved in 32795 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 283/283 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 268/268 constraints]
After SMT, in 33406ms problems are : Problem set: 1 solved, 6 unsolved
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1060 ms.
Support contains 50 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 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 0 with 5 rules applied. Total rules applied 5 place count 283 transition count 230
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 278 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 277 transition count 229
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 12 place count 277 transition count 218
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 40 place count 260 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 258 transition count 216
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 258 transition count 216
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 98 place count 229 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 228 transition count 190
Applied a total of 99 rules in 34 ms. Remains 228 /283 variables (removed 55) and now considering 190/235 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 228/283 places, 190/235 transitions.
RANDOM walk for 40000 steps (1488 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (376 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (355 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-2024-14 does not hold.
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-2024-13 does not hold.
Interrupted probabilistic random walk after 1078045 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 2
Probabilistic random walk after 1078045 steps, saw 157673 distinct states, run finished after 3008 ms. (steps per millisecond=358 ) properties seen :0
// Phase 1: matrix 190 rows 228 cols
[2024-05-21 23:47:57] [INFO ] Computed 79 invariants in 10 ms
[2024-05-21 23:47:57] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/160 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/189 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/224 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/414 variables, 224/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/418 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/418 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 228/228 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/160 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 29/189 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 35/224 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 190/414 variables, 224/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 16/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/418 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/418 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 386 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5691 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 228/228 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 73/73 constraints]
After SMT, in 5988ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 242 ms.
Support contains 50 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 190/190 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 228/228 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 228 /228 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 23:48:04] [INFO ] Invariant cache hit.
[2024-05-21 23:48:04] [INFO ] Implicit Places using invariants in 168 ms returned [38, 71, 162, 183, 195]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 177 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/228 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 223 /223 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 223/228 places, 190/190 transitions.
RANDOM walk for 40000 steps (1500 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (356 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (378 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1051697 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 2
Probabilistic random walk after 1051697 steps, saw 154541 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 190 rows 223 cols
[2024-05-21 23:48:07] [INFO ] Computed 74 invariants in 14 ms
[2024-05-21 23:48:07] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/168 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/196 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/219 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/409 variables, 219/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/413 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 223/223 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/168 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/196 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 23/219 variables, 19/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 190/409 variables, 219/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/413 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/413 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/413 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/413 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 350 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3892 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 223/223 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 47/47 constraints]
After SMT, in 4209ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 50 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 223 /223 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 223/223 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 23:48:11] [INFO ] Invariant cache hit.
[2024-05-21 23:48:12] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 23:48:12] [INFO ] Invariant cache hit.
[2024-05-21 23:48:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:48:12] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 483 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/223 places, 190/190 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 189
Applied a total of 2 rules in 18 ms. Remains 221 /222 variables (removed 1) and now considering 189/190 (removed 1) transitions.
// Phase 1: matrix 189 rows 221 cols
[2024-05-21 23:48:12] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 23:48:12] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:48:12] [INFO ] Invariant cache hit.
[2024-05-21 23:48:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:48:12] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/223 places, 189/190 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 910 ms. Remains : 221/223 places, 189/190 transitions.
RANDOM walk for 40000 steps (1498 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (354 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (371 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 856280 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 2
Probabilistic random walk after 856280 steps, saw 128670 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2024-05-21 23:48:15] [INFO ] Invariant cache hit.
[2024-05-21 23:48:15] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/167 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/189 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/218 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/407 variables, 218/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/410 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 221/221 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/167 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/189 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/218 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 189/407 variables, 218/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 13/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/410 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/410 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 336 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 221/221 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 36/36 constraints]
After SMT, in 4025ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 262 ms.
Support contains 50 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 189/189 transitions.
Applied a total of 0 rules in 19 ms. Remains 221 /221 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 221/221 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-21 23:48:20] [INFO ] Invariant cache hit.
[2024-05-21 23:48:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:48:20] [INFO ] Invariant cache hit.
[2024-05-21 23:48:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:48:20] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 23:48:20] [INFO ] Redundant transitions in 6 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 23:48:20] [INFO ] Invariant cache hit.
[2024-05-21 23:48:20] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/219 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 62 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 14 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/112 constraints. Problems are: Problem set: 4 solved, 181 unsolved
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/132 constraints. Problems are: Problem set: 4 solved, 181 unsolved
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/152 constraints. Problems are: Problem set: 4 solved, 181 unsolved
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/172 constraints. Problems are: Problem set: 4 solved, 181 unsolved
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/192 constraints. Problems are: Problem set: 4 solved, 181 unsolved
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/212 constraints. Problems are: Problem set: 5 solved, 180 unsolved
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/232 constraints. Problems are: Problem set: 19 solved, 166 unsolved
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/252 constraints. Problems are: Problem set: 19 solved, 166 unsolved
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/272 constraints. Problems are: Problem set: 22 solved, 163 unsolved
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/292 constraints. Problems are: Problem set: 22 solved, 163 unsolved
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 3 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 20/312 constraints. Problems are: Problem set: 23 solved, 162 unsolved
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 20/332 constraints. Problems are: Problem set: 26 solved, 159 unsolved
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 20/352 constraints. Problems are: Problem set: 26 solved, 159 unsolved
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 26 solved, 159 unsolved
Search for dead transitions found 28 dead transitions in 30191ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 221/221 places, 161/189 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 218 transition count 161
Applied a total of 3 rules in 8 ms. Remains 218 /221 variables (removed 3) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 218 cols
[2024-05-21 23:48:50] [INFO ] Computed 75 invariants in 1 ms
[2024-05-21 23:48:50] [INFO ] Implicit Places using invariants in 129 ms returned [20, 22, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 143 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 215/221 places, 161/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 30761 ms. Remains : 215/221 places, 161/189 transitions.
RANDOM walk for 40000 steps (1524 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (356 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (372 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1309172 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 2
Probabilistic random walk after 1309172 steps, saw 187905 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
// Phase 1: matrix 161 rows 215 cols
[2024-05-21 23:48:54] [INFO ] Computed 72 invariants in 16 ms
[2024-05-21 23:48:54] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 114/164 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/177 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/212 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/373 variables, 212/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/376 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 215/215 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 114/164 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 13/177 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 53 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/212 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 161/373 variables, 212/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/376 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/376 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 215/215 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 1356ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 50 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 161/161 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 215/215 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 161/161 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-21 23:48:55] [INFO ] Invariant cache hit.
[2024-05-21 23:48:55] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:48:55] [INFO ] Invariant cache hit.
[2024-05-21 23:48:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:48:55] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [22, 29, 158]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 329 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 212/215 places, 161/161 transitions.
Applied a total of 0 rules in 15 ms. Remains 212 /212 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 349 ms. Remains : 212/215 places, 161/161 transitions.
RANDOM walk for 40000 steps (1530 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (362 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (370 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 992476 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 2
Probabilistic random walk after 992476 steps, saw 146762 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
// Phase 1: matrix 161 rows 212 cols
[2024-05-21 23:48:59] [INFO ] Computed 69 invariants in 8 ms
[2024-05-21 23:48:59] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/155 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/182 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/209 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/370 variables, 209/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/373 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/373 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 212/212 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/155 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/182 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/209 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 161/370 variables, 209/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/373 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/373 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 212/212 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 50 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 161/161 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 212/212 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 161/161 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-21 23:49:00] [INFO ] Invariant cache hit.
[2024-05-21 23:49:00] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 23:49:00] [INFO ] Invariant cache hit.
[2024-05-21 23:49:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:49:00] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-21 23:49:00] [INFO ] Redundant transitions in 4 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-21 23:49:00] [INFO ] Invariant cache hit.
[2024-05-21 23:49:00] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/210 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 20/88 constraints. Problems are: Problem set: 4 solved, 153 unsolved
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 2/90 constraints. Problems are: Problem set: 7 solved, 150 unsolved
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/91 constraints. Problems are: Problem set: 7 solved, 150 unsolved
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/93 constraints. Problems are: Problem set: 7 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/93 constraints. Problems are: Problem set: 7 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/211 variables, 1/94 constraints. Problems are: Problem set: 7 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/94 constraints. Problems are: Problem set: 7 solved, 150 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 11 (OVERLAPS) 161/372 variables, 211/305 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 4/309 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/309 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 14 (OVERLAPS) 1/373 variables, 1/310 constraints. Problems are: Problem set: 8 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 16 (OVERLAPS) 0/373 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 310 constraints, problems are : Problem set: 8 solved, 149 unsolved in 10810 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 212/212 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 8 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 2/210 variables, 54/65 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 3/68 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 25/93 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/93 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/211 variables, 1/94 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/95 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 161/372 variables, 211/306 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 4/310 constraints. Problems are: Problem set: 8 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 149/459 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 20/479 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 20/499 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 20/519 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 12 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 20/539 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 20/559 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 20/579 constraints. Problems are: Problem set: 8 solved, 149 unsolved
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 580 constraints, problems are : Problem set: 8 solved, 149 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 211/212 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 149/157 constraints, Known Traps: 147/147 constraints]
After SMT, in 40906ms problems are : Problem set: 8 solved, 149 unsolved
Search for dead transitions found 8 dead transitions in 40909ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 212/212 places, 153/161 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 153
Applied a total of 2 rules in 22 ms. Remains 210 /212 variables (removed 2) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 210 cols
[2024-05-21 23:49:41] [INFO ] Computed 71 invariants in 2 ms
[2024-05-21 23:49:41] [INFO ] Implicit Places using invariants in 121 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/212 places, 153/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 41494 ms. Remains : 209/212 places, 153/161 transitions.
RANDOM walk for 40000 steps (1510 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (356 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (356 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1006277 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 2
Probabilistic random walk after 1006277 steps, saw 148617 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
// Phase 1: matrix 153 rows 209 cols
[2024-05-21 23:49:44] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 23:49:44] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/173 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/187 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/206 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 153/359 variables, 206/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/362 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 209/209 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/173 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/187 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/206 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 153/359 variables, 206/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/362 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/362 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 209/209 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 1193ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 50 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 153/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 209/209 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 153/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2024-05-21 23:49:46] [INFO ] Invariant cache hit.
[2024-05-21 23:49:46] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:49:46] [INFO ] Invariant cache hit.
[2024-05-21 23:49:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:49:46] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-21 23:49:46] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-21 23:49:46] [INFO ] Invariant cache hit.
[2024-05-21 23:49:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 2/207 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 57 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 57 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 59 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/207 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 60 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/207 variables, 20/369 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/207 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 60 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/207 variables, 20/409 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/207 variables, 20/429 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30491 ms. Remains : 209/209 places, 153/153 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 153
Applied a total of 1 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 153 rows 209 cols
[2024-05-21 23:50:16] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:50:16] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:50:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 7 ms returned sat
[2024-05-21 23:50:16] [INFO ] [Nat]Absence check using 55 positive and 15 generalized place invariants in 22 ms returned sat
[2024-05-21 23:50:17] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:50:17] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 28 places in 834 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 971 ms
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
TRAPS : Iteration 1
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 2
[2024-05-21 23:50:18] [INFO ] After 1509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:50:18] [INFO ] After 1814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:50:18] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:50:18] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:50:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15561916537651533737.gal : 21 ms
[2024-05-21 23:50:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11490740197051776546.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15561916537651533737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11490740197051776546.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11490740197051776546.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 66
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :66 after 79
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :79 after 708
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :708 after 3140
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3140 after 37203
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :798873 after 1.28369e+06
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 is true.
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.1778e+06,0.436705,24816,2,13068,18,74846,6,0,986,57079,0
Total reachable state count : 3177801

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-2024-09,538624,2.82502,24816,2,3390,18,74846,7,0,1059,57079,0
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-2024-15,3,2.82851,24816,2,218,18,74846,8,0,1099,57079,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 4829 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 23:50:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:50:21] [INFO ] Applying decomposition
[2024-05-21 23:50:21] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6718012696470684943.txt' '-o' '/tmp/graph6718012696470684943.bin' '-w' '/tmp/graph6718012696470684943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6718012696470684943.bin' '-l' '-1' '-v' '-w' '/tmp/graph6718012696470684943.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:22] [INFO ] Removed a total of 264 redundant transitions.
[2024-05-21 23:50:22] [INFO ] Flatten gal took : 136 ms
[2024-05-21 23:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 25 ms.
[2024-05-21 23:50:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality481872376618881630.gal : 16 ms
[2024-05-21 23:50:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6514552698112720000.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality481872376618881630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6514552698112720000.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality6514552698112720000.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1551 after 6727
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.45887e+18 after 4.59694e+19
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.14329e+23,3.19949,112928,8927,60,180437,1058,1194,710052,73,3416,0
Total reachable state count : 614328953047674875478016

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-2024-09,1.81134e+19,3.27332,112928,344,30,180437,1058,1292,710052,82,3416,34949
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-2024-15,4.11656e+18,3.29058,112928,499,29,180437,1058,1342,710052,82,3416,40862
All properties solved without resorting to model-checking.
Total runtime 195375 ms.

BK_STOP 1716335425685

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399700542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;