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.r047-tajo-171620398400540.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 greatspnxred
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305824661

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:37:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:37:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:37:06] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-21 15:37:06] [INFO ] Transformed 586 places.
[2024-05-21 15:37:06] [INFO ] Transformed 525 transitions.
[2024-05-21 15:37:06] [INFO ] Found NUPN structural information;
[2024-05-21 15:37:06] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 504 transition count 446
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 504 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 187 place count 470 transition count 412
Iterating global reduction 1 with 34 rules applied. Total rules applied 221 place count 470 transition count 412
Applied a total of 221 rules in 168 ms. Remains 470 /582 variables (removed 112) and now considering 412/521 (removed 109) transitions.
// Phase 1: matrix 412 rows 470 cols
[2024-05-21 15:37:06] [INFO ] Computed 95 invariants in 26 ms
[2024-05-21 15:37:07] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-21 15:37:07] [INFO ] Invariant cache hit.
[2024-05-21 15:37:07] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-05-21 15:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 31 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 15 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 12 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 10 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 405 unsolved
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 399 unsolved
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/195 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/215 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-05-21 15:37:37] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-21 15:37:37] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:37] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:38] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/882 variables, and 219 constraints, problems are : Problem set: 19 solved, 392 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 19 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 19 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 19 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 19 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 19 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 124/219 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-05-21 15:37:41] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 2 ms to minimize.
[2024-05-21 15:37:41] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:37:42] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 4 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/239 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 91 places in 241 ms of which 7 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
Problem TDEAD347 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/259 constraints. Problems are: Problem set: 23 solved, 388 unsolved
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
Problem TDEAD349 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/279 constraints. Problems are: Problem set: 24 solved, 387 unsolved
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/299 constraints. Problems are: Problem set: 24 solved, 387 unsolved
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 1 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:37:56] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:56] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/319 constraints. Problems are: Problem set: 24 solved, 387 unsolved
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 20/339 constraints. Problems are: Problem set: 29 solved, 382 unsolved
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 4 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 5 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 20/359 constraints. Problems are: Problem set: 29 solved, 382 unsolved
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
SMT process timed out in 60339ms, After SMT, problems are : Problem set: 29 solved, 382 unsolved
Search for dead transitions found 29 dead transitions in 60356ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/582 places, 383/521 transitions.
Applied a total of 0 rules in 18 ms. Remains 470 /470 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61893 ms. Remains : 470/582 places, 383/521 transitions.
Support contains 38 out of 470 places after structural reductions.
[2024-05-21 15:38:08] [INFO ] Flatten gal took : 133 ms
[2024-05-21 15:38:08] [INFO ] Flatten gal took : 80 ms
[2024-05-21 15:38:08] [INFO ] Input system was already deterministic with 383 transitions.
RANDOM walk for 40000 steps (289 resets) in 1705 ms. (23 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
// Phase 1: matrix 383 rows 470 cols
[2024-05-21 15:38:09] [INFO ] Computed 98 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 145/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 173/341 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 123/464 variables, 46/98 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:11] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 15:38:12] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:13] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:14] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 5040ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (trivial) has 202 edges and 470 vertex of which 6 / 470 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 985 edges and 465 vertex of which 464 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 464 transition count 329
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 418 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 417 transition count 328
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 96 place count 417 transition count 237
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 294 place count 310 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 302 place count 302 transition count 229
Iterating global reduction 3 with 8 rules applied. Total rules applied 310 place count 302 transition count 229
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 537 place count 186 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 539 place count 185 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 541 place count 185 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 543 place count 183 transition count 120
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 548 place count 183 transition count 120
Applied a total of 548 rules in 116 ms. Remains 183 /470 variables (removed 287) and now considering 120/383 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 183/470 places, 120/383 transitions.
RANDOM walk for 40000 steps (1086 resets) in 910 ms. (43 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40003 steps (573 resets) in 261 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (551 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (539 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
// Phase 1: matrix 120 rows 183 cols
[2024-05-21 15:38:15] [INFO ] Computed 77 invariants in 2 ms
[2024-05-21 15:38:15] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/136 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/178 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/181 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 120/301 variables, 181/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 13/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/303 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 273 constraints, problems are : Problem set: 0 solved, 3 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 183/183 constraints, ReadFeed: 13/13 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:38:15] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 78/136 variables, 47/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 15:38:15] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 0 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 7/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (OVERLAPS) 42/178 variables, 22/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/181 variables, 3/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/301 variables, 181/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 13/279 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/303 variables, 2/282 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:38:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 1/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/303 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 283 constraints, problems are : Problem set: 2 solved, 1 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 183/183 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1222ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 120/120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 183 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 179 transition count 116
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 179 transition count 108
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 169 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 166 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 166 transition count 105
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 45 place count 159 transition count 99
Applied a total of 45 rules in 29 ms. Remains 159 /183 variables (removed 24) and now considering 99/120 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 159/183 places, 99/120 transitions.
RANDOM walk for 40000 steps (1444 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (795 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1921 steps, run visited all 1 properties in 18 ms. (steps per millisecond=106 )
Probabilistic random walk after 1921 steps, saw 860 distinct states, run finished after 20 ms. (steps per millisecond=96 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 455 stabilizing places and 368 stable transitions
Graph (complete) has 992 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (complete) has 992 edges and 470 vertex of which 469 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 468 transition count 333
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 420 transition count 331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 418 transition count 331
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 101 place count 418 transition count 229
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 323 place count 298 transition count 229
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 336 place count 285 transition count 216
Iterating global reduction 3 with 13 rules applied. Total rules applied 349 place count 285 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 349 place count 285 transition count 215
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 351 place count 284 transition count 215
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 8 ms
Ensure Unique test removed 6 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 591 place count 161 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 161 transition count 97
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 4 with 2 rules applied. Total rules applied 594 place count 160 transition count 101
Applied a total of 594 rules in 84 ms. Remains 160 /470 variables (removed 310) and now considering 101/383 (removed 282) transitions.
// Phase 1: matrix 101 rows 160 cols
[2024-05-21 15:38:17] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:38:17] [INFO ] Implicit Places using invariants in 206 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 208 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/470 places, 101/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 141/470 places, 101/383 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 525 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 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 986 edges and 465 vertex of which 464 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 324
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 324
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 412 transition count 226
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 318 place count 296 transition count 226
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 283 transition count 213
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 283 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 283 transition count 212
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 282 transition count 212
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 571 place count 167 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 573 place count 166 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 574 place count 165 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 164 transition count 105
Applied a total of 575 rules in 53 ms. Remains 164 /470 variables (removed 306) and now considering 105/383 (removed 278) transitions.
// Phase 1: matrix 105 rows 164 cols
[2024-05-21 15:38:18] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:38:18] [INFO ] Implicit Places using invariants in 140 ms returned [42, 43, 48, 49, 50, 51, 52, 53, 54, 142]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 141 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/470 places, 105/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 154/470 places, 105/383 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 245 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 (G(p0)||(p0&&G((p1 U X((p2||G(p3))))))))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 370
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 368
Applied a total of 30 rules in 24 ms. Remains 455 /470 variables (removed 15) and now considering 368/383 (removed 15) transitions.
// Phase 1: matrix 368 rows 455 cols
[2024-05-21 15:38:18] [INFO ] Computed 98 invariants in 4 ms
[2024-05-21 15:38:18] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 15:38:18] [INFO ] Invariant cache hit.
[2024-05-21 15:38:18] [INFO ] Implicit Places using invariants and state equation in 380 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 634 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/470 places, 368/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 453/470 places, 368/383 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 728 reset in 319 ms.
Stack based approach found an accepted trace after 5435 steps with 41 reset with depth 9 and stack size 9 in 16 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 1312 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(F(X(G(X(F((!(p0 U p1)||p0)))))))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (trivial) has 217 edges and 470 vertex of which 6 / 470 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 986 edges and 465 vertex of which 464 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 463 transition count 326
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 414 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 100 place count 414 transition count 228
Deduced a syphon composed of 98 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 314 place count 298 transition count 228
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 326 place count 286 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 286 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 286 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 285 transition count 215
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 578 place count 163 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 579 place count 162 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 580 place count 161 transition count 98
Applied a total of 580 rules in 53 ms. Remains 161 /470 variables (removed 309) and now considering 98/383 (removed 285) transitions.
// Phase 1: matrix 98 rows 161 cols
[2024-05-21 15:38:19] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 15:38:19] [INFO ] Implicit Places using invariants in 254 ms returned [0, 1, 6, 7, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 256 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/470 places, 98/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 143/470 places, 98/383 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 84 steps with 9 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 396 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))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 986 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 463 transition count 325
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 413 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 324
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 104 place count 412 transition count 225
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 320 place count 295 transition count 225
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 333 place count 282 transition count 212
Iterating global reduction 3 with 13 rules applied. Total rules applied 346 place count 282 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 282 transition count 211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 348 place count 281 transition count 211
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 582 place count 161 transition count 97
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 584 place count 160 transition count 101
Applied a total of 584 rules in 39 ms. Remains 160 /470 variables (removed 310) and now considering 101/383 (removed 282) transitions.
// Phase 1: matrix 101 rows 160 cols
[2024-05-21 15:38:19] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:38:20] [INFO ] Implicit Places using invariants in 97 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 97 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/470 places, 101/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 142/470 places, 101/383 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 184 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' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 457 transition count 370
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 457 transition count 370
Applied a total of 26 rules in 23 ms. Remains 457 /470 variables (removed 13) and now considering 370/383 (removed 13) transitions.
// Phase 1: matrix 370 rows 457 cols
[2024-05-21 15:38:20] [INFO ] Computed 98 invariants in 3 ms
[2024-05-21 15:38:20] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 15:38:20] [INFO ] Invariant cache hit.
[2024-05-21 15:38:20] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 612 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 370/383 transitions.
Applied a total of 0 rules in 10 ms. Remains 455 /455 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 455/470 places, 370/383 transitions.
Stuttering acceptance computed with spot in 275 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 33224 reset in 244 ms.
Product exploration explored 100000 steps with 33238 reset in 186 ms.
Computed a total of 440 stabilizing places and 355 stable transitions
Graph (complete) has 967 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 440 stabilizing places and 355 stable transitions
Detected a total of 440/455 stabilizing places and 355/370 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 524 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Reduction of identical properties reduced properties to check from 11 to 7
RANDOM walk for 40000 steps (291 resets) in 277 ms. (143 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
// Phase 1: matrix 370 rows 455 cols
[2024-05-21 15:38:22] [INFO ] Computed 96 invariants in 2 ms
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/445 variables, 42/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/449 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 366/815 variables, 449/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 0/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/824 variables, 5/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/824 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/825 variables, 1/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/825 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/825 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 551 constraints, problems are : Problem set: 1 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/321 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 1 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 124/445 variables, 42/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 3/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/449 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 366/815 variables, 449/589 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/815 variables, 1/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/815 variables, 2/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/815 variables, 0/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/824 variables, 5/597 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 5289ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 370/370 transitions.
Graph (trivial) has 205 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 1 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 960 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 449 transition count 316
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 403 transition count 316
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 94 place count 403 transition count 219
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 306 place count 288 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 287 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 287 transition count 218
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 554 place count 161 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 2 with 2 rules applied. Total rules applied 556 place count 160 transition count 102
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 160 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 560 place count 158 transition count 100
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 561 place count 158 transition count 100
Applied a total of 561 rules in 33 ms. Remains 158 /455 variables (removed 297) and now considering 100/370 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 158/455 places, 100/370 transitions.
RANDOM walk for 120 steps (1 resets) in 8 ms. (13 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 1863 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 194 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 370/370 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2024-05-21 15:38:30] [INFO ] Invariant cache hit.
[2024-05-21 15:38:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 15:38:30] [INFO ] Invariant cache hit.
[2024-05-21 15:38:30] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-21 15:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 6 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/116 constraints. Problems are: Problem set: 1 solved, 368 unsolved
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 1 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:38:41] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
Problem TDEAD344 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/136 constraints. Problems are: Problem set: 2 solved, 367 unsolved
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:42] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:43] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:38:44] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/156 constraints. Problems are: Problem set: 2 solved, 367 unsolved
[2024-05-21 15:38:46] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:48] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/176 constraints. Problems are: Problem set: 4 solved, 365 unsolved
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:49] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:38:50] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:51] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/196 constraints. Problems are: Problem set: 4 solved, 365 unsolved
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:38:52] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 1 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:38:53] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:38:54] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 5 ms to minimize.
[2024-05-21 15:38:54] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:38:54] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
Problem TDEAD335 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/216 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:38:57] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 7 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:38:58] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:38:59] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:38:59] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:38:59] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 4 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/825 variables, and 233 constraints, problems are : Problem set: 5 solved, 364 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 137/137 constraints]
Escalating to Integer solving :Problem set: 5 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 40/40 constraints. Problems are: Problem set: 5 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/40 constraints. Problems are: Problem set: 5 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/92 constraints. Problems are: Problem set: 5 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/96 constraints. Problems are: Problem set: 5 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 137/233 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:04] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:39:04] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:39:04] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:04] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/253 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/273 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:10] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:39:10] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/293 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/313 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 4 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/333 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 20/353 constraints. Problems are: Problem set: 5 solved, 364 unsolved
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 20/373 constraints. Problems are: Problem set: 5 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/825 variables, and 373 constraints, problems are : Problem set: 5 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 0/369 constraints, Known Traps: 277/277 constraints]
After SMT, in 60125ms problems are : Problem set: 5 solved, 364 unsolved
Search for dead transitions found 5 dead transitions in 60144ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/455 places, 365/370 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 365
Applied a total of 1 rules in 15 ms. Remains 454 /455 variables (removed 1) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 454 cols
[2024-05-21 15:39:30] [INFO ] Computed 99 invariants in 5 ms
[2024-05-21 15:39:31] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 15:39:31] [INFO ] Invariant cache hit.
[2024-05-21 15:39:31] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 454/455 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61482 ms. Remains : 454/455 places, 365/370 transitions.
Computed a total of 439 stabilizing places and 350 stable transitions
Graph (complete) has 952 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 439 stabilizing places and 350 stable transitions
Detected a total of 439/454 stabilizing places and 350/365 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 699 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 5943 steps (42 resets) in 32 ms. (180 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1890 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 290 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 313 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Product exploration explored 100000 steps with 33275 reset in 178 ms.
Product exploration explored 100000 steps with 33278 reset in 250 ms.
Applying partial POR strategy [true, true, false, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 365/365 transitions.
Graph (trivial) has 203 edges and 454 vertex of which 6 / 454 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 946 edges and 449 vertex of which 448 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
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 448 transition count 358
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 448 transition count 407
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 448 transition count 407
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 432 transition count 376
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 432 transition count 376
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 295 place count 432 transition count 376
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 329 place count 398 transition count 342
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 363 place count 398 transition count 342
Deduced a syphon composed of 211 places in 1 ms
Applied a total of 363 rules in 96 ms. Remains 398 /454 variables (removed 56) and now considering 342/365 (removed 23) transitions.
[2024-05-21 15:39:36] [INFO ] Redundant transitions in 20 ms returned []
Running 341 sub problems to find dead transitions.
// Phase 1: matrix 342 rows 398 cols
[2024-05-21 15:39:36] [INFO ] Computed 99 invariants in 10 ms
[2024-05-21 15:39:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 37 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
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 38 places in 113 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 TDEAD13 is UNSAT
Problem TDEAD15 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 TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 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 TDEAD181 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 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 TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/119 constraints. Problems are: Problem set: 106 solved, 235 unsolved
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/139 constraints. Problems are: Problem set: 165 solved, 176 unsolved
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
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 TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/159 constraints. Problems are: Problem set: 214 solved, 127 unsolved
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/179 constraints. Problems are: Problem set: 233 solved, 108 unsolved
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/199 constraints. Problems are: Problem set: 239 solved, 102 unsolved
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
Problem TDEAD289 is UNSAT
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 9/208 constraints. Problems are: Problem set: 241 solved, 100 unsolved
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 3/211 constraints. Problems are: Problem set: 241 solved, 100 unsolved
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 2/213 constraints. Problems are: Problem set: 241 solved, 100 unsolved
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 4/217 constraints. Problems are: Problem set: 241 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 241 solved, 100 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 14 (OVERLAPS) 341/739 variables, 398/615 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/739 variables, 11/626 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/739 variables, 0/626 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 17 (OVERLAPS) 1/740 variables, 1/627 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 2/629 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/740 variables, 0/629 constraints. Problems are: Problem set: 247 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 629 constraints, problems are : Problem set: 247 solved, 94 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 398/398 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 247 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 163/349 variables, 54/54 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 120/174 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:40:07] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:40:07] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:40:07] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:40:07] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:40:08] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 20/194 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:10] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:40:10] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:40:10] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 3/197 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:11] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:40:11] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/199 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/199 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 47/396 variables, 45/244 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:12] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:40:12] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:40:12] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:40:12] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 4/248 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:13] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:40:13] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:40:13] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 3/251 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/251 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 341/737 variables, 396/647 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 11/658 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/737 variables, 94/752 constraints. Problems are: Problem set: 247 solved, 94 unsolved
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/737 variables, 1/753 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/737 variables, 0/753 constraints. Problems are: Problem set: 247 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 2/739 variables, 2/755 constraints. Problems are: Problem set: 247 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 739/740 variables, and 755 constraints, problems are : Problem set: 247 solved, 94 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 398/398 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 94/341 constraints, Known Traps: 153/153 constraints]
After SMT, in 60247ms problems are : Problem set: 247 solved, 94 unsolved
Search for dead transitions found 247 dead transitions in 60255ms
Found 247 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 247 transitions
Dead transitions reduction (with SMT) removed 247 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 398/454 places, 95/365 transitions.
Graph (complete) has 707 edges and 398 vertex of which 187 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.1 ms
Discarding 211 places :
Also discarding 0 output transitions
Ensure Unique test removed 31 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 156 transition count 101
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 156 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 23 ms. Remains 156 /398 variables (removed 242) and now considering 107/95 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/454 places, 107/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60412 ms. Remains : 156/454 places, 107/365 transitions.
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 365/365 transitions.
Applied a total of 0 rules in 28 ms. Remains 454 /454 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 454 cols
[2024-05-21 15:40:36] [INFO ] Computed 99 invariants in 4 ms
[2024-05-21 15:40:37] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 15:40:37] [INFO ] Invariant cache hit.
[2024-05-21 15:40:37] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-21 15:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/95 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:40:44] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:45] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 3 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 3 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:40:54] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:40:56] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 108 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 4 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 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)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 2.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 2.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/819 variables, and 219 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/95 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 120/219 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 6 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:41:14] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:41:15] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:41:16] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:41:17] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:41:18] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-05-21 15:41:19] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 5 ms to minimize.
[2024-05-21 15:41:19] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:41:19] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:19] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:41:20] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:41:20] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:41:20] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:41:21] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:41:22] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:23] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:41:23] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:41:23] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:41:23] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 4 ms to minimize.
[2024-05-21 15:41:23] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 60217ms, After SMT, problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 60912 ms. Remains : 454/454 places, 365/365 transitions.
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 197656 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(((p0||(G(p1)&&F(p2)))&&(p2||G(p0)))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 458 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 458 transition count 371
Applied a total of 24 rules in 21 ms. Remains 458 /470 variables (removed 12) and now considering 371/383 (removed 12) transitions.
// Phase 1: matrix 371 rows 458 cols
[2024-05-21 15:41:37] [INFO ] Computed 98 invariants in 3 ms
[2024-05-21 15:41:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 15:41:37] [INFO ] Invariant cache hit.
[2024-05-21 15:41:38] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [67, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 578 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 371/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 456/470 places, 371/383 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 846 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(F(p0))))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 456 transition count 369
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 456 transition count 369
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 454 transition count 367
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 454 transition count 367
Applied a total of 32 rules in 22 ms. Remains 454 /470 variables (removed 16) and now considering 367/383 (removed 16) transitions.
// Phase 1: matrix 367 rows 454 cols
[2024-05-21 15:41:38] [INFO ] Computed 98 invariants in 5 ms
[2024-05-21 15:41:38] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 15:41:38] [INFO ] Invariant cache hit.
[2024-05-21 15:41:39] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 633 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/470 places, 367/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 452 /452 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 663 ms. Remains : 452/470 places, 367/383 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 786 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((G(p1)||p0))) U p2)&&X(p3)))'
Support contains 6 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 370
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 368
Applied a total of 30 rules in 25 ms. Remains 455 /470 variables (removed 15) and now considering 368/383 (removed 15) transitions.
// Phase 1: matrix 368 rows 455 cols
[2024-05-21 15:41:39] [INFO ] Computed 98 invariants in 3 ms
[2024-05-21 15:41:39] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 15:41:39] [INFO ] Invariant cache hit.
[2024-05-21 15:41:40] [INFO ] Implicit Places using invariants and state equation in 416 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 598 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/470 places, 368/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 453/470 places, 368/383 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 885 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((X(p0)||G(p1))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 370
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 368
Applied a total of 30 rules in 31 ms. Remains 455 /470 variables (removed 15) and now considering 368/383 (removed 15) transitions.
// Phase 1: matrix 368 rows 455 cols
[2024-05-21 15:41:40] [INFO ] Computed 98 invariants in 4 ms
[2024-05-21 15:41:40] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 15:41:40] [INFO ] Invariant cache hit.
[2024-05-21 15:41:40] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 601 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/470 places, 368/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 641 ms. Remains : 453/470 places, 368/383 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 789 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(p0)||(X(G(p1)) U (p2&&F(p3)))))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 460 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 460 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 459 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 459 transition count 372
Applied a total of 22 rules in 25 ms. Remains 459 /470 variables (removed 11) and now considering 372/383 (removed 11) transitions.
// Phase 1: matrix 372 rows 459 cols
[2024-05-21 15:41:41] [INFO ] Computed 98 invariants in 7 ms
[2024-05-21 15:41:41] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 15:41:41] [INFO ] Invariant cache hit.
[2024-05-21 15:41:41] [INFO ] Implicit Places using invariants and state equation in 429 ms returned [67, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 629 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/470 places, 372/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 457 /457 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 661 ms. Remains : 457/470 places, 372/383 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15
Product exploration explored 100000 steps with 737 reset in 245 ms.
Stack based approach found an accepted trace after 41165 steps with 302 reset with depth 6 and stack size 6 in 109 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 1271 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' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-12-LTLFireability-07
Stuttering acceptance computed with spot in 296 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 470/470 places, 383/383 transitions.
Graph (trivial) has 216 edges and 470 vertex of which 6 / 470 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 986 edges and 465 vertex of which 464 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 463 transition count 326
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 414 transition count 326
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 100 place count 414 transition count 229
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 312 place count 299 transition count 229
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 322 place count 289 transition count 219
Iterating global reduction 2 with 10 rules applied. Total rules applied 332 place count 289 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 289 transition count 218
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 334 place count 288 transition count 218
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 574 place count 165 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 576 place count 164 transition count 105
Applied a total of 576 rules in 46 ms. Remains 164 /470 variables (removed 306) and now considering 105/383 (removed 278) transitions.
// Phase 1: matrix 105 rows 164 cols
[2024-05-21 15:41:42] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:41:42] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 143 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 145/470 places, 105/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 192 ms. Remains : 145/470 places, 105/383 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Entered a terminal (fully accepting) state of product in 22 steps with 6 reset in 0 ms.
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 644 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 15:41:42] [INFO ] Flatten gal took : 28 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 277110 ms.
ITS solved all properties within timeout

BK_STOP 1716306103060

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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