About the Execution of LTSMin+red for BusinessProcesses-PT-13
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
585.447 | 178968.00 | 241820.00 | 83.90 | TTTFTTFTFFTTFT?F | 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.r472-tajo-171620399700551.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 ltsminxred
Input is BusinessProcesses-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700551
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717225789608
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:09:51] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-01 07:09:51] [INFO ] Transformed 593 places.
[2024-06-01 07:09:51] [INFO ] Transformed 536 transitions.
[2024-06-01 07:09:51] [INFO ] Found NUPN structural information;
[2024-06-01 07:09:51] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
RANDOM walk for 40000 steps (282 resets) in 2045 ms. (19 steps per ms) remains 13/16 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (50 resets) in 361 ms. (110 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (58 resets) in 511 ms. (78 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (35 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (49 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (60 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (36 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (51 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (36 resets) in 315 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (53 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (56 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
// Phase 1: matrix 528 rows 585 cols
[2024-06-01 07:09:53] [INFO ] Computed 95 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 317/498 variables, 57/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 317/555 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 87/585 variables, 38/593 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 87/680 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/680 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 528/1113 variables, 585/1265 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 1265 constraints, problems are : Problem set: 4 solved, 9 unsolved in 2478 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 336/485 variables, 56/205 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 336/541 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 29 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 3 ms to minimize.
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/561 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 6 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/581 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1113 variables, and 581 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5020 ms.
Refiners :[Domain max(s): 485/585 constraints, Positive P Invariants (semi-flows): 56/57 constraints, Generalized P Invariants (flows): 0/38 constraints, State Equation: 0/585 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 40/40 constraints]
After SMT, in 7717ms problems are : Problem set: 5 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (complete) has 1197 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 579 transition count 487
Reduce places removed 40 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 56 rules applied. Total rules applied 97 place count 539 transition count 471
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 113 place count 523 transition count 471
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 113 place count 523 transition count 374
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 316 place count 417 transition count 374
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 372 place count 361 transition count 318
Iterating global reduction 3 with 56 rules applied. Total rules applied 428 place count 361 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 428 place count 361 transition count 317
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 430 place count 360 transition count 317
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 514 place count 318 transition count 275
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 518 place count 318 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 519 place count 317 transition count 274
Applied a total of 519 rules in 174 ms. Remains 317 /585 variables (removed 268) and now considering 274/528 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 317/585 places, 274/528 transitions.
RANDOM walk for 40000 steps (542 resets) in 672 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (110 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (128 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (117 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (70 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (120 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (121 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 649609 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :6 out of 8
Probabilistic random walk after 649609 steps, saw 103565 distinct states, run finished after 3015 ms. (steps per millisecond=215 ) properties seen :6
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 274 rows 317 cols
[2024-06-01 07:10:04] [INFO ] Computed 81 invariants in 12 ms
[2024-06-01 07:10:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 152/251 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/254 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 52/306 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 274/581 variables, 307/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/591 variables, 10/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 317/317 constraints, ReadFeed: 1/1 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/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 152/251 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/254 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/306 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 7 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/307 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 274/581 variables, 307/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 10/591 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/591 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/591 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/591 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/591 variables, 15/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/591 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/591 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/591 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/591 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 495 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 317/317 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 94/94 constraints]
After SMT, in 16399ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 113 ms.
Support contains 77 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 274/274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 317 transition count 272
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 315 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 313 transition count 270
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 8 place count 313 transition count 257
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 36 place count 298 transition count 257
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 294 transition count 253
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 294 transition count 253
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 102 place count 265 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 264 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 264 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 264 transition count 227
Applied a total of 106 rules in 69 ms. Remains 264 /317 variables (removed 53) and now considering 227/274 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 264/317 places, 227/274 transitions.
RANDOM walk for 40000 steps (830 resets) in 977 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (183 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1178061 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 1
Probabilistic random walk after 1178061 steps, saw 188955 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
// Phase 1: matrix 227 rows 264 cols
[2024-06-01 07:10:24] [INFO ] Computed 79 invariants in 8 ms
[2024-06-01 07:10:24] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/203 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/206 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/253 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 227/481 variables, 254/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/491 variables, 10/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/491 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 264/264 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/203 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/206 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/253 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/254 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 227/481 variables, 254/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/491 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/491 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/491 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/491 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 264/264 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 77 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 227/227 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 264/264 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-01 07:10:26] [INFO ] Invariant cache hit.
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 156 ms returned [12, 19, 39, 41, 68, 70, 72, 74, 76, 78, 80, 82, 84, 209, 213, 237]
[2024-06-01 07:10:26] [INFO ] Actually due to overlaps returned [12, 19, 39, 68, 74, 78, 82, 209, 213, 237]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 165 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 254/264 places, 227/227 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 248 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 248 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 246 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 207
Applied a total of 16 rules in 16 ms. Remains 246 /254 variables (removed 8) and now considering 207/227 (removed 20) transitions.
// Phase 1: matrix 207 rows 246 cols
[2024-06-01 07:10:26] [INFO ] Computed 69 invariants in 4 ms
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 118 ms returned [65, 67]
[2024-06-01 07:10:26] [INFO ] Actually due to overlaps returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 245/264 places, 207/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 206
Applied a total of 2 rules in 10 ms. Remains 244 /245 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 244 cols
[2024-06-01 07:10:26] [INFO ] Computed 68 invariants in 2 ms
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:10:26] [INFO ] Invariant cache hit.
[2024-06-01 07:10:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:10:27] [INFO ] Implicit Places using invariants and state equation in 289 ms returned [168, 170, 172]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 405 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 241/264 places, 206/227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 205
Applied a total of 2 rules in 10 ms. Remains 240 /241 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 240 cols
[2024-06-01 07:10:27] [INFO ] Computed 65 invariants in 2 ms
[2024-06-01 07:10:27] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 07:10:27] [INFO ] Invariant cache hit.
[2024-06-01 07:10:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:10:27] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 240/264 places, 205/227 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1153 ms. Remains : 240/264 places, 205/227 transitions.
RANDOM walk for 40000 steps (831 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (182 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1499943 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1499943 steps, saw 227656 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
[2024-06-01 07:10:30] [INFO ] Invariant cache hit.
[2024-06-01 07:10:30] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/233 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/438 variables, 233/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/445 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/233 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 205/438 variables, 233/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 7/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/445 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/445 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 2093ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 77 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 205/205 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 240/240 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-06-01 07:10:32] [INFO ] Invariant cache hit.
[2024-06-01 07:10:33] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 07:10:33] [INFO ] Invariant cache hit.
[2024-06-01 07:10:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:10:33] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-06-01 07:10:33] [INFO ] Redundant transitions in 6 ms returned []
Running 202 sub problems to find dead transitions.
[2024-06-01 07:10:33] [INFO ] Invariant cache hit.
[2024-06-01 07:10:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 3 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 3 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 5 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/185 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/205 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/225 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 4 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/245 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/265 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 20/285 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 62 places in 737 ms of which 28 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 18 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 20/305 constraints. Problems are: Problem set: 5 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/445 variables, and 305 constraints, problems are : Problem set: 5 solved, 197 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/240 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 5 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 5 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/63 constraints. Problems are: Problem set: 5 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/65 constraints. Problems are: Problem set: 5 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 240/305 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 8 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/325 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/345 constraints. Problems are: Problem set: 5 solved, 197 unsolved
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/365 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/385 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/405 constraints. Problems are: Problem set: 8 solved, 194 unsolved
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/425 constraints. Problems are: Problem set: 8 solved, 194 unsolved
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/445 constraints. Problems are: Problem set: 11 solved, 191 unsolved
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/465 constraints. Problems are: Problem set: 13 solved, 189 unsolved
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 66 places in 384 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/485 constraints. Problems are: Problem set: 13 solved, 189 unsolved
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 60151ms, After SMT, problems are : Problem set: 13 solved, 189 unsolved
Search for dead transitions found 13 dead transitions in 60154ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 240/240 places, 192/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-01 07:11:33] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60779 ms. Remains : 240/240 places, 192/205 transitions.
RANDOM walk for 40000 steps (826 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (179 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1237839 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Probabilistic random walk after 1237839 steps, saw 196242 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
// Phase 1: matrix 192 rows 240 cols
[2024-06-01 07:11:36] [INFO ] Computed 65 invariants in 3 ms
[2024-06-01 07:11:36] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/233 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 192/425 variables, 233/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/432 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/432 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/233 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/425 variables, 233/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/432 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/432 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 240/240 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 77 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 192/192 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 240/240 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-06-01 07:11:38] [INFO ] Redundant transitions in 2 ms returned []
Running 189 sub problems to find dead transitions.
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:38] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/245 constraints. Problems are: Problem set: 1 solved, 188 unsolved
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/265 constraints. Problems are: Problem set: 2 solved, 187 unsolved
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 20/285 constraints. Problems are: Problem set: 2 solved, 187 unsolved
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 20/305 constraints. Problems are: Problem set: 2 solved, 187 unsolved
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
SMT process timed out in 30135ms, After SMT, problems are : Problem set: 2 solved, 187 unsolved
Search for dead transitions found 2 dead transitions in 30138ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 240/240 places, 190/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 190
Applied a total of 1 rules in 8 ms. Remains 239 /240 variables (removed 1) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 239 cols
[2024-06-01 07:12:08] [INFO ] Computed 65 invariants in 3 ms
[2024-06-01 07:12:08] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:12:09] [INFO ] Invariant cache hit.
[2024-06-01 07:12:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:12:09] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 372 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/240 places, 190/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 31064 ms. Remains : 238/240 places, 190/192 transitions.
RANDOM walk for 40000 steps (819 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (185 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1163549 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1163549 steps, saw 186970 distinct states, run finished after 3004 ms. (steps per millisecond=387 ) properties seen :0
// Phase 1: matrix 190 rows 238 cols
[2024-06-01 07:12:12] [INFO ] Computed 64 invariants in 4 ms
[2024-06-01 07:12:12] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/207 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/231 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 190/421 variables, 231/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 7/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/428 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 238/238 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/204 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/207 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/231 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 190/421 variables, 231/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/428 variables, 7/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/428 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3342 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 238/238 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints]
After SMT, in 3637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 77 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 238/238 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-06-01 07:12:16] [INFO ] Invariant cache hit.
[2024-06-01 07:12:16] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 07:12:16] [INFO ] Invariant cache hit.
[2024-06-01 07:12:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:12:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-06-01 07:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-01 07:12:16] [INFO ] Invariant cache hit.
[2024-06-01 07:12:16] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/238 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 5 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30128ms, After SMT, problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30589 ms. Remains : 238/238 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 608 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 236 /238 variables (removed 2) and now considering 190/190 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 236 cols
[2024-06-01 07:12:46] [INFO ] Computed 62 invariants in 2 ms
[2024-06-01 07:12:46] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:12:46] [INFO ] [Nat]Absence check using 47 positive place invariants in 13 ms returned sat
[2024-06-01 07:12:46] [INFO ] [Nat]Absence check using 47 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 07:12:47] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 513 ms
TRAPS : Iteration 1
[2024-06-01 07:12:47] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:12:47] [INFO ] After 1211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1312 ms.
[2024-06-01 07:12:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-06-01 07:12:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 190 transitions and 716 arcs took 13 ms.
[2024-06-01 07:12:48] [INFO ] Flatten gal took : 60 ms
Total runtime 177118 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BusinessProcesses-PT-13-ReachabilityFireability-2024-14
BK_STOP 1717225968576
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BusinessProcesses-PT-13-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/4107/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-13, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;