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-171620399800555.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-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716335961944

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:59:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:59:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:59:24] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-21 23:59:24] [INFO ] Transformed 624 places.
[2024-05-21 23:59:24] [INFO ] Transformed 564 transitions.
[2024-05-21 23:59:24] [INFO ] Found NUPN structural information;
[2024-05-21 23:59:24] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 228 place count 478 transition count 423
Iterating global reduction 1 with 43 rules applied. Total rules applied 271 place count 478 transition count 423
Applied a total of 271 rules in 202 ms. Remains 478 /616 variables (removed 138) and now considering 423/556 (removed 133) transitions.
// Phase 1: matrix 423 rows 478 cols
[2024-05-21 23:59:24] [INFO ] Computed 94 invariants in 36 ms
[2024-05-21 23:59:24] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-21 23:59:25] [INFO ] Invariant cache hit.
[2024-05-21 23:59:25] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-21 23:59:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 22 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 87 places in 2986 ms of which 29 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 100 places in 332 ms of which 3 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 107 places in 185 ms of which 3 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 106 places in 3354 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 88 places in 8045 ms of which 22 ms to minimize.
SMT process timed out in 31094ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 31125ms
Starting structural reductions in LTL mode, iteration 1 : 478/616 places, 423/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32519 ms. Remains : 478/616 places, 423/556 transitions.
Support contains 30 out of 478 places after structural reductions.
[2024-05-21 23:59:57] [INFO ] Flatten gal took : 124 ms
[2024-05-21 23:59:57] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:59:57] [INFO ] Input system was already deterministic with 423 transitions.
RANDOM walk for 40000 steps (269 resets) in 2107 ms. (18 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40002 steps (47 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (48 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (45 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (47 resets) in 338 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (45 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
[2024-05-21 23:59:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 190/206 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 146/352 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 116/468 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/469 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 417/886 variables, 469/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 13/899 variables, 7/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/899 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/901 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/901 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 572 constraints, problems are : Problem set: 0 solved, 8 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 190/206 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 5/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 146/352 variables, 33/60 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 116/468 variables, 38/100 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/469 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 417/886 variables, 469/570 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 7/577 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 7 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/886 variables, 20/597 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 8 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 5 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
SMT process timed out in 6025ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 213 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1082 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 472 transition count 368
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 425 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 424 transition count 367
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 98 place count 424 transition count 274
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 298 place count 317 transition count 274
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 303 place count 312 transition count 269
Iterating global reduction 3 with 5 rules applied. Total rules applied 308 place count 312 transition count 269
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 559 place count 184 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 561 place count 183 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 563 place count 183 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 565 place count 181 transition count 148
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 569 place count 181 transition count 148
Applied a total of 569 rules in 155 ms. Remains 181 /478 variables (removed 297) and now considering 148/423 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 181/478 places, 148/423 transitions.
RANDOM walk for 3028 steps (96 resets) in 165 ms. (18 steps per ms) remains 0/7 properties
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1089 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 411
Applied a total of 24 rules in 59 ms. Remains 466 /478 variables (removed 12) and now considering 411/423 (removed 12) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-22 00:00:05] [INFO ] Computed 94 invariants in 35 ms
[2024-05-22 00:00:05] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 00:00:05] [INFO ] Invariant cache hit.
[2024-05-22 00:00:06] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-22 00:00:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 5 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 4 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 5 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 5 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 7 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 15 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 25 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/877 variables, and 194 constraints, problems are : Problem set: 25 solved, 385 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 25 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 25 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 25 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 25 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 25 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 100/194 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/214 constraints. Problems are: Problem set: 27 solved, 383 unsolved
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/234 constraints. Problems are: Problem set: 27 solved, 383 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/254 constraints. Problems are: Problem set: 27 solved, 383 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/274 constraints. Problems are: Problem set: 27 solved, 383 unsolved
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 4 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 20/294 constraints. Problems are: Problem set: 27 solved, 383 unsolved
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 16 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 7 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 20/314 constraints. Problems are: Problem set: 32 solved, 378 unsolved
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 1 ms to minimize.
SMT process timed out in 60220ms, After SMT, problems are : Problem set: 32 solved, 378 unsolved
Search for dead transitions found 32 dead transitions in 60231ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 379/423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 379
Applied a total of 1 rules in 17 ms. Remains 465 /466 variables (removed 1) and now considering 379/379 (removed 0) transitions.
// Phase 1: matrix 379 rows 465 cols
[2024-05-22 00:01:06] [INFO ] Computed 98 invariants in 5 ms
[2024-05-22 00:01:06] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-22 00:01:06] [INFO ] Invariant cache hit.
[2024-05-22 00:01:07] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1025 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 463/478 places, 379/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 463 /463 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62114 ms. Remains : 463/478 places, 379/423 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-02
Stuttering criterion allowed to conclude after 658 steps with 12 reset in 5 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-02 finished in 62439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (X(X(!p2))||p1)) U p0))'
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 472 transition count 417
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 469 transition count 414
Applied a total of 18 rules in 24 ms. Remains 469 /478 variables (removed 9) and now considering 414/423 (removed 9) transitions.
// Phase 1: matrix 414 rows 469 cols
[2024-05-22 00:01:07] [INFO ] Computed 94 invariants in 23 ms
[2024-05-22 00:01:07] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-22 00:01:07] [INFO ] Invariant cache hit.
[2024-05-22 00:01:08] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/469 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 20/114 constraints. Problems are: Problem set: 20 solved, 393 unsolved
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 20/134 constraints. Problems are: Problem set: 25 solved, 388 unsolved
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 5 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:01:23] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:01:23] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:01:23] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 20/154 constraints. Problems are: Problem set: 25 solved, 388 unsolved
[2024-05-22 00:01:26] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:01:26] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:01:26] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:26] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:01:27] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:01:28] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:01:29] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:01:30] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:01:30] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 20/174 constraints. Problems are: Problem set: 25 solved, 388 unsolved
[2024-05-22 00:01:30] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:01:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:01:30] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:01:31] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:01:31] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:01:31] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:01:31] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:01:31] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:32] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 20/194 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:01:34] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:01:35] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:01:36] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 20/214 constraints. Problems are: Problem set: 31 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/883 variables, and 214 constraints, problems are : Problem set: 31 solved, 382 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 31 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 37/37 constraints. Problems are: Problem set: 31 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/37 constraints. Problems are: Problem set: 31 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/469 variables, 56/93 constraints. Problems are: Problem set: 31 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 1/94 constraints. Problems are: Problem set: 31 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 120/214 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:01:41] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:01:41] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:01:41] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:41] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 20/234 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 5 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 6 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 20/254 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:01:50] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:01:50] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 5 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 20/274 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 20/294 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 20/314 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 5 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 2 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 5 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 2 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 20/334 constraints. Problems are: Problem set: 34 solved, 379 unsolved
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 2 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 60180ms, After SMT, problems are : Problem set: 34 solved, 379 unsolved
Search for dead transitions found 34 dead transitions in 60191ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 469/478 places, 380/423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 380
Applied a total of 1 rules in 17 ms. Remains 468 /469 variables (removed 1) and now considering 380/380 (removed 0) transitions.
// Phase 1: matrix 380 rows 468 cols
[2024-05-22 00:02:08] [INFO ] Computed 100 invariants in 5 ms
[2024-05-22 00:02:08] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-22 00:02:08] [INFO ] Invariant cache hit.
[2024-05-22 00:02:09] [INFO ] Implicit Places using invariants and state equation in 460 ms returned [151, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 741 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 466/478 places, 380/423 transitions.
Applied a total of 0 rules in 11 ms. Remains 466 /466 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61617 ms. Remains : 466/478 places, 380/423 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 206 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-05 finished in 61908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 225 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 471 transition count 365
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 421 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 421 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 320 place count 304 transition count 264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 296 transition count 256
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 296 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 587 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 589 place count 167 transition count 137
Applied a total of 589 rules in 81 ms. Remains 167 /478 variables (removed 311) and now considering 137/423 (removed 286) transitions.
// Phase 1: matrix 137 rows 167 cols
[2024-05-22 00:02:09] [INFO ] Computed 73 invariants in 2 ms
[2024-05-22 00:02:09] [INFO ] Implicit Places using invariants in 237 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 29, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 239 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/478 places, 137/423 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 145 transition count 136
Applied a total of 2 rules in 11 ms. Remains 145 /146 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 145 cols
[2024-05-22 00:02:09] [INFO ] Computed 52 invariants in 3 ms
[2024-05-22 00:02:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 00:02:09] [INFO ] Invariant cache hit.
[2024-05-22 00:02:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:02:10] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [1, 3, 7, 10, 33, 35, 37, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 63, 65, 67, 69, 71, 73, 75, 77, 85, 87, 89, 91, 93]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 296 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/478 places, 136/423 transitions.
Graph (complete) has 347 edges and 113 vertex of which 102 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 102 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 93 transition count 122
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 33 place count 79 transition count 79
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 79 transition count 79
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 79 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 76 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 75 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 75 transition count 75
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 72 place count 66 transition count 67
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 4 with 2 rules applied. Total rules applied 74 place count 65 transition count 66
Applied a total of 74 rules in 15 ms. Remains 65 /113 variables (removed 48) and now considering 66/136 (removed 70) transitions.
// Phase 1: matrix 66 rows 65 cols
[2024-05-22 00:02:10] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 00:02:10] [INFO ] Implicit Places using invariants in 65 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 62/478 places, 66/423 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 720 ms. Remains : 62/478 places, 66/423 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 411
Applied a total of 24 rules in 61 ms. Remains 466 /478 variables (removed 12) and now considering 411/423 (removed 12) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-22 00:02:10] [INFO ] Computed 94 invariants in 8 ms
[2024-05-22 00:02:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 00:02:10] [INFO ] Invariant cache hit.
[2024-05-22 00:02:11] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-22 00:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 4 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 25 solved, 385 unsolved
Search for dead transitions found 25 dead transitions in 30163ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 386/423 transitions.
Applied a total of 0 rules in 11 ms. Remains 466 /466 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30975 ms. Remains : 466/478 places, 386/423 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 682 reset in 304 ms.
Product exploration explored 100000 steps with 681 reset in 248 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1017 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (270 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2193 steps, run visited all 1 properties in 21 ms. (steps per millisecond=104 )
Probabilistic random walk after 2193 steps, saw 1969 distinct states, run finished after 25 ms. (steps per millisecond=87 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 32102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 222 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 471 transition count 366
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 100 place count 422 transition count 266
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 317 place count 305 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 298 transition count 259
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 298 transition count 259
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 586 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 588 place count 167 transition count 138
Applied a total of 588 rules in 50 ms. Remains 167 /478 variables (removed 311) and now considering 138/423 (removed 285) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-22 00:02:42] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:02:42] [INFO ] Implicit Places using invariants in 329 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 342 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/478 places, 138/423 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 147/478 places, 138/423 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-12
Product exploration explored 100000 steps with 17997 reset in 271 ms.
Product exploration explored 100000 steps with 17919 reset in 237 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
RANDOM walk for 38349 steps (7592 resets) in 266 ms. (143 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 147 cols
[2024-05-22 00:02:43] [INFO ] Computed 52 invariants in 5 ms
[2024-05-22 00:02:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 00:02:43] [INFO ] Invariant cache hit.
[2024-05-22 00:02:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [1, 3, 7, 10, 33, 35, 37, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 63, 65, 67, 69, 71, 73, 78, 86, 88, 90, 92, 94]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 327 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/147 places, 138/138 transitions.
Graph (complete) has 379 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 105 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 97 transition count 125
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 31 place count 83 transition count 82
Iterating global reduction 2 with 14 rules applied. Total rules applied 45 place count 83 transition count 82
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 83 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 80 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 79 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 79 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 67 place count 72 transition count 71
Applied a total of 67 rules in 8 ms. Remains 72 /116 variables (removed 44) and now considering 71/138 (removed 67) transitions.
// Phase 1: matrix 71 rows 72 cols
[2024-05-22 00:02:44] [INFO ] Computed 17 invariants in 0 ms
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants in 60 ms returned [5, 6, 7, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/147 places, 71/138 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 67 transition count 70
Applied a total of 2 rules in 3 ms. Remains 67 /68 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 67 cols
[2024-05-22 00:02:44] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 00:02:44] [INFO ] Invariant cache hit.
[2024-05-22 00:02:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [27, 29, 31]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 121 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 64/147 places, 70/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 61 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 60 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 60 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 60 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 29 place count 48 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 46 transition count 55
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 46 transition count 55
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 3 with 2 rules applied. Total rules applied 35 place count 45 transition count 54
Applied a total of 35 rules in 5 ms. Remains 45 /64 variables (removed 19) and now considering 54/70 (removed 16) transitions.
// Phase 1: matrix 54 rows 45 cols
[2024-05-22 00:02:44] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants in 34 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 44/147 places, 54/138 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 53
Applied a total of 2 rules in 2 ms. Remains 43 /44 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 43 cols
[2024-05-22 00:02:44] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 00:02:44] [INFO ] Invariant cache hit.
[2024-05-22 00:02:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:02:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 43/147 places, 53/138 transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 665 ms. Remains : 43/147 places, 53/138 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8200 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2534 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 76 steps, run visited all 1 properties in 4 ms. (steps per millisecond=19 )
Probabilistic random walk after 76 steps, saw 52 distinct states, run finished after 5 ms. (steps per millisecond=15 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18357 reset in 110 ms.
Product exploration explored 100000 steps with 18293 reset in 156 ms.
Built C files in :
/tmp/ltsmin3434282864068004838
[2024-05-22 00:02:45] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-22 00:02:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:45] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-22 00:02:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:45] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-22 00:02:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3434282864068004838
Running compilation step : cd /tmp/ltsmin3434282864068004838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin3434282864068004838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin3434282864068004838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4256712058951335675.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-12 finished in 3347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U G(p1))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 473 transition count 418
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 473 transition count 418
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 470 transition count 415
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 470 transition count 415
Applied a total of 16 rules in 24 ms. Remains 470 /478 variables (removed 8) and now considering 415/423 (removed 8) transitions.
// Phase 1: matrix 415 rows 470 cols
[2024-05-22 00:02:45] [INFO ] Computed 94 invariants in 4 ms
[2024-05-22 00:02:46] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:02:46] [INFO ] Invariant cache hit.
[2024-05-22 00:02:46] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:02:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 14 solved, 400 unsolved
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 6 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 14 solved, 400 unsolved
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 19 solved, 395 unsolved
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 30 solved, 384 unsolved
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 4 ms to minimize.
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:11] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/194 constraints. Problems are: Problem set: 33 solved, 381 unsolved
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:03:13] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:13] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:03:13] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:13] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:03:13] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:14] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:03:14] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:03:14] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:03:14] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:03:14] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
Problem TDEAD342 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/214 constraints. Problems are: Problem set: 34 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/885 variables, and 214 constraints, problems are : Problem set: 34 solved, 380 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 34 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 120/214 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/234 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:03:25] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:03:25] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:03:25] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:03:26] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:03:26] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:26] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:27] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/254 constraints. Problems are: Problem set: 35 solved, 379 unsolved
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 5 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/274 constraints. Problems are: Problem set: 35 solved, 379 unsolved
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 94 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:03:37] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:03:37] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:03:37] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:03:38] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/294 constraints. Problems are: Problem set: 35 solved, 379 unsolved
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 86 places in 196 ms of which 3 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/314 constraints. Problems are: Problem set: 35 solved, 379 unsolved
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/885 variables, and 317 constraints, problems are : Problem set: 35 solved, 379 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 0/414 constraints, Known Traps: 223/223 constraints]
After SMT, in 60144ms problems are : Problem set: 35 solved, 379 unsolved
Search for dead transitions found 35 dead transitions in 60150ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/478 places, 380/423 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 380
Applied a total of 2 rules in 8 ms. Remains 468 /470 variables (removed 2) and now considering 380/380 (removed 0) transitions.
// Phase 1: matrix 380 rows 468 cols
[2024-05-22 00:03:46] [INFO ] Computed 100 invariants in 2 ms
[2024-05-22 00:03:46] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:03:46] [INFO ] Invariant cache hit.
[2024-05-22 00:03:47] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 559 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 467/478 places, 380/423 transitions.
Applied a total of 0 rules in 6 ms. Remains 467 /467 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61508 ms. Remains : 467/478 places, 380/423 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14
Product exploration explored 100000 steps with 681 reset in 189 ms.
Product exploration explored 100000 steps with 681 reset in 196 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 990 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (271 resets) in 259 ms. (153 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 484 ms. (82 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (51 resets) in 281 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
// Phase 1: matrix 380 rows 467 cols
[2024-05-22 00:03:48] [INFO ] Computed 99 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 116/458 variables, 44/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 374/832 variables, 458/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/845 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/845 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/847 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/847 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/847 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 566 constraints, problems are : Problem set: 0 solved, 3 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/458 variables, 44/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 374/832 variables, 458/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 10/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/845 variables, 7/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/845 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/845 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/847 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/847 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/847 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 4350ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 709 ms.
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 380/380 transitions.
Graph (trivial) has 212 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 983 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 461 transition count 326
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 415 transition count 326
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 94 place count 415 transition count 228
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 307 place count 300 transition count 228
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 573 place count 161 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 575 place count 160 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 577 place count 160 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 579 place count 158 transition count 103
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 580 place count 158 transition count 103
Applied a total of 580 rules in 44 ms. Remains 158 /467 variables (removed 309) and now considering 103/380 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 158/467 places, 103/380 transitions.
RANDOM walk for 40000 steps (1482 resets) in 179 ms. (222 steps per ms) remains 1/3 properties
BEST_FIRST walk for 2105 steps (25 resets) in 9 ms. (210 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 252 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 467 /467 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-22 00:03:54] [INFO ] Invariant cache hit.
[2024-05-22 00:03:54] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-22 00:03:54] [INFO ] Invariant cache hit.
[2024-05-22 00:03:55] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-05-22 00:03:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:18] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 7 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)timeout

(s10 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/847 variables, and 236 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 137/137 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 137/236 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 5 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
SMT process timed out in 60154ms, After SMT, problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 467/467 places, 380/380 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 990 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (272 resets) in 376 ms. (106 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (54 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (51 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
[2024-05-22 00:04:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 116/458 variables, 44/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 374/832 variables, 458/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/845 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/845 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/847 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/847 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/847 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 566 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 3 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 116/458 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 374/832 variables, 458/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/845 variables, 7/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/845 variables, 6/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/845 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/847 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/847 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/847 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3842 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 38/38 constraints]
After SMT, in 4258ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 16742 steps, including 94 resets, run visited all 3 properties in 52 ms. (steps per millisecond=321 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 58 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 680 reset in 240 ms.
Product exploration explored 100000 steps with 676 reset in 218 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 380/380 transitions.
Graph (trivial) has 212 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 984 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 461 transition count 373
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 47 place count 461 transition count 424
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 118 place count 461 transition count 424
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 447 transition count 398
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 447 transition count 398
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 256 places in 1 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 300 place count 447 transition count 398
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 337 place count 410 transition count 361
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 374 place count 410 transition count 361
Deduced a syphon composed of 219 places in 0 ms
Applied a total of 374 rules in 125 ms. Remains 410 /467 variables (removed 57) and now considering 361/380 (removed 19) transitions.
[2024-05-22 00:05:02] [INFO ] Redundant transitions in 26 ms returned []
Running 360 sub problems to find dead transitions.
// Phase 1: matrix 361 rows 410 cols
[2024-05-22 00:05:02] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:05:02] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 56/98 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 39 places in 929 ms of which 1 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/119 constraints. Problems are: Problem set: 24 solved, 336 unsolved
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/139 constraints. Problems are: Problem set: 139 solved, 221 unsolved
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/159 constraints. Problems are: Problem set: 180 solved, 180 unsolved
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/179 constraints. Problems are: Problem set: 226 solved, 134 unsolved
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/199 constraints. Problems are: Problem set: 245 solved, 115 unsolved
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 20/219 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 11/230 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 10/240 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 1/241 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 5/246 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 1/247 constraints. Problems are: Problem set: 254 solved, 106 unsolved
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 1/248 constraints. Problems are: Problem set: 254 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 0/248 constraints. Problems are: Problem set: 254 solved, 106 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 17 (OVERLAPS) 360/770 variables, 410/658 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 10/668 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 1/669 constraints. Problems are: Problem set: 259 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/771 variables, and 669 constraints, problems are : Problem set: 259 solved, 101 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 410/410 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 150/150 constraints]
Escalating to Integer solving :Problem set: 259 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 171/361 variables, 56/56 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 1/57 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 150/207 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/227 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:05:35] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:05:37] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:05:37] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 20/247 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:37] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/248 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/248 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 46/407 variables, 42/290 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:38] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2024-05-22 00:05:38] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:05:38] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:05:38] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 11/301 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 4/305 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 8/313 constraints. Problems are: Problem set: 259 solved, 101 unsolved
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 1/314 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/314 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 360/767 variables, 407/721 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/767 variables, 10/731 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 101/832 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/832 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 18 (OVERLAPS) 3/770 variables, 3/835 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 0/835 constraints. Problems are: Problem set: 259 solved, 101 unsolved
At refinement iteration 20 (OVERLAPS) 1/771 variables, 1/836 constraints. Problems are: Problem set: 259 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 836 constraints, problems are : Problem set: 259 solved, 101 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 410/410 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 101/360 constraints, Known Traps: 215/215 constraints]
After SMT, in 60275ms problems are : Problem set: 259 solved, 101 unsolved
Search for dead transitions found 259 dead transitions in 60282ms
Found 259 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 259 transitions
Dead transitions reduction (with SMT) removed 259 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/467 places, 102/380 transitions.
Graph (complete) has 722 edges and 410 vertex of which 191 are kept as prefixes of interest. Removing 219 places using SCC suffix rule.1 ms
Discarding 219 places :
Also discarding 0 output transitions
Ensure Unique test removed 30 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 161 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 10 ms. Remains 161 /410 variables (removed 249) and now considering 114/102 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 161/467 places, 114/380 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60479 ms. Remains : 161/467 places, 114/380 transitions.
Built C files in :
/tmp/ltsmin2478050417532349201
[2024-05-22 00:06:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2478050417532349201
Running compilation step : cd /tmp/ltsmin2478050417532349201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 750 ms.
Running link step : cd /tmp/ltsmin2478050417532349201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2478050417532349201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10033466228706782818.hoa' '--buchi-type=spotba'
LTSmin run took 1159 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 199085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G((p1 U p0))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 471 transition count 416
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 468 transition count 413
Applied a total of 20 rules in 18 ms. Remains 468 /478 variables (removed 10) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 468 cols
[2024-05-22 00:06:04] [INFO ] Computed 94 invariants in 2 ms
[2024-05-22 00:06:05] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 00:06:05] [INFO ] Invariant cache hit.
[2024-05-22 00:06:05] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:06:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 1 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/114 constraints. Problems are: Problem set: 24 solved, 388 unsolved
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 1 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/134 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/154 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/174 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/194 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/214 constraints. Problems are: Problem set: 32 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/881 variables, and 214 constraints, problems are : Problem set: 32 solved, 380 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 32 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 32 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 32 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 32 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 32 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 120/214 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/234 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/254 constraints. Problems are: Problem set: 33 solved, 379 unsolved
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/274 constraints. Problems are: Problem set: 33 solved, 379 unsolved
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 85 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 6 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 5 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/294 constraints. Problems are: Problem set: 33 solved, 379 unsolved
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/314 constraints. Problems are: Problem set: 33 solved, 379 unsolved
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 5 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 5 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 20/334 constraints. Problems are: Problem set: 33 solved, 379 unsolved
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 2 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/881 variables, and 349 constraints, problems are : Problem set: 33 solved, 379 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 255/255 constraints]
After SMT, in 60113ms problems are : Problem set: 33 solved, 379 unsolved
Search for dead transitions found 33 dead transitions in 60116ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/478 places, 380/423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 380
Applied a total of 1 rules in 22 ms. Remains 467 /468 variables (removed 1) and now considering 380/380 (removed 0) transitions.
// Phase 1: matrix 380 rows 467 cols
[2024-05-22 00:07:05] [INFO ] Computed 99 invariants in 2 ms
[2024-05-22 00:07:06] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 00:07:06] [INFO ] Invariant cache hit.
[2024-05-22 00:07:06] [INFO ] Implicit Places using invariants and state equation in 409 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 613 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 465/478 places, 380/423 transitions.
Applied a total of 0 rules in 6 ms. Remains 465 /465 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61539 ms. Remains : 465/478 places, 380/423 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 19968 reset in 217 ms.
Product exploration explored 100000 steps with 20007 reset in 167 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 990 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (272 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (43 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (48 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 231 ms. (172 steps per ms) remains 2/4 properties
// Phase 1: matrix 380 rows 465 cols
[2024-05-22 00:07:08] [INFO ] Computed 97 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/342 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/456 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 374/830 variables, 456/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/843 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/845 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/845 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/845 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 562 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/342 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:07:08] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:07:08] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:07:08] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:07:08] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 1 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 114/456 variables, 42/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 374/830 variables, 456/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:07:11] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 12 (OVERLAPS) 13/843 variables, 7/586 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:07:11] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:07:11] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/843 variables, 2/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/843 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/845 variables, 2/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/845 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/845 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 845/845 variables, and 590 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3031 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 3338ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 380/380 transitions.
Graph (trivial) has 214 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 983 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 459 transition count 325
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 412 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 411 transition count 324
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 98 place count 411 transition count 226
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 311 place count 296 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 295 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 295 transition count 225
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 577 place count 158 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 579 place count 157 transition count 102
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 581 place count 157 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 583 place count 155 transition count 100
Applied a total of 583 rules in 34 ms. Remains 155 /465 variables (removed 310) and now considering 100/380 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 155/465 places, 100/380 transitions.
RANDOM walk for 241 steps (5 resets) in 7 ms. (30 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 380/380 transitions.
Graph (trivial) has 211 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 984 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 458 transition count 326
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 412 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 411 transition count 325
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 411 transition count 229
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 298 transition count 229
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 569 place count 161 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 160 transition count 106
Applied a total of 571 rules in 26 ms. Remains 160 /465 variables (removed 305) and now considering 106/380 (removed 274) transitions.
// Phase 1: matrix 106 rows 160 cols
[2024-05-22 00:07:11] [INFO ] Computed 70 invariants in 1 ms
[2024-05-22 00:07:11] [INFO ] Implicit Places using invariants in 190 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 41, 42, 43, 44, 45]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 193 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/465 places, 106/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 140/465 places, 106/380 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28555 steps (7085 resets) in 97 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21790 reset in 179 ms.
Product exploration explored 100000 steps with 21951 reset in 191 ms.
Built C files in :
/tmp/ltsmin12529637310631631141
[2024-05-22 00:07:12] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2024-05-22 00:07:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:07:12] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2024-05-22 00:07:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:07:12] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2024-05-22 00:07:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:07:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12529637310631631141
Running compilation step : cd /tmp/ltsmin12529637310631631141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin12529637310631631141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12529637310631631141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15122061057047762231.hoa' '--buchi-type=spotba'
LTSmin run took 732 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 69135 ms.
All properties solved by simple procedures.
Total runtime 470346 ms.

BK_STOP 1716336434189

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-14"
export BK_EXAMINATION="LTLCardinality"
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-14, examination is LTLCardinality"
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-171620399800555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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