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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716306488610

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:48:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:48:10] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-21 15:48:10] [INFO ] Transformed 624 places.
[2024-05-21 15:48:10] [INFO ] Transformed 564 transitions.
[2024-05-21 15:48:10] [INFO ] Found NUPN structural information;
[2024-05-21 15:48:10] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 228 place count 478 transition count 423
Iterating global reduction 1 with 43 rules applied. Total rules applied 271 place count 478 transition count 423
Applied a total of 271 rules in 135 ms. Remains 478 /616 variables (removed 138) and now considering 423/556 (removed 133) transitions.
// Phase 1: matrix 423 rows 478 cols
[2024-05-21 15:48:10] [INFO ] Computed 94 invariants in 30 ms
[2024-05-21 15:48:10] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-21 15:48:10] [INFO ] Invariant cache hit.
[2024-05-21 15:48:11] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-21 15:48:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 36 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 4 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 20/114 constraints. Problems are: Problem set: 22 solved, 400 unsolved
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:48:24] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 4 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:25] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 6 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/134 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 4 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 20/154 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-05-21 15:48:32] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:48:32] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:48:33] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 20/174 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 5 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 20/194 constraints. Problems are: Problem set: 28 solved, 394 unsolved
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 28 solved, 394 unsolved
Search for dead transitions found 28 dead transitions in 30281ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 478/616 places, 395/556 transitions.
Applied a total of 0 rules in 15 ms. Remains 478 /478 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31447 ms. Remains : 478/616 places, 395/556 transitions.
Support contains 30 out of 478 places after structural reductions.
[2024-05-21 15:48:42] [INFO ] Flatten gal took : 92 ms
[2024-05-21 15:48:42] [INFO ] Flatten gal took : 43 ms
[2024-05-21 15:48:42] [INFO ] Input system was already deterministic with 395 transitions.
RANDOM walk for 40000 steps (272 resets) in 1714 ms. (23 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40004 steps (47 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 211 ms. (188 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (46 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
// Phase 1: matrix 395 rows 478 cols
[2024-05-21 15:48:43] [INFO ] Computed 97 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 191/203 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 146/349 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 120/469 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 389/858 variables, 469/566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/858 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 13/871 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/873 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/873 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 575 constraints, problems are : Problem set: 0 solved, 6 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 191/203 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 146/349 variables, 33/56 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 8/64 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 120/469 variables, 42/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 389/858 variables, 469/576 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/858 variables, 5/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 12/593 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/858 variables, 2/595 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/858 variables, 0/595 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 13/871 variables, 7/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 1/603 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 0/603 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/873 variables, 2/605 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/605 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/873 variables, 0/605 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 873/873 variables, and 605 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 4947ms problems are : Problem set: 1 solved, 5 unsolved
Finished Parikh walk after 206 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
Parikh walk visited 5 properties in 1179 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1033 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 387
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 383
Applied a total of 24 rules in 60 ms. Remains 466 /478 variables (removed 12) and now considering 383/395 (removed 12) transitions.
// Phase 1: matrix 383 rows 466 cols
[2024-05-21 15:48:49] [INFO ] Computed 97 invariants in 6 ms
[2024-05-21 15:48:50] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 15:48:50] [INFO ] Invariant cache hit.
[2024-05-21 15:48:50] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [149, 150, 420]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 885 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/478 places, 383/395 transitions.
Applied a total of 0 rules in 13 ms. Remains 463 /463 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 970 ms. Remains : 463/478 places, 383/395 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-02
Stuttering criterion allowed to conclude after 4313 steps with 99 reset in 45 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-02 finished in 1417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (X(X(!p2))||p1)) U p0))'
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 472 transition count 389
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 472 transition count 389
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 469 transition count 386
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 469 transition count 386
Applied a total of 18 rules in 36 ms. Remains 469 /478 variables (removed 9) and now considering 386/395 (removed 9) transitions.
// Phase 1: matrix 386 rows 469 cols
[2024-05-21 15:48:51] [INFO ] Computed 97 invariants in 4 ms
[2024-05-21 15:48:51] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 15:48:51] [INFO ] Invariant cache hit.
[2024-05-21 15:48:51] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [149, 152, 423]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 723 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 386/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 466 /466 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 766 ms. Remains : 466/478 places, 386/395 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-05 finished in 1108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Graph (trivial) has 225 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 19 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1027 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 471 transition count 337
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 421 transition count 337
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 421 transition count 236
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 320 place count 304 transition count 236
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 296 transition count 228
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 296 transition count 228
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 590 place count 165 transition count 105
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 592 place count 164 transition count 109
Applied a total of 592 rules in 155 ms. Remains 164 /478 variables (removed 314) and now considering 109/395 (removed 286) transitions.
// Phase 1: matrix 109 rows 164 cols
[2024-05-21 15:48:52] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 15:48:52] [INFO ] Implicit Places using invariants in 151 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 29, 45, 46, 47, 48, 49]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 153 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/478 places, 109/395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 108
Applied a total of 2 rules in 10 ms. Remains 142 /143 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 142 cols
[2024-05-21 15:48:52] [INFO ] Computed 52 invariants in 0 ms
[2024-05-21 15:48:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 15:48:52] [INFO ] Invariant cache hit.
[2024-05-21 15:48:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:48:52] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [1, 3, 7, 10, 11, 12, 14, 27, 30, 32, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 82, 84, 86, 88, 90, 112, 130, 132]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 359 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/478 places, 108/395 transitions.
Graph (complete) has 262 edges and 103 vertex of which 92 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 92 transition count 94
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 83 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 78 transition count 87
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 78 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 78 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 75 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 74 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 74 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 65 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 64 transition count 74
Applied a total of 56 rules in 11 ms. Remains 64 /103 variables (removed 39) and now considering 74/108 (removed 34) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 15:48:52] [INFO ] Computed 10 invariants in 21 ms
[2024-05-21 15:48:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 15:48:52] [INFO ] Invariant cache hit.
[2024-05-21 15:48:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:48:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 64/478 places, 74/395 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 886 ms. Remains : 64/478 places, 74/395 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 387
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 383
Applied a total of 24 rules in 37 ms. Remains 466 /478 variables (removed 12) and now considering 383/395 (removed 12) transitions.
// Phase 1: matrix 383 rows 466 cols
[2024-05-21 15:48:53] [INFO ] Computed 97 invariants in 5 ms
[2024-05-21 15:48:53] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 15:48:53] [INFO ] Invariant cache hit.
[2024-05-21 15:48:53] [INFO ] Implicit Places using invariants and state equation in 406 ms returned [149, 150, 420]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 622 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/478 places, 383/395 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 463/478 places, 383/395 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 681 reset in 266 ms.
Product exploration explored 100000 steps with 677 reset in 265 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 996 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (272 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (45 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2193 steps, run visited all 1 properties in 32 ms. (steps per millisecond=68 )
Probabilistic random walk after 2193 steps, saw 1969 distinct states, run finished after 36 ms. (steps per millisecond=60 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 1789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Graph (trivial) has 222 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1027 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 471 transition count 338
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 422 transition count 338
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 100 place count 422 transition count 238
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 317 place count 305 transition count 238
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 298 transition count 231
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 298 transition count 231
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 589 place count 165 transition count 106
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 591 place count 164 transition count 110
Applied a total of 591 rules in 47 ms. Remains 164 /478 variables (removed 314) and now considering 110/395 (removed 285) transitions.
// Phase 1: matrix 110 rows 164 cols
[2024-05-21 15:48:54] [INFO ] Computed 72 invariants in 1 ms
[2024-05-21 15:48:55] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 44, 45, 46, 47, 48]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 148 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/478 places, 110/395 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 144/478 places, 110/395 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-12
Product exploration explored 100000 steps with 17985 reset in 272 ms.
Product exploration explored 100000 steps with 17866 reset in 257 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8023 resets) in 1020 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2542 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 123 steps, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Probabilistic random walk after 123 steps, saw 79 distinct states, run finished after 6 ms. (steps per millisecond=20 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 144 cols
[2024-05-21 15:48:56] [INFO ] Computed 52 invariants in 5 ms
[2024-05-21 15:48:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 15:48:56] [INFO ] Invariant cache hit.
[2024-05-21 15:48:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:48:56] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [1, 3, 7, 10, 11, 12, 14, 27, 30, 32, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 75, 83, 85, 87, 89, 91, 115, 131, 133]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 289 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/144 places, 110/110 transitions.
Graph (complete) has 284 edges and 106 vertex of which 95 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 97
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 87 transition count 97
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 82 transition count 90
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 82 transition count 90
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 82 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 79 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 78 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 78 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 49 place count 71 transition count 79
Applied a total of 49 rules in 15 ms. Remains 71 /106 variables (removed 35) and now considering 79/110 (removed 31) transitions.
// Phase 1: matrix 79 rows 71 cols
[2024-05-21 15:48:56] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 15:48:56] [INFO ] Implicit Places using invariants in 38 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/144 places, 79/110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 78
Applied a total of 2 rules in 8 ms. Remains 69 /70 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 69 cols
[2024-05-21 15:48:56] [INFO ] Computed 11 invariants in 0 ms
[2024-05-21 15:48:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 15:48:56] [INFO ] Invariant cache hit.
[2024-05-21 15:48:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:48:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 69/144 places, 78/110 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 529 ms. Remains : 69/144 places, 78/110 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8143 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2561 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 76 steps, run visited all 1 properties in 4 ms. (steps per millisecond=19 )
Probabilistic random walk after 76 steps, saw 52 distinct states, run finished after 4 ms. (steps per millisecond=19 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18292 reset in 97 ms.
Product exploration explored 100000 steps with 18356 reset in 108 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 15:48:57] [INFO ] Invariant cache hit.
[2024-05-21 15:48:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 15:48:57] [INFO ] Invariant cache hit.
[2024-05-21 15:48:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:48:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 15:48:57] [INFO ] Redundant transitions in 15 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 15:48:57] [INFO ] Invariant cache hit.
[2024-05-21 15:48:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/146 variables, 69/80 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/83 constraints. Problems are: Problem set: 8 solved, 65 unsolved
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:48:58] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 3/86 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/86 constraints. Problems are: Problem set: 8 solved, 65 unsolved
[2024-05-21 15:48:59] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/146 variables, 1/87 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/87 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/87 constraints. Problems are: Problem set: 8 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 87 constraints, problems are : Problem set: 8 solved, 65 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 8 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 4/9 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 6/15 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 77/146 variables, 69/84 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 3/87 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 65/152 constraints. Problems are: Problem set: 8 solved, 65 unsolved
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 2/154 constraints. Problems are: Problem set: 8 solved, 65 unsolved
[2024-05-21 15:49:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/155 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/155 constraints. Problems are: Problem set: 8 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/155 constraints. Problems are: Problem set: 8 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 155 constraints, problems are : Problem set: 8 solved, 65 unsolved in 2623 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 65/73 constraints, Known Traps: 7/7 constraints]
After SMT, in 4551ms problems are : Problem set: 8 solved, 65 unsolved
Search for dead transitions found 8 dead transitions in 4553ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 70/78 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 9 ms. Remains 67 /69 variables (removed 2) and now considering 70/70 (removed 0) transitions.
[2024-05-21 15:49:02] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4789 ms. Remains : 67/69 places, 70/78 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-12 finished in 7468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U G(p1))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 473 transition count 390
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 473 transition count 390
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 470 transition count 387
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 470 transition count 387
Applied a total of 16 rules in 33 ms. Remains 470 /478 variables (removed 8) and now considering 387/395 (removed 8) transitions.
// Phase 1: matrix 387 rows 470 cols
[2024-05-21 15:49:02] [INFO ] Computed 97 invariants in 3 ms
[2024-05-21 15:49:02] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 15:49:02] [INFO ] Invariant cache hit.
[2024-05-21 15:49:03] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [150, 151, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 835 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 467/478 places, 387/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 467 /467 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 875 ms. Remains : 467/478 places, 387/395 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14
Product exploration explored 100000 steps with 678 reset in 280 ms.
Product exploration explored 100000 steps with 681 reset in 297 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1004 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (271 resets) in 279 ms. (142 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 317 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (53 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (58 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
// Phase 1: matrix 387 rows 467 cols
[2024-05-21 15:49:04] [INFO ] Computed 94 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/455 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/458 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 381/839 variables, 458/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/852 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/852 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/854 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/854 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/854 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 854/854 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:05] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:49:06] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:49:07] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:49:08] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:49:09] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:49:10] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
SMT process timed out in 5603ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 387/387 transitions.
Graph (trivial) has 212 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 997 edges and 462 vertex of which 461 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 461 transition count 333
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 415 transition count 333
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 94 place count 415 transition count 235
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 307 place count 300 transition count 235
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 568 place count 166 transition count 108
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 570 place count 165 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 165 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 574 place count 163 transition count 110
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 575 place count 163 transition count 110
Applied a total of 575 rules in 32 ms. Remains 163 /467 variables (removed 304) and now considering 110/387 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 163/467 places, 110/387 transitions.
RANDOM walk for 40000 steps (1459 resets) in 244 ms. (163 steps per ms) remains 1/3 properties
BEST_FIRST walk for 1981 steps (24 resets) in 8 ms. (220 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 387/387 transitions.
Applied a total of 0 rules in 13 ms. Remains 467 /467 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-21 15:49:11] [INFO ] Invariant cache hit.
[2024-05-21 15:49:11] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 15:49:11] [INFO ] Invariant cache hit.
[2024-05-21 15:49:11] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-21 15:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:49:20] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 5 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:49:21] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:22] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:49:23] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:49:23] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:23] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:49:24] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:49:25] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:49:25] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:25] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:49:25] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:49:26] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:27] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:49:27] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:49:27] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:49:27] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:28] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 16 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 5 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:49:29] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:30] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:30] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:30] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:49:33] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:49:34] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:35] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 4 ms to minimize.
[2024-05-21 15:49:35] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:49:35] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:36] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:49:36] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:36] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:37] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:49:38] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:49:38] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:49:38] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:49:38] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:49:39] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:49:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:49:39] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:49:39] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:49:39] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:49:40] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:49:40] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:49:40] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:49:40] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:49:41] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:41] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:49:41] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:49:41] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:49:41] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/854 variables, and 194 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 1 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:49:45] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:49:46] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:49:46] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:49:47] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:48] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:49:48] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:49:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:49:49] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:51] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:49:51] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:49:51] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 15:49:52] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:49:52] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:49:52] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:49:52] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:49:53] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:49:54] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:49:54] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:49:54] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:49:54] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:56] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:49:57] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:49:57] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:49:57] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:49:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:49:59] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:50:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:50:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:50:02] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:50:03] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:50:03] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:50:03] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:50:04] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:50:04] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:50:04] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:50:04] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:50:05] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/854 variables, and 266 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/386 constraints, Known Traps: 172/172 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60950 ms. Remains : 467/467 places, 387/387 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1004 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (274 resets) in 363 ms. (109 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
[2024-05-21 15:50:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/455 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/458 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 381/839 variables, 458/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/852 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/852 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/854 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/854 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/854 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 854/854 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/342 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 113/455 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/458 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 381/839 variables, 458/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 19/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/852 variables, 7/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/852 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/854 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/854 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/854 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 854/854 variables, and 590 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2867 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 3370ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 8391 steps, including 55 resets, run visited all 3 properties in 52 ms. (steps per millisecond=161 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 52 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 678 reset in 177 ms.
Product exploration explored 100000 steps with 680 reset in 192 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 387/387 transitions.
Graph (trivial) has 212 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 998 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 461 transition count 380
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 47 place count 461 transition count 431
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 118 place count 461 transition count 431
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 447 transition count 405
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 447 transition count 405
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 300 place count 447 transition count 405
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 337 place count 410 transition count 368
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 374 place count 410 transition count 368
Deduced a syphon composed of 219 places in 1 ms
Applied a total of 374 rules in 81 ms. Remains 410 /467 variables (removed 57) and now considering 368/387 (removed 19) transitions.
[2024-05-21 15:50:17] [INFO ] Redundant transitions in 30 ms returned []
Running 367 sub problems to find dead transitions.
// Phase 1: matrix 368 rows 410 cols
[2024-05-21 15:50:17] [INFO ] Computed 94 invariants in 6 ms
[2024-05-21 15:50:17] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2024-05-21 15:50:24] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:50:25] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/114 constraints. Problems are: Problem set: 80 solved, 287 unsolved
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:50:26] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2024-05-21 15:50:27] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/134 constraints. Problems are: Problem set: 80 solved, 287 unsolved
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:28] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 15:50:29] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 15:50:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/154 constraints. Problems are: Problem set: 137 solved, 230 unsolved
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 15:50:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 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 TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/174 constraints. Problems are: Problem set: 193 solved, 174 unsolved
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/194 constraints. Problems are: Problem set: 227 solved, 140 unsolved
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 4 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 20/214 constraints. Problems are: Problem set: 231 solved, 136 unsolved
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
Problem TDEAD185 is UNSAT
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 20/234 constraints. Problems are: Problem set: 237 solved, 130 unsolved
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/235 constraints. Problems are: Problem set: 237 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/235 constraints. Problems are: Problem set: 237 solved, 130 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 13 (OVERLAPS) 367/777 variables, 410/645 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 10/655 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/777 variables, 0/655 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 16 (OVERLAPS) 1/778 variables, 1/656 constraints. Problems are: Problem set: 266 solved, 101 unsolved
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/778 variables, 1/657 constraints. Problems are: Problem set: 266 solved, 101 unsolved
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(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 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.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 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.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 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/778 variables, 1/658 constraints. Problems are: Problem set: 266 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/778 variables, and 658 constraints, problems are : Problem set: 266 solved, 101 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 410/410 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 143/143 constraints]
Escalating to Integer solving :Problem set: 266 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 171/361 variables, 56/56 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 1/57 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 143/200 constraints. Problems are: Problem set: 266 solved, 101 unsolved
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 19/219 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/219 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 46/407 variables, 37/256 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/256 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 367/774 variables, 407/663 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 10/673 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/774 variables, 101/774 constraints. Problems are: Problem set: 266 solved, 101 unsolved
[2024-05-21 15:50:55] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:50:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:50:55] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:50:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:50:56] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:50:57] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/774 variables, 7/781 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/781 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 3/777 variables, 3/784 constraints. Problems are: Problem set: 266 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 0/784 constraints. Problems are: Problem set: 266 solved, 101 unsolved
SMT process timed out in 60255ms, After SMT, problems are : Problem set: 266 solved, 101 unsolved
Search for dead transitions found 266 dead transitions in 60259ms
Found 266 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 266 transitions
Dead transitions reduction (with SMT) removed 266 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/467 places, 102/387 transitions.
Graph (complete) has 722 edges and 410 vertex of which 191 are kept as prefixes of interest. Removing 219 places using SCC suffix rule.1 ms
Discarding 219 places :
Also discarding 0 output transitions
Ensure Unique test removed 30 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 161 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 25 ms. Remains 161 /410 variables (removed 249) and now considering 114/102 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 161/467 places, 114/387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60418 ms. Remains : 161/467 places, 114/387 transitions.
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 387/387 transitions.
Applied a total of 0 rules in 19 ms. Remains 467 /467 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 467 cols
[2024-05-21 15:51:17] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 15:51:18] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 15:51:18] [INFO ] Invariant cache hit.
[2024-05-21 15:51:18] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-21 15:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:51:28] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:51:28] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:28] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:29] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 4 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:51:41] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:41] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:51:42] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:51:43] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:51:43] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:51:43] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:44] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:45] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:51:45] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:51:45] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:51:45] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 1 ms to minimize.
[2024-05-21 15:51:45] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 1 ms to minimize.
[2024-05-21 15:51:46] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:51:46] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:46] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:46] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:47] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:47] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:47] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:47] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:51:48] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:51:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:51:48] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:51:48] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 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 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.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 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.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 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/854 variables, and 202 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 108/202 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:52:02] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 1 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:52:04] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:52:13] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:52:15] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 11/287 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 15:52:15] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:52:15] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:52:15] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:52:16] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:52:16] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:52:16] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:52:16] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:52:16] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:52:17] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/854 variables, and 307 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/386 constraints, Known Traps: 213/213 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 61004 ms. Remains : 467/467 places, 387/387 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 196497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G((p1 U p0))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 471 transition count 388
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 471 transition count 388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 468 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 468 transition count 385
Applied a total of 20 rules in 37 ms. Remains 468 /478 variables (removed 10) and now considering 385/395 (removed 10) transitions.
// Phase 1: matrix 385 rows 468 cols
[2024-05-21 15:52:18] [INFO ] Computed 97 invariants in 5 ms
[2024-05-21 15:52:19] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 15:52:19] [INFO ] Invariant cache hit.
[2024-05-21 15:52:19] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [149, 150, 422]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 791 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 465/478 places, 385/395 transitions.
Applied a total of 0 rules in 9 ms. Remains 465 /465 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 839 ms. Remains : 465/478 places, 385/395 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 19926 reset in 240 ms.
Product exploration explored 100000 steps with 20021 reset in 233 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1000 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (267 resets) in 232 ms. (171 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
// Phase 1: matrix 385 rows 465 cols
[2024-05-21 15:52:21] [INFO ] Computed 94 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/345 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 108/453 variables, 37/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/456 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 379/835 variables, 456/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/848 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/850 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/850 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/850 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 559 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/345 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 108/453 variables, 37/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/456 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 379/835 variables, 456/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 5370ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 385/385 transitions.
Graph (trivial) has 211 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 993 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 459 transition count 331
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 413 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 412 transition count 330
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 412 transition count 234
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 299 transition count 234
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 569 place count 163 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 162 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 573 place count 162 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 575 place count 160 transition count 108
Applied a total of 575 rules in 26 ms. Remains 160 /465 variables (removed 305) and now considering 108/385 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 160/465 places, 108/385 transitions.
RANDOM walk for 40000 steps (1686 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (878 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
// Phase 1: matrix 108 rows 160 cols
[2024-05-21 15:52:26] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 15:52:26] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/125 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/157 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/265 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 13/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/268 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/125 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/157 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/265 variables, 157/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 268/268 variables, and 248 constraints, problems are : Problem set: 1 solved, 0 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 402ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 192 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 385/385 transitions.
Graph (trivial) has 211 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 994 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 458 transition count 331
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 412 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 411 transition count 330
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 411 transition count 234
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 298 transition count 234
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 567 place count 163 transition count 107
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 569 place count 162 transition count 111
Applied a total of 569 rules in 22 ms. Remains 162 /465 variables (removed 303) and now considering 111/385 (removed 274) transitions.
// Phase 1: matrix 111 rows 162 cols
[2024-05-21 15:52:27] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 15:52:27] [INFO ] Implicit Places using invariants in 229 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 44, 45, 46, 47, 48]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 230 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/465 places, 111/385 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 142/465 places, 111/385 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 27681 steps (6924 resets) in 55 ms. (494 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21763 reset in 159 ms.
Product exploration explored 100000 steps with 21728 reset in 192 ms.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 111/111 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 142 transition count 109
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 140 transition count 109
Applied a total of 4 rules in 4 ms. Remains 140 /142 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 140 cols
[2024-05-21 15:52:28] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 15:52:28] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 15:52:28] [INFO ] Invariant cache hit.
[2024-05-21 15:52:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:28] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [1, 3, 7, 10, 12, 26, 29, 31, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89, 128, 130]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 395 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/142 places, 109/111 transitions.
Graph (complete) has 277 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 96 transition count 96
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 87 transition count 96
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 82 transition count 89
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 82 transition count 89
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 82 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 79 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 78 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 78 transition count 85
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 69 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 68 transition count 76
Applied a total of 56 rules in 6 ms. Remains 68 /104 variables (removed 36) and now considering 76/109 (removed 33) transitions.
// Phase 1: matrix 76 rows 68 cols
[2024-05-21 15:52:28] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 15:52:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 15:52:28] [INFO ] Invariant cache hit.
[2024-05-21 15:52:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:52:28] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/142 places, 76/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 626 ms. Remains : 68/142 places, 76/111 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 10045 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLCardinality-14
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Graph (trivial) has 220 edges and 478 vertex of which 6 / 478 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 1027 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 50 place count 471 transition count 339
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 423 transition count 339
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 98 place count 423 transition count 240
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 313 place count 307 transition count 240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 318 place count 302 transition count 235
Iterating global reduction 2 with 5 rules applied. Total rules applied 323 place count 302 transition count 235
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 582 place count 169 transition count 109
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 584 place count 168 transition count 113
Applied a total of 584 rules in 24 ms. Remains 168 /478 variables (removed 310) and now considering 113/395 (removed 282) transitions.
// Phase 1: matrix 113 rows 168 cols
[2024-05-21 15:52:29] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 15:52:29] [INFO ] Implicit Places using invariants in 229 ms returned [1, 2, 5, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 46, 47, 48, 49, 50]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 233 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 148/478 places, 113/395 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 260 ms. Remains : 148/478 places, 113/395 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14
Product exploration explored 100000 steps with 11681 reset in 187 ms.
Product exploration explored 100000 steps with 11614 reset in 165 ms.
Computed a total of 16 stabilizing places and 14 stable transitions
Computed a total of 16 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (4997 resets) in 347 ms. (114 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
// Phase 1: matrix 113 rows 148 cols
[2024-05-21 15:52:30] [INFO ] Computed 53 invariants in 1 ms
[2024-05-21 15:52:30] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/111 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 34/145 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 112/257 variables, 145/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/260 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/111 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 34/145 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 112/257 variables, 145/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/260 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 113/113 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 148 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 146 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 146 transition count 110
Applied a total of 6 rules in 8 ms. Remains 146 /148 variables (removed 2) and now considering 110/113 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 146/148 places, 110/113 transitions.
RANDOM walk for 40000 steps (1452 resets) in 155 ms. (256 steps per ms) remains 1/3 properties
BEST_FIRST walk for 4748 steps (61 resets) in 11 ms. (395 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 148 /148 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-21 15:52:31] [INFO ] Invariant cache hit.
[2024-05-21 15:52:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 15:52:31] [INFO ] Invariant cache hit.
[2024-05-21 15:52:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:32] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [3, 5, 9, 12, 13, 14, 16, 29, 88, 90, 92, 94, 96, 120, 136, 138]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 259 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/148 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 132/148 places, 113/113 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Graph (complete) has 402 edges and 132 vertex of which 121 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (4986 resets) in 156 ms. (254 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1771 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
// Phase 1: matrix 113 rows 132 cols
[2024-05-21 15:52:32] [INFO ] Computed 37 invariants in 0 ms
[2024-05-21 15:52:32] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/61 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/67 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/71 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 84/155 variables, 71/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 83/238 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/244 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/244 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 174 constraints, problems are : Problem set: 0 solved, 3 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 132/132 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/61 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/67 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/71 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 84/155 variables, 71/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 83/238 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/244 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/244 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 132/132 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 33 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 11630 reset in 121 ms.
Product exploration explored 100000 steps with 11681 reset in 152 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 113/113 transitions.
Graph (complete) has 402 edges and 132 vertex of which 121 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 121 transition count 108
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 6 ms. Remains 121 /132 variables (removed 11) and now considering 108/113 (removed 5) transitions.
[2024-05-21 15:52:34] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 121 cols
[2024-05-21 15:52:34] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 15:52:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 5 (OVERLAPS) 107/228 variables, 121/155 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 5/160 constraints. Problems are: Problem set: 11 solved, 92 unsolved
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 4/164 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/164 constraints. Problems are: Problem set: 11 solved, 92 unsolved
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 5/169 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/169 constraints. Problems are: Problem set: 11 solved, 92 unsolved
[2024-05-21 15:52:38] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/228 variables, 1/170 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/170 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/170 constraints. Problems are: Problem set: 11 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/229 variables, and 170 constraints, problems are : Problem set: 11 solved, 92 unsolved in 5444 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 27/42 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/44 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/44 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 107/225 variables, 118/162 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 5/167 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 92/259 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/259 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 3/228 variables, 3/262 constraints. Problems are: Problem set: 11 solved, 92 unsolved
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/263 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/263 constraints. Problems are: Problem set: 11 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/263 constraints. Problems are: Problem set: 11 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/229 variables, and 263 constraints, problems are : Problem set: 11 solved, 92 unsolved in 5525 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 92/103 constraints, Known Traps: 12/12 constraints]
After SMT, in 11043ms problems are : Problem set: 11 solved, 92 unsolved
Search for dead transitions found 11 dead transitions in 11044ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/132 places, 97/113 transitions.
Graph (complete) has 360 edges and 121 vertex of which 118 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 18 ms. Remains 116 /121 variables (removed 5) and now considering 97/97 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/132 places, 97/113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11100 ms. Remains : 116/132 places, 97/113 transitions.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 132 cols
[2024-05-21 15:52:45] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 15:52:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 15:52:45] [INFO ] Invariant cache hit.
[2024-05-21 15:52:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:45] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-21 15:52:45] [INFO ] Invariant cache hit.
[2024-05-21 15:52:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 15:52:46] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/244 variables, 132/170 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 5/175 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 4/179 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 3/182 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/185 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/185 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/185 constraints. Problems are: Problem set: 8 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 185 constraints, problems are : Problem set: 8 solved, 100 unsolved in 4704 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 132/132 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 8 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 10/10 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 4/14 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 27/41 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 7/48 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/48 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/180 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 5/185 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 100/285 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 15:52:51] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:52:52] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:52:52] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:52:52] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 4/289 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 15:52:54] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:52:54] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:52:54] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/292 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/292 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/244 variables, 0/292 constraints. Problems are: Problem set: 8 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 292 constraints, problems are : Problem set: 8 solved, 100 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 132/132 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 100/108 constraints, Known Traps: 18/18 constraints]
After SMT, in 13180ms problems are : Problem set: 8 solved, 100 unsolved
Search for dead transitions found 8 dead transitions in 13182ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 132/132 places, 105/113 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 105
Applied a total of 2 rules in 6 ms. Remains 130 /132 variables (removed 2) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 130 cols
[2024-05-21 15:52:58] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 15:52:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 15:52:58] [INFO ] Invariant cache hit.
[2024-05-21 15:52:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:59] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 321 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/132 places, 105/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13846 ms. Remains : 129/132 places, 105/113 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 30087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G((p1 U p0))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLCardinality-15
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 478/478 places, 395/395 transitions.
Graph (trivial) has 221 edges and 478 vertex of which 6 / 478 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 1027 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 50 place count 471 transition count 339
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 423 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 422 transition count 338
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 100 place count 422 transition count 240
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 313 place count 307 transition count 240
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 320 place count 300 transition count 233
Iterating global reduction 3 with 7 rules applied. Total rules applied 327 place count 300 transition count 233
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 587 place count 166 transition count 107
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 589 place count 165 transition count 111
Applied a total of 589 rules in 75 ms. Remains 165 /478 variables (removed 313) and now considering 111/395 (removed 284) transitions.
// Phase 1: matrix 111 rows 165 cols
[2024-05-21 15:52:59] [INFO ] Computed 72 invariants in 3 ms
[2024-05-21 15:52:59] [INFO ] Implicit Places using invariants in 219 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 46, 47, 48, 49, 50]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 234 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 145/478 places, 111/395 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 313 ms. Remains : 145/478 places, 111/395 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 26430 reset in 279 ms.
Product exploration explored 100000 steps with 26360 reset in 276 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9980 resets) in 435 ms. (91 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (3076 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3010 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
// Phase 1: matrix 111 rows 145 cols
[2024-05-21 15:53:01] [INFO ] Computed 52 invariants in 1 ms
[2024-05-21 15:53:01] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/108 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/141 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 110/252 variables, 142/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/255 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/255 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/108 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:53:01] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 33/141 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 110/252 variables, 142/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:53:01] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 15 (OVERLAPS) 3/255 variables, 3/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/255 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 206 constraints, problems are : Problem set: 1 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 460ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 15:53:01] [INFO ] Invariant cache hit.
[2024-05-21 15:53:02] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 15:53:02] [INFO ] Invariant cache hit.
[2024-05-21 15:53:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:53:02] [INFO ] Implicit Places using invariants and state equation in 390 ms returned [1, 3, 7, 11, 12, 13, 15, 29, 32, 34, 36, 37, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 62, 64, 66, 68, 70, 72, 74, 76, 84, 86, 88, 90, 92, 116, 133, 135]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 588 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/145 places, 111/111 transitions.
Graph (complete) has 279 edges and 106 vertex of which 100 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 100 transition count 99
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 91 transition count 99
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 86 transition count 92
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 86 transition count 92
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 86 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 82 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 82 transition count 88
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 73 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 72 transition count 79
Applied a total of 56 rules in 11 ms. Remains 72 /106 variables (removed 34) and now considering 79/111 (removed 32) transitions.
// Phase 1: matrix 79 rows 72 cols
[2024-05-21 15:53:02] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 15:53:02] [INFO ] Implicit Places using invariants in 435 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/145 places, 79/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1042 ms. Remains : 71/145 places, 79/111 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Graph (complete) has 227 edges and 71 vertex of which 65 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28535 steps (7267 resets) in 33 ms. (839 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22342 reset in 76 ms.
Product exploration explored 100000 steps with 22286 reset in 85 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 79/79 transitions.
Graph (complete) has 227 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 69 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 76
Applied a total of 3 rules in 2 ms. Remains 68 /71 variables (removed 3) and now considering 76/79 (removed 3) transitions.
// Phase 1: matrix 76 rows 68 cols
[2024-05-21 15:53:03] [INFO ] Computed 11 invariants in 17 ms
[2024-05-21 15:53:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 15:53:03] [INFO ] Invariant cache hit.
[2024-05-21 15:53:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:53:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 15:53:03] [INFO ] Redundant transitions in 37 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 15:53:03] [INFO ] Invariant cache hit.
[2024-05-21 15:53:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 4 (OVERLAPS) 75/143 variables, 68/79 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/82 constraints. Problems are: Problem set: 8 solved, 63 unsolved
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 4/86 constraints. Problems are: Problem set: 8 solved, 63 unsolved
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 2/88 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/88 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/88 constraints. Problems are: Problem set: 8 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 88 constraints, problems are : Problem set: 8 solved, 63 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 4/10 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 5/15 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/17 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 75/143 variables, 68/85 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 3/88 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 63/151 constraints. Problems are: Problem set: 8 solved, 63 unsolved
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/152 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 152 constraints, problems are : Problem set: 8 solved, 63 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 63/71 constraints, Known Traps: 7/7 constraints]
After SMT, in 2932ms problems are : Problem set: 8 solved, 63 unsolved
Search for dead transitions found 8 dead transitions in 2934ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/71 places, 68/79 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 66 /68 variables (removed 2) and now considering 68/68 (removed 0) transitions.
[2024-05-21 15:53:06] [INFO ] Redundant transitions in 112 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3289 ms. Remains : 66/71 places, 68/79 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 7786 ms.
[2024-05-21 15:53:06] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:53:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-21 15:53:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 478 places, 395 transitions and 1202 arcs took 7 ms.
Total runtime 297095 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 478
TRANSITIONS: 395
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4445
MODEL NAME: /home/mcc/execution/416/model
478 places, 395 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;