About the Execution of ITS-Tools for BusinessProcesses-PT-13
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
608.676 | 171952.00 | 396204.00 | 57.70 | TTTFTTFTFFTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-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 itstools
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 r048-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 1716335747812
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 23:55:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:55:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:55:49] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-21 23:55:49] [INFO ] Transformed 593 places.
[2024-05-21 23:55:49] [INFO ] Transformed 536 transitions.
[2024-05-21 23:55:49] [INFO ] Found NUPN structural information;
[2024-05-21 23:55:49] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
[2024-05-21 23:55:50] [INFO ] Flatten gal took : 121 ms
[2024-05-21 23:55:50] [INFO ] Flatten gal took : 64 ms
[2024-05-21 23:55:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5983568682030221003.gal : 28 ms
[2024-05-21 23:55:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13396684936084689356.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5983568682030221003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13396684936084689356.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (283 resets) in 1974 ms. (20 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
Loading property file /tmp/ReachabilityCardinality13396684936084689356.prop.
BEST_FIRST walk for 40004 steps (51 resets) in 384 ms. (103 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40003 steps (56 resets) in 549 ms. (72 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :28 after 125
BEST_FIRST walk for 40003 steps (35 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :125 after 247
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-2024-11 is true.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :247 after 4.84367e+14
BEST_FIRST walk for 40004 steps (49 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (59 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (34 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (36 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (50 resets) in 550 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (53 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (41 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
// Phase 1: matrix 528 rows 585 cols
[2024-05-21 23:55:51] [INFO ] Computed 95 invariants in 38 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 2246 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-05-21 23:55:54] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 47 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 21 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 128 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 2 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-05-21 23:55:56] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 2 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 14 places in 642 ms of which 2 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 17 places in 379 ms of which 2 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:59] [INFO ] Deduced a trap composed of 14 places in 1144 ms of which 44 ms to minimize.
SMT process timed out in 7588ms, After SMT, 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.2 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 14 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 314 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 335 ms. Remains : 317/585 places, 274/528 transitions.
RANDOM walk for 40000 steps (547 resets) in 651 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (119 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (123 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (113 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (110 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (116 resets) in 136 ms. (291 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (119 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
// Phase 1: matrix 274 rows 317 cols
[2024-05-21 23:56:00] [INFO ] Computed 81 invariants in 6 ms
[2024-05-21 23:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 145/253 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/256 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 50/306 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 274/581 variables, 307/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/591 variables, 10/396 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 399 constraints, problems are : Problem set: 0 solved, 7 unsolved in 799 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: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 145/253 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 6 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 9 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 17/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/256 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 50/306 variables, 28/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:56:09] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:56:09] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:56:09] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/307 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 274/581 variables, 307/488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/581 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:09] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 10/591 variables, 10/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/591 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/591 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/591 variables, 16/526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:13] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:13] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/591 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/591 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/591 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 0/591 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 534 constraints, problems are : Problem set: 0 solved, 7 unsolved in 16228 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: 7/7 constraints, Known Traps: 128/128 constraints]
After SMT, in 17086ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1660 ms.
Support contains 85 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 273
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 316 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 314 transition count 271
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 6 place count 314 transition count 260
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 29 place count 302 transition count 260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 33 place count 298 transition count 256
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 298 transition count 256
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 85 place count 274 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 273 transition count 236
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 88 place count 273 transition count 235
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 89 place count 273 transition count 235
Applied a total of 89 rules in 48 ms. Remains 273 /317 variables (removed 44) and now considering 235/274 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 273/317 places, 235/274 transitions.
RANDOM walk for 40000 steps (763 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (167 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (169 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (117 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (117 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (169 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1389885 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :4 out of 5
Probabilistic random walk after 1389885 steps, saw 219375 distinct states, run finished after 3005 ms. (steps per millisecond=462 ) properties seen :4
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-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 235 rows 273 cols
[2024-05-21 23:56:22] [INFO ] Computed 80 invariants in 7 ms
[2024-05-21 23:56:22] [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) 144/221 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/224 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/263 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/498 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/508 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/508 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 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) 144/221 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/224 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/263 variables, 25/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 235/498 variables, 263/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/508 variables, 10/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/508 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/508 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4127 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 4450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 77 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 235/235 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 272 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 272 transition count 232
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 269 transition count 232
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 264 transition count 227
Applied a total of 17 rules in 37 ms. Remains 264 /273 variables (removed 9) and now considering 227/235 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 264/273 places, 227/235 transitions.
RANDOM walk for 40000 steps (827 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1227291 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :0 out of 1
Probabilistic random walk after 1227291 steps, saw 194568 distinct states, run finished after 3001 ms. (steps per millisecond=408 ) properties seen :0
// Phase 1: matrix 227 rows 264 cols
[2024-05-21 23:56:29] [INFO ] Computed 79 invariants in 6 ms
[2024-05-21 23:56:29] [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 286 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-05-21 23:56:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 12 places in 30 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-05-21 23:56:30] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 25 places in 42 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-05-21 23:56:30] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (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 1051 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 1369ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 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 25 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 25 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 9 ms. Remains 264 /264 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 23:56:31] [INFO ] Invariant cache hit.
[2024-05-21 23:56:31] [INFO ] Implicit Places using invariants in 188 ms returned [12, 19, 39, 41, 68, 70, 72, 74, 76, 78, 80, 82, 84, 209, 213, 237]
[2024-05-21 23:56:31] [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 199 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 20 ms. Remains 246 /254 variables (removed 8) and now considering 207/227 (removed 20) transitions.
// Phase 1: matrix 207 rows 246 cols
[2024-05-21 23:56:31] [INFO ] Computed 69 invariants in 4 ms
[2024-05-21 23:56:31] [INFO ] Implicit Places using invariants in 120 ms returned [65, 67]
[2024-05-21 23:56:31] [INFO ] Actually due to overlaps returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 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 15 ms. Remains 244 /245 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 244 cols
[2024-05-21 23:56:31] [INFO ] Computed 68 invariants in 2 ms
[2024-05-21 23:56:31] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:56:31] [INFO ] Invariant cache hit.
[2024-05-21 23:56:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:56:32] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [168, 170, 172]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 408 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 0 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 15 ms. Remains 240 /241 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 240 cols
[2024-05-21 23:56:32] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 23:56:32] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 23:56:32] [INFO ] Invariant cache hit.
[2024-05-21 23:56:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 23:56:32] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 387 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 1178 ms. Remains : 240/264 places, 205/227 transitions.
RANDOM walk for 40000 steps (825 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1394618 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 1
Probabilistic random walk after 1394618 steps, saw 215441 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2024-05-21 23:56:35] [INFO ] Invariant cache hit.
[2024-05-21 23:56:35] [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 233 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-05-21 23:56:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 65 places in 41 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-05-21 23:56:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 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 1358 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 1612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 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 7 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 7 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 6 ms. Remains 240 /240 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 23:56:37] [INFO ] Invariant cache hit.
[2024-05-21 23:56:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:56:37] [INFO ] Invariant cache hit.
[2024-05-21 23:56:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 23:56:37] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-21 23:56:37] [INFO ] Redundant transitions in 6 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 23:56:37] [INFO ] Invariant cache hit.
[2024-05-21 23:56:37] [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-05-21 23:56:39] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 57 places in 55 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, 202 unsolved
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 5 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 47 places in 55 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-05-21 23:56:42] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 55 places in 52 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-05-21 23:56:44] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 54 places in 55 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-05-21 23:56:47] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
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: 3 solved, 199 unsolved
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/205 constraints. Problems are: Problem set: 4 solved, 198 unsolved
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/225 constraints. Problems are: Problem set: 4 solved, 198 unsolved
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/245 constraints. Problems are: Problem set: 4 solved, 198 unsolved
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/265 constraints. Problems are: Problem set: 4 solved, 198 unsolved
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 20/285 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 20/305 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 20/325 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 20/345 constraints. Problems are: Problem set: 7 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/445 variables, and 345 constraints, problems are : Problem set: 7 solved, 195 unsolved in 30040 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: 280/280 constraints]
Escalating to Integer solving :Problem set: 7 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 49/63 constraints. Problems are: Problem set: 7 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/65 constraints. Problems are: Problem set: 7 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 280/345 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/365 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 20/385 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 20/405 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/425 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/445 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/465 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 20/485 constraints. Problems are: Problem set: 7 solved, 195 unsolved
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 20/505 constraints. Problems are: Problem set: 9 solved, 193 unsolved
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 20/525 constraints. Problems are: Problem set: 9 solved, 193 unsolved
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:57:36] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 20/545 constraints. Problems are: Problem set: 9 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/445 variables, and 545 constraints, problems are : Problem set: 9 solved, 193 unsolved in 30017 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: 0/202 constraints, Known Traps: 480/480 constraints]
After SMT, in 60124ms problems are : Problem set: 9 solved, 193 unsolved
Search for dead transitions found 9 dead transitions in 60128ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 240/240 places, 196/205 transitions.
Applied a total of 0 rules in 25 ms. Remains 240 /240 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 23:57:37] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60494 ms. Remains : 240/240 places, 196/205 transitions.
RANDOM walk for 40000 steps (831 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (180 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1423794 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :0 out of 1
Probabilistic random walk after 1423794 steps, saw 218767 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
// Phase 1: matrix 196 rows 240 cols
[2024-05-21 23:57:40] [INFO ] Computed 65 invariants in 4 ms
[2024-05-21 23:57:40] [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) 196/429 variables, 233/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/436 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/436 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 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-05-21 23:57:41] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 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-05-21 23:57:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 9 places in 33 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) 196/429 variables, 233/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/436 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/436 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 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: 5/5 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 77 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 240/240 places, 196/196 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 196/196 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 23:57:41] [INFO ] Invariant cache hit.
[2024-05-21 23:57:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:57:42] [INFO ] Invariant cache hit.
[2024-05-21 23:57:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 23:57:42] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [59, 202]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 340 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 354 ms. Remains : 238/240 places, 196/196 transitions.
RANDOM walk for 40000 steps (820 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1646238 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :0 out of 1
Probabilistic random walk after 1646238 steps, saw 245262 distinct states, run finished after 3002 ms. (steps per millisecond=548 ) properties seen :0
// Phase 1: matrix 196 rows 238 cols
[2024-05-21 23:57:45] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 23:57:45] [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) 126/203 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/206 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/231 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 196/427 variables, 231/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/434 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/434 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 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) 126/203 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/206 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/231 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/427 variables, 231/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/434 variables, 7/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/434 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4429 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 238/238 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 41/41 constraints]
After SMT, in 4764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 77 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 238/238 places, 196/196 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 23:57:50] [INFO ] Invariant cache hit.
[2024-05-21 23:57:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:57:50] [INFO ] Invariant cache hit.
[2024-05-21 23:57:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 23:57:50] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 23:57:50] [INFO ] Redundant transitions in 2 ms returned []
Running 193 sub problems to find dead transitions.
[2024-05-21 23:57:50] [INFO ] Invariant cache hit.
[2024-05-21 23:57:50] [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, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 3/238 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 4 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 4 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 9 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 7 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 0 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30497 ms. Remains : 238/238 places, 196/196 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 619 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 7 ms. Remains 236 /238 variables (removed 2) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 236 cols
[2024-05-21 23:58:20] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:58:20] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:58:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-21 23:58:20] [INFO ] [Nat]Absence check using 45 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-21 23:58:21] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 327 ms
TRAPS : Iteration 1
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1244 ms
TRAPS : Iteration 2
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 7 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
TRAPS : Iteration 3
[2024-05-21 23:58:23] [INFO ] After 2649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:58:23] [INFO ] After 2965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:58:23] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:58:23] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:58:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8642516828146349991.gal : 5 ms
[2024-05-21 23:58:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17212008590777092959.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8642516828146349991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17212008590777092959.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17212008590777092959.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 84
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84 after 2936
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2936 after 6426
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6426 after 261190
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :261190 after 8.43988e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.43988e+06 after 9.44805e+06
Detected timeout of ITS tools.
[2024-05-21 23:58:38] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:58:38] [INFO ] Applying decomposition
[2024-05-21 23:58:38] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2288144417575098297.txt' '-o' '/tmp/graph2288144417575098297.bin' '-w' '/tmp/graph2288144417575098297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2288144417575098297.bin' '-l' '-1' '-v' '-w' '/tmp/graph2288144417575098297.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:58:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:58:39] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-21 23:58:39] [INFO ] Flatten gal took : 71 ms
[2024-05-21 23:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 14 ms.
[2024-05-21 23:58:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18151959044644545211.gal : 7 ms
[2024-05-21 23:58:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7525624721216585774.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18151959044644545211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7525624721216585774.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7525624721216585774.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 51
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8638 after 6.31264e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.31264e+08 after 1.65105e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.60247e+09,0.443936,16632,1937,191,25867,2677,1014,34287,126,5477,0
Total reachable state count : 7602472614
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-2024-14 does not hold.
No reachable states exhibit your property : BusinessProcesses-PT-13-ReachabilityFireability-2024-14
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-ReachabilityFireability-2024-14,0,0.459939,16632,1,0,25867,2677,1178,34287,137,5477,10102
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-14 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 19013 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 170525 ms.
BK_STOP 1716335919764
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r048-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 ;