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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 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 131K 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-10-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305015650

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:23:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:23:37] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-21 15:23:37] [INFO ] Transformed 518 places.
[2024-05-21 15:23:37] [INFO ] Transformed 471 transitions.
[2024-05-21 15:23:37] [INFO ] Found NUPN structural information;
[2024-05-21 15:23:37] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 72 place count 446 transition count 400
Iterating global reduction 1 with 71 rules applied. Total rules applied 143 place count 446 transition count 400
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 178 place count 411 transition count 365
Iterating global reduction 1 with 35 rules applied. Total rules applied 213 place count 411 transition count 365
Applied a total of 213 rules in 226 ms. Remains 411 /518 variables (removed 107) and now considering 365/471 (removed 106) transitions.
// Phase 1: matrix 365 rows 411 cols
[2024-05-21 15:23:38] [INFO ] Computed 84 invariants in 30 ms
[2024-05-21 15:23:38] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-21 15:23:38] [INFO ] Invariant cache hit.
[2024-05-21 15:23:39] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-21 15:23:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 15:23:47] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 25 ms to minimize.
[2024-05-21 15:23:47] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:23:47] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 2 ms to minimize.
[2024-05-21 15:23:47] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 8 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:23:48] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 4 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 5 ms to minimize.
[2024-05-21 15:23:49] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 6 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 20/104 constraints. Problems are: Problem set: 8 solved, 356 unsolved
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:23:50] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 10 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:23:51] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 7 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 8 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:23:52] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:23:53] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 5 ms to minimize.
[2024-05-21 15:23:53] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 5 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 20/124 constraints. Problems are: Problem set: 22 solved, 342 unsolved
[2024-05-21 15:23:53] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 4 ms to minimize.
[2024-05-21 15:23:53] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:23:53] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:23:54] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 4 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:23:55] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:23:56] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 20/144 constraints. Problems are: Problem set: 26 solved, 338 unsolved
[2024-05-21 15:23:58] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:23:58] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:23:58] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:23:58] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 4 ms to minimize.
[2024-05-21 15:23:59] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:23:59] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:23:59] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:24:00] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:24:00] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:24:00] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:24:00] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:24:00] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 2 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:24:01] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:24:02] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 2 ms to minimize.
[2024-05-21 15:24:02] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 20/164 constraints. Problems are: Problem set: 32 solved, 332 unsolved
[2024-05-21 15:24:02] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:24:03] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:24:04] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
Problem TDEAD294 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 20/184 constraints. Problems are: Problem set: 33 solved, 331 unsolved
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 4 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:24:05] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:24:06] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 1 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:24:07] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:24:08] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 20/204 constraints. Problems are: Problem set: 33 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/776 variables, and 204 constraints, problems are : Problem set: 33 solved, 331 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 33 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 35/35 constraints. Problems are: Problem set: 33 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/35 constraints. Problems are: Problem set: 33 solved, 331 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 45/80 constraints. Problems are: Problem set: 33 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 4/84 constraints. Problems are: Problem set: 33 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 120/204 constraints. Problems are: Problem set: 33 solved, 331 unsolved
[2024-05-21 15:24:13] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 4 ms to minimize.
[2024-05-21 15:24:13] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 4 ms to minimize.
[2024-05-21 15:24:13] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:24:13] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:24:13] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 4 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 4 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 4 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 4 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 6 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 4 ms to minimize.
[2024-05-21 15:24:14] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 6 ms to minimize.
[2024-05-21 15:24:15] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:24:15] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 2 ms to minimize.
[2024-05-21 15:24:15] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:24:15] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:24:16] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:24:16] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:24:16] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:24:16] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 20/224 constraints. Problems are: Problem set: 33 solved, 331 unsolved
[2024-05-21 15:24:16] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:24:17] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 2 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:24:18] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:24:19] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 20/244 constraints. Problems are: Problem set: 33 solved, 331 unsolved
[2024-05-21 15:24:20] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:24:20] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:24:20] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:24:20] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:24:21] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:24:22] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:24:23] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 20/264 constraints. Problems are: Problem set: 35 solved, 329 unsolved
[2024-05-21 15:24:23] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:24:23] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:24:23] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:24:24] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:24:25] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:24:26] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 2 ms to minimize.
[2024-05-21 15:24:26] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:24:26] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:24:26] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 20/284 constraints. Problems are: Problem set: 35 solved, 329 unsolved
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:24:27] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:24:28] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 6 ms to minimize.
[2024-05-21 15:24:28] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:24:28] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:24:28] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:24:28] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:24:29] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:24:30] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:24:30] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:24:30] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 20/304 constraints. Problems are: Problem set: 35 solved, 329 unsolved
[2024-05-21 15:24:31] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:24:32] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:24:32] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:24:32] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:24:32] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:24:33] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:24:33] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:24:33] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:24:33] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:24:34] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:24:34] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2024-05-21 15:24:34] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 3 ms to minimize.
[2024-05-21 15:24:34] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 2 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:24:35] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:24:36] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/324 constraints. Problems are: Problem set: 35 solved, 329 unsolved
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 1 ms to minimize.
[2024-05-21 15:24:37] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 1 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:24:38] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:24:39] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 4 ms to minimize.
[2024-05-21 15:24:39] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:24:39] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:24:39] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:24:39] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 20/344 constraints. Problems are: Problem set: 35 solved, 329 unsolved
(s151 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/776 variables, and 344 constraints, problems are : Problem set: 35 solved, 329 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 260/260 constraints]
After SMT, in 60342ms problems are : Problem set: 35 solved, 329 unsolved
Search for dead transitions found 35 dead transitions in 60364ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 411/518 places, 330/471 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 409 transition count 330
Applied a total of 2 rules in 16 ms. Remains 409 /411 variables (removed 2) and now considering 330/330 (removed 0) transitions.
// Phase 1: matrix 330 rows 409 cols
[2024-05-21 15:24:40] [INFO ] Computed 90 invariants in 8 ms
[2024-05-21 15:24:40] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 15:24:40] [INFO ] Invariant cache hit.
[2024-05-21 15:24:40] [INFO ] Implicit Places using invariants and state equation in 573 ms returned [365]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 741 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 408/518 places, 330/471 transitions.
Applied a total of 0 rules in 22 ms. Remains 408 /408 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62737 ms. Remains : 408/518 places, 330/471 transitions.
Support contains 28 out of 408 places after structural reductions.
[2024-05-21 15:24:41] [INFO ] Flatten gal took : 74 ms
[2024-05-21 15:24:41] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:24:41] [INFO ] Input system was already deterministic with 330 transitions.
Support contains 27 out of 408 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (326 resets) in 1699 ms. (23 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40002 steps (54 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (59 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (55 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (53 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (57 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (55 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (58 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (56 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (56 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
// Phase 1: matrix 330 rows 408 cols
[2024-05-21 15:24:42] [INFO ] Computed 89 invariants in 5 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 144/155 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 137/292 variables, 35/45 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 113/405 variables, 44/89 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 328/733 variables, 405/494 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 0/494 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 5/738 variables, 3/497 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/497 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/738 variables, 0/497 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 738/738 variables, and 497 constraints, problems are : Problem set: 3 solved, 7 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 182/292 variables, 41/45 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 15:24:43] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:24:43] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:24:43] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:24:43] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 9/54 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/54 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 6 (OVERLAPS) 113/405 variables, 44/98 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:24:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 2/100 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 328/733 variables, 405/505 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/733 variables, 5/510 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-21 15:24:45] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:24:45] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/733 variables, 2/512 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/733 variables, 0/512 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/738 variables, 3/515 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/515 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/738 variables, 0/515 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 738/738 variables, and 515 constraints, problems are : Problem set: 5 solved, 5 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 13/13 constraints]
After SMT, in 3552ms problems are : Problem set: 5 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1503 ms.
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 182 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 4 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 848 edges and 403 vertex of which 402 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 402 transition count 283
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 363 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 362 transition count 282
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 82 place count 362 transition count 198
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 261 place count 267 transition count 198
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 268 place count 260 transition count 191
Iterating global reduction 3 with 7 rules applied. Total rules applied 275 place count 260 transition count 191
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 492 place count 145 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 494 place count 144 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 496 place count 144 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 498 place count 142 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 142 transition count 90
Applied a total of 499 rules in 155 ms. Remains 142 /408 variables (removed 266) and now considering 90/330 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 142/408 places, 90/330 transitions.
RANDOM walk for 679 steps (33 resets) in 10 ms. (61 steps per ms) remains 0/5 properties
FORMULA BusinessProcesses-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA BusinessProcesses-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 198 stabilizing places and 171 stable transitions
Graph (complete) has 855 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&F((p1&&X(p2))))))'
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 400 transition count 322
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 400 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 399 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 399 transition count 321
Applied a total of 18 rules in 56 ms. Remains 399 /408 variables (removed 9) and now considering 321/330 (removed 9) transitions.
// Phase 1: matrix 321 rows 399 cols
[2024-05-21 15:24:48] [INFO ] Computed 89 invariants in 9 ms
[2024-05-21 15:24:48] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 15:24:48] [INFO ] Invariant cache hit.
[2024-05-21 15:24:48] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-05-21 15:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 2 ms to minimize.
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:24:54] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:24:55] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 2 ms to minimize.
[2024-05-21 15:24:56] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 4 ms to minimize.
[2024-05-21 15:24:57] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:24:57] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:24:57] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:24:57] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:24:57] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:24:58] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:24:59] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 5 ms to minimize.
[2024-05-21 15:24:59] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:24:59] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:24:59] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 4 ms to minimize.
[2024-05-21 15:25:00] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:25:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:25:00] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:25:00] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:25:01] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 4 ms to minimize.
[2024-05-21 15:25:04] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:25:05] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:25:05] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:25:05] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:25:06] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:25:06] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:25:06] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:25:06] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:25:07] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:25:08] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:25:08] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:25:08] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:25:08] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:25:10] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:25:10] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:25:10] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:25:10] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:25:11] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:25:11] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:25:11] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:25:11] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:25:12] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:25:12] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:25:13] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2024-05-21 15:25:14] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:25:14] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 2 ms to minimize.
[2024-05-21 15:25:14] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:25:14] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:25:15] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:25:15] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:25:15] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 1 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:25:16] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:25:17] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:25:18] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 3 ms to minimize.
[2024-05-21 15:25:18] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:25:18] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/720 variables, and 189 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 100/189 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:25:43] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 1 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 5 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:25:44] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:25:45] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:25:46] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:25:46] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:25:46] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:25:46] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:25:46] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:25:47] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:25:47] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:25:47] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:25:47] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:25:47] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 2 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 1 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:25:48] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 6 ms to minimize.
SMT process timed out in 60251ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 399/408 places, 321/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60905 ms. Remains : 399/408 places, 321/330 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 61370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 188 edges and 408 vertex of which 6 / 408 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 849 edges and 403 vertex of which 402 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 280
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 359 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 358 transition count 279
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 88 place count 358 transition count 194
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 271 place count 260 transition count 194
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 253 transition count 187
Iterating global reduction 3 with 7 rules applied. Total rules applied 285 place count 253 transition count 187
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 502 place count 138 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 504 place count 137 transition count 88
Applied a total of 504 rules in 71 ms. Remains 137 /408 variables (removed 271) and now considering 88/330 (removed 242) transitions.
// Phase 1: matrix 88 rows 137 cols
[2024-05-21 15:25:49] [INFO ] Computed 63 invariants in 1 ms
[2024-05-21 15:25:49] [INFO ] Implicit Places using invariants in 189 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 39, 40]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 192 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/408 places, 88/330 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 270 ms. Remains : 122/408 places, 88/330 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04
Stuttering criterion allowed to conclude after 29 steps with 5 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 359 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 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 188 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 849 edges and 403 vertex of which 402 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 280
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 359 transition count 280
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 86 place count 359 transition count 194
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 271 place count 260 transition count 194
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 279 place count 252 transition count 186
Iterating global reduction 2 with 8 rules applied. Total rules applied 287 place count 252 transition count 186
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 504 place count 137 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 506 place count 136 transition count 87
Applied a total of 506 rules in 79 ms. Remains 136 /408 variables (removed 272) and now considering 87/330 (removed 243) transitions.
// Phase 1: matrix 87 rows 136 cols
[2024-05-21 15:25:49] [INFO ] Computed 63 invariants in 1 ms
[2024-05-21 15:25:49] [INFO ] Implicit Places using invariants in 186 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 40, 41]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 189 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/408 places, 87/330 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 121/408 places, 87/330 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-05 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(p1&&F(p2))))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 400 transition count 322
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 400 transition count 322
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 398 transition count 320
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 398 transition count 320
Applied a total of 20 rules in 31 ms. Remains 398 /408 variables (removed 10) and now considering 320/330 (removed 10) transitions.
// Phase 1: matrix 320 rows 398 cols
[2024-05-21 15:25:50] [INFO ] Computed 89 invariants in 3 ms
[2024-05-21 15:25:50] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 15:25:50] [INFO ] Invariant cache hit.
[2024-05-21 15:25:50] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-21 15:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:25:56] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:25:57] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:25:58] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:25:59] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:00] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:01] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:02] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:03] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:26:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:05] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:26:05] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:26:05] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:26:05] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:06] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:26:07] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:08] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:08] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:26:08] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:26:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:08] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:26:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:26:09] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:26:09] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:26:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:26:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:26:11] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 15 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:26:13] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:26:14] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:26:14] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:14] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:26:14] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:16] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:16] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:16] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:26:16] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:16] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:26:17] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:26:18] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:26:18] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:26:18] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:26:18] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:18] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:19] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:19] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:26:19] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:19] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:26:19] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:26:20] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:20] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:26:20] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:26:20] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 30133ms
Starting structural reductions in LTL mode, iteration 1 : 398/408 places, 320/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30834 ms. Remains : 398/408 places, 320/330 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 1345 reset in 303 ms.
Product exploration explored 100000 steps with 1363 reset in 265 ms.
Computed a total of 193 stabilizing places and 166 stable transitions
Graph (complete) has 843 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 193 stabilizing places and 166 stable transitions
Detected a total of 193/398 stabilizing places and 166/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 126 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (329 resets) in 302 ms. (132 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (56 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2024-05-21 15:26:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 253/279 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-21 15:26:22] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 116/395 variables, 44/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 318/713 variables, 395/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/718 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/718 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 718/718 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 253/279 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 116/395 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 318/713 variables, 395/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:26:23] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/713 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/718 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/718 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 718/718 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 320/320 transitions.
Graph (trivial) has 177 edges and 398 vertex of which 6 / 398 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 836 edges and 393 vertex of which 392 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 392 transition count 276
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 356 transition count 276
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 74 place count 356 transition count 190
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 259 place count 257 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 256 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 256 transition count 189
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 484 place count 138 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 486 place count 137 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 137 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 490 place count 135 transition count 85
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 491 place count 135 transition count 85
Applied a total of 491 rules in 65 ms. Remains 135 /398 variables (removed 263) and now considering 85/320 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 135/398 places, 85/320 transitions.
RANDOM walk for 894 steps (38 resets) in 7 ms. (111 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 320/320 transitions.
Applied a total of 0 rules in 8 ms. Remains 398 /398 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 15:26:24] [INFO ] Invariant cache hit.
[2024-05-21 15:26:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 15:26:24] [INFO ] Invariant cache hit.
[2024-05-21 15:26:24] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-21 15:26:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:29] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:26:29] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:26:29] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:26:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:26:31] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 14 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:26:32] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:26:33] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:26:34] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:44] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:26:45] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:26:45] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:26:45] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:46] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:26:46] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:26:47] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:26:48] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:26:49] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 6 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 4 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 5 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.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 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.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 1.0)
(s184 1.0)
(s185 1.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 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/718 variables, and 225 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 136/136 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 136/225 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:26:57] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:26:57] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:26:57] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:26:57] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 4 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 4 ms to minimize.
[2024-05-21 15:27:03] [INFO ] Deduced a trap composed of 8 places in 4285 ms of which 27 ms to minimize.
[2024-05-21 15:27:03] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 5 ms to minimize.
[2024-05-21 15:27:03] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:27:03] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:27:03] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 7 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 4 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2024-05-21 15:27:05] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:27:05] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:27:06] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:27:07] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 2 ms to minimize.
[2024-05-21 15:27:07] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:27:07] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:27:08] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:27:08] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 5 ms to minimize.
[2024-05-21 15:27:08] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 4 ms to minimize.
[2024-05-21 15:27:08] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 5 ms to minimize.
[2024-05-21 15:27:09] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:09] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:27:09] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:27:09] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:27:10] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:27:11] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-05-21 15:27:11] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:27:11] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:27:11] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 5 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 4 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:27:12] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 5 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 4 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:27:13] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 5 ms to minimize.
[2024-05-21 15:27:14] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:27:14] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 5 ms to minimize.
[2024-05-21 15:27:14] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:27:15] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:27:15] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 5 ms to minimize.
[2024-05-21 15:27:16] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 6 ms to minimize.
[2024-05-21 15:27:16] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 7 ms to minimize.
[2024-05-21 15:27:16] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 5 ms to minimize.
[2024-05-21 15:27:16] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 5 ms to minimize.
[2024-05-21 15:27:16] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:17] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 8 ms to minimize.
[2024-05-21 15:27:17] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 7 ms to minimize.
[2024-05-21 15:27:18] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:27:18] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:27:18] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:27:18] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:27:19] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:27:19] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 6 ms to minimize.
[2024-05-21 15:27:19] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:27:19] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:27:20] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:27:20] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:27:20] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 15:27:21] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:27:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:27:21] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:27:21] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:27:21] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:27:22] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:27:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:27:24] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/718 variables, and 325 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 0/319 constraints, Known Traps: 236/236 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 398/398 places, 320/320 transitions.
Computed a total of 193 stabilizing places and 166 stable transitions
Graph (complete) has 843 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 193 stabilizing places and 166 stable transitions
Detected a total of 193/398 stabilizing places and 166/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (328 resets) in 167 ms. (238 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (55 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2024-05-21 15:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 253/279 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 26 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:27:25] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 116/395 variables, 44/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 318/713 variables, 395/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/718 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/718 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 718/718 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 253/279 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 116/395 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 318/713 variables, 395/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:27:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/713 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/718 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/718 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 718/718 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 1456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 320/320 transitions.
Graph (trivial) has 177 edges and 398 vertex of which 6 / 398 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 836 edges and 393 vertex of which 392 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 392 transition count 276
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 356 transition count 276
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 74 place count 356 transition count 190
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 259 place count 257 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 256 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 256 transition count 189
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 484 place count 138 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 486 place count 137 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 137 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 490 place count 135 transition count 85
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 491 place count 135 transition count 85
Applied a total of 491 rules in 37 ms. Remains 135 /398 variables (removed 263) and now considering 85/320 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 135/398 places, 85/320 transitions.
RANDOM walk for 530 steps (25 resets) in 7 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1375 reset in 159 ms.
Stack based approach found an accepted trace after 79305 steps with 1072 reset with depth 92 and stack size 92 in 188 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-06 finished in 98019 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)||G(F(p1)))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 187 edges and 408 vertex of which 6 / 408 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 849 edges and 403 vertex of which 402 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 401 transition count 280
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 359 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 358 transition count 279
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 88 place count 358 transition count 194
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 270 place count 261 transition count 194
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 278 place count 253 transition count 186
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 253 transition count 186
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 499 place count 140 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 501 place count 139 transition count 89
Applied a total of 501 rules in 34 ms. Remains 139 /408 variables (removed 269) and now considering 89/330 (removed 241) transitions.
// Phase 1: matrix 89 rows 139 cols
[2024-05-21 15:27:28] [INFO ] Computed 64 invariants in 2 ms
[2024-05-21 15:27:28] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 6, 9, 22, 23, 24, 25, 26, 27, 41, 42, 104]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 112 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/408 places, 89/330 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 123/408 places, 89/330 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-10 finished in 240 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((X(F(p1))||p0))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 185 edges and 408 vertex of which 6 / 408 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 849 edges and 403 vertex of which 402 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 401 transition count 282
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 361 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 359 transition count 280
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 86 place count 359 transition count 195
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 268 place count 262 transition count 195
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 276 place count 254 transition count 187
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 254 transition count 187
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 501 place count 139 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 138 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 137 transition count 84
Applied a total of 503 rules in 40 ms. Remains 137 /408 variables (removed 271) and now considering 84/330 (removed 246) transitions.
// Phase 1: matrix 84 rows 137 cols
[2024-05-21 15:27:28] [INFO ] Computed 63 invariants in 1 ms
[2024-05-21 15:27:28] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 2, 3, 4, 5, 6, 21, 22, 23, 24, 25, 26, 42, 109]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 109 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/408 places, 84/330 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 122/408 places, 84/330 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 401 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 401 transition count 323
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 399 transition count 321
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 399 transition count 321
Applied a total of 18 rules in 20 ms. Remains 399 /408 variables (removed 9) and now considering 321/330 (removed 9) transitions.
// Phase 1: matrix 321 rows 399 cols
[2024-05-21 15:27:28] [INFO ] Computed 89 invariants in 4 ms
[2024-05-21 15:27:28] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 15:27:28] [INFO ] Invariant cache hit.
[2024-05-21 15:27:29] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-05-21 15:27:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:34] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:27:34] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:27:34] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:27:34] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:27:34] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 6 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 6 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:46] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:27:46] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:27:46] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 4 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:27:56] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:56] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:27:56] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:27:58] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:27:59] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/720 variables, and 211 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 122/211 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:01] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:28:01] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:28:01] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:28:02] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:28:02] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:28:02] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:28:02] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:28:02] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:28:03] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:28:03] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:28:03] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:28:05] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:28:08] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:16] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:28:17] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:17] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 5 ms to minimize.
[2024-05-21 15:28:17] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:28:18] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:28:18] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:18] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:28:19] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:28:20] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:28:21] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:21] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:21] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:28:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:28:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:28:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:28:22] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:28:22] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:28:23] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:28:23] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:28:23] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:23] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:28:24] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:28:24] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:24] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:28:24] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:28:25] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:28:25] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:28:25] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:28:25] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:28:26] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-21 15:28:26] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:28:27] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:28:27] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:28:27] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:28] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/720 variables, and 337 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 0/320 constraints, Known Traps: 248/248 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 399/408 places, 321/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 399/408 places, 321/330 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-13 finished in 60833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(G((p1&&X(p2))))))))'
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 401 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 401 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 400 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 400 transition count 322
Applied a total of 16 rules in 28 ms. Remains 400 /408 variables (removed 8) and now considering 322/330 (removed 8) transitions.
// Phase 1: matrix 322 rows 400 cols
[2024-05-21 15:28:29] [INFO ] Computed 89 invariants in 4 ms
[2024-05-21 15:28:29] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 15:28:29] [INFO ] Invariant cache hit.
[2024-05-21 15:28:30] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-21 15:28:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:35] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:28:35] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:28:35] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:28:35] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:28:35] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:28:36] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:28:37] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:28:38] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:39] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:28:40] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:28:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:28:40] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:28:40] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:28:40] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:41] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:28:41] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:28:41] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:28:41] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:28:42] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:28:43] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:28:43] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:28:43] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:43] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:28:44] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:28:44] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:28:44] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:28:44] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:28:44] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:46] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:28:46] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:28:46] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:28:46] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:28:47] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:28:48] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:28:49] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:28:50] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:28:50] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:28:50] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:28:50] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:28:50] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:51] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:52] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:28:52] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:28:52] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:28:52] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:28:53] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:28:53] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:28:54] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:28:55] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:28:58] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:28:59] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:00] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:29:00] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 322/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30766 ms. Remains : 400/408 places, 322/330 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 25059 reset in 228 ms.
Product exploration explored 100000 steps with 25023 reset in 220 ms.
Computed a total of 193 stabilizing places and 166 stable transitions
Graph (complete) has 845 edges and 400 vertex of which 399 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 193 stabilizing places and 166 stable transitions
Detected a total of 193/400 stabilizing places and 166/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 342 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (329 resets) in 613 ms. (65 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (49 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
[2024-05-21 15:29:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 190/288 variables, 43/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:29:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 9/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 109/397 variables, 42/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:29:03] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:29:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 20/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:29:05] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:29:06] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:29:07] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:07] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:29:07] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:29:07] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
SMT process timed out in 5095ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 322/322 transitions.
Graph (trivial) has 178 edges and 400 vertex of which 6 / 400 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 838 edges and 395 vertex of which 394 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 394 transition count 277
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 357 transition count 277
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 76 place count 357 transition count 193
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 256 place count 261 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 260 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 260 transition count 192
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 485 place count 140 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 487 place count 139 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 139 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 491 place count 137 transition count 86
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 492 place count 137 transition count 86
Applied a total of 492 rules in 34 ms. Remains 137 /400 variables (removed 263) and now considering 86/322 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 137/400 places, 86/322 transitions.
RANDOM walk for 40000 steps (1745 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1624 steps (28 resets) in 7 ms. (203 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 501 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 322/322 transitions.
Applied a total of 0 rules in 9 ms. Remains 400 /400 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-21 15:29:08] [INFO ] Invariant cache hit.
[2024-05-21 15:29:08] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-21 15:29:08] [INFO ] Invariant cache hit.
[2024-05-21 15:29:09] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-21 15:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:14] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:29:14] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 4 ms to minimize.
[2024-05-21 15:29:14] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:29:14] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:15] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:16] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 4 ms to minimize.
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:17] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:29:18] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:29:19] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:29:19] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:19] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:29:19] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:29:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:29:20] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:29:20] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:29:20] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:20] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:29:20] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:29:21] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:29:21] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:21] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:29:21] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:29:21] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:29:22] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:29:23] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:25] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:25] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:29:25] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:29:26] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:29:27] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:29:28] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:29] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:29:29] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:29:29] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:29] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:29:30] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:31] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:29:31] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:31] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:32] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:29:32] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:29:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:33] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:29:34] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:29:37] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:29:37] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:29:37] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:38] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:29:39] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:39] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:39] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:29:39] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Finished structural reductions in LTL mode , in 1 iterations and 30706 ms. Remains : 400/400 places, 322/322 transitions.
Computed a total of 193 stabilizing places and 166 stable transitions
Graph (complete) has 845 edges and 400 vertex of which 399 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 193 stabilizing places and 166 stable transitions
Detected a total of 193/400 stabilizing places and 166/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 206 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (332 resets) in 675 ms. (59 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (52 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
[2024-05-21 15:29:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 190/288 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:29:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:29:40] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:29:40] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:29:40] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 109/397 variables, 42/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 320/717 variables, 397/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/722 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/722 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/722 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 496 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 190/288 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:29:41] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:29:42] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:29:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:29:44] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:29:45] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
SMT process timed out in 6082ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 322/322 transitions.
Graph (trivial) has 176 edges and 400 vertex of which 6 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 838 edges and 395 vertex of which 394 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 394 transition count 278
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 358 transition count 278
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 74 place count 358 transition count 194
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 254 place count 262 transition count 194
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 481 place count 142 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 483 place count 141 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 485 place count 141 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 487 place count 139 transition count 88
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 488 place count 139 transition count 88
Applied a total of 488 rules in 44 ms. Remains 139 /400 variables (removed 261) and now considering 88/322 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 139/400 places, 88/322 transitions.
RANDOM walk for 40000 steps (1701 resets) in 272 ms. (146 steps per ms) remains 1/3 properties
BEST_FIRST walk for 1352 steps (18 resets) in 7 ms. (169 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 721 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25011 reset in 188 ms.
Product exploration explored 100000 steps with 24948 reset in 186 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 322/322 transitions.
Graph (trivial) has 176 edges and 400 vertex of which 6 / 400 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 839 edges and 395 vertex of which 394 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
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 394 transition count 315
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 38 place count 394 transition count 356
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 98 place count 394 transition count 356
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 382 transition count 333
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 382 transition count 333
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 252 place count 382 transition count 333
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 281 place count 353 transition count 304
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 310 place count 353 transition count 304
Deduced a syphon composed of 185 places in 0 ms
Applied a total of 310 rules in 98 ms. Remains 353 /400 variables (removed 47) and now considering 304/322 (removed 18) transitions.
[2024-05-21 15:29:49] [INFO ] Redundant transitions in 19 ms returned []
Running 303 sub problems to find dead transitions.
// Phase 1: matrix 304 rows 353 cols
[2024-05-21 15:29:49] [INFO ] Computed 89 invariants in 7 ms
[2024-05-21 15:29:49] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 20/109 constraints. Problems are: Problem set: 133 solved, 170 unsolved
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 15:29:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 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 TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD146 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 TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 20/129 constraints. Problems are: Problem set: 180 solved, 123 unsolved
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-05-21 15:29:57] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 20/149 constraints. Problems are: Problem set: 208 solved, 95 unsolved
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/169 constraints. Problems are: Problem set: 212 solved, 91 unsolved
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 11/180 constraints. Problems are: Problem set: 213 solved, 90 unsolved
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 7/187 constraints. Problems are: Problem set: 213 solved, 90 unsolved
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 10/197 constraints. Problems are: Problem set: 213 solved, 90 unsolved
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 10/207 constraints. Problems are: Problem set: 213 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/207 constraints. Problems are: Problem set: 213 solved, 90 unsolved
Problem TDEAD139 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 13 (OVERLAPS) 303/656 variables, 353/560 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/656 variables, 10/570 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/656 variables, 0/570 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 16 (OVERLAPS) 1/657 variables, 1/571 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/657 variables, 0/571 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 18 (OVERLAPS) 0/657 variables, 0/571 constraints. Problems are: Problem set: 216 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 571 constraints, problems are : Problem set: 216 solved, 87 unsolved in 23852 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 353/353 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 216 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 141/308 variables, 47/47 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 118/165 constraints. Problems are: Problem set: 216 solved, 87 unsolved
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:30:15] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:30:15] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 13/178 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/178 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 44/352 variables, 42/220 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/220 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 303/655 variables, 352/572 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 10/582 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 87/669 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/669 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 1/656 variables, 1/670 constraints. Problems are: Problem set: 216 solved, 87 unsolved
[2024-05-21 15:30:27] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:30:27] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/656 variables, 2/672 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/656 variables, 0/672 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 1/657 variables, 1/673 constraints. Problems are: Problem set: 216 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/657 variables, 0/673 constraints. Problems are: Problem set: 216 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 673 constraints, problems are : Problem set: 216 solved, 87 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 353/353 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 87/303 constraints, Known Traps: 133/133 constraints]
After SMT, in 54052ms problems are : Problem set: 216 solved, 87 unsolved
Search for dead transitions found 216 dead transitions in 54058ms
Found 216 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 216 transitions
Dead transitions reduction (with SMT) removed 216 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 353/400 places, 88/322 transitions.
Graph (complete) has 635 edges and 353 vertex of which 168 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.2 ms
Discarding 185 places :
Also discarding 0 output transitions
Ensure Unique test removed 26 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 142 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 142 transition count 99
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 19 ms. Remains 142 /353 variables (removed 211) and now considering 99/88 (removed -11) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 142/400 places, 99/322 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54207 ms. Remains : 142/400 places, 99/322 transitions.
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 322/322 transitions.
Applied a total of 0 rules in 30 ms. Remains 400 /400 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 400 cols
[2024-05-21 15:30:43] [INFO ] Computed 89 invariants in 2 ms
[2024-05-21 15:30:43] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 15:30:43] [INFO ] Invariant cache hit.
[2024-05-21 15:30:44] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-21 15:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:30:49] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:30:50] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:30:51] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:30:52] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:30:53] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:30:54] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:30:55] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:30:56] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:30:56] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:30:56] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:30:56] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-05-21 15:30:57] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:30:57] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:30:57] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:30:57] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:30:57] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:30:59] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:30:59] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:30:59] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:30:59] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:31:00] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:31:01] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:31:02] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:31:03] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:31:04] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:31:04] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:31:04] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:31:04] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:31:05] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:31:06] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:31:06] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:31:06] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:31:06] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:31:07] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:31:08] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:31:08] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:31:08] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:31:10] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:31:10] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:31:10] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:31:11] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:31:12] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:31:13] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:31:13] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 15:31:14] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:31:14] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30117ms
Finished structural reductions in LTL mode , in 1 iterations and 30802 ms. Remains : 400/400 places, 322/322 transitions.
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 165108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(G((p1&&X(p2))))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-10-LTLFireability-14
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 408/408 places, 330/330 transitions.
Graph (trivial) has 184 edges and 408 vertex of which 6 / 408 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 849 edges and 403 vertex of which 402 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 401 transition count 281
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 360 transition count 281
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 84 place count 360 transition count 197
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 264 place count 264 transition count 197
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 258 transition count 191
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 258 transition count 191
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 495 place count 142 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 497 place count 141 transition count 91
Applied a total of 497 rules in 30 ms. Remains 141 /408 variables (removed 267) and now considering 91/330 (removed 239) transitions.
// Phase 1: matrix 91 rows 141 cols
[2024-05-21 15:31:14] [INFO ] Computed 64 invariants in 1 ms
[2024-05-21 15:31:15] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 26, 40, 41]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 151 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 125/408 places, 91/330 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 183 ms. Remains : 125/408 places, 91/330 transitions.
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 25353 reset in 210 ms.
Product exploration explored 100000 steps with 25379 reset in 221 ms.
Computed a total of 53 stabilizing places and 44 stable transitions
Computed a total of 53 stabilizing places and 44 stable transitions
Detected a total of 53/125 stabilizing places and 44/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 12 factoid took 433 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (6337 resets) in 1768 ms. (22 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (2140 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 232 ms. (171 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (2153 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2056 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
// Phase 1: matrix 91 rows 125 cols
[2024-05-21 15:31:17] [INFO ] Computed 48 invariants in 0 ms
[2024-05-21 15:31:17] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/39 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/102 variables, 30/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/124 variables, 16/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/214 variables, 124/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/215 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 177 constraints, problems are : Problem set: 1 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 125/125 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/102 variables, 30/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/124 variables, 16/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/214 variables, 124/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 179 constraints, problems are : Problem set: 1 solved, 2 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 125/125 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 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 125 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 125 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 124 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 124 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 87
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 8 place count 122 transition count 87
Applied a total of 8 rules in 8 ms. Remains 122 /125 variables (removed 3) and now considering 87/91 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 122/125 places, 87/91 transitions.
RANDOM walk for 466 steps (15 resets) in 7 ms. (58 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 1043 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-21 15:31:19] [INFO ] Invariant cache hit.
[2024-05-21 15:31:19] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 15:31:19] [INFO ] Invariant cache hit.
[2024-05-21 15:31:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:31:19] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [13, 24, 63, 67, 69, 71, 75, 77]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 338 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/125 places, 91/91 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 115 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 115 transition count 88
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 88/91 (removed 3) transitions.
// Phase 1: matrix 88 rows 115 cols
[2024-05-21 15:31:19] [INFO ] Computed 40 invariants in 1 ms
[2024-05-21 15:31:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 15:31:19] [INFO ] Invariant cache hit.
[2024-05-21 15:31:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:31:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/125 places, 88/91 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 561 ms. Remains : 115/125 places, 88/91 transitions.
Computed a total of 43 stabilizing places and 41 stable transitions
Graph (complete) has 336 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Computed a total of 43 stabilizing places and 41 stable transitions
Detected a total of 43/115 stabilizing places and 41/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (6253 resets) in 732 ms. (54 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (2151 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1953 resets) in 180 ms. (221 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (2049 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2024-05-21 15:31:21] [INFO ] Invariant cache hit.
[2024-05-21 15:31:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/49 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/92 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 17/109 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 85/194 variables, 109/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/202 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/202 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/49 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/92 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 17/109 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:31:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 85/194 variables, 109/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:31:21] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/202 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 88/88 transitions.
Graph (complete) has 318 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 106 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 103 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 103 transition count 79
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 10 place count 102 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 93 transition count 72
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 2 with 2 rules applied. Total rules applied 28 place count 92 transition count 71
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 92 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 90 transition count 69
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 90 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 89 transition count 68
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 89 transition count 68
Applied a total of 36 rules in 16 ms. Remains 89 /115 variables (removed 26) and now considering 68/88 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 89/115 places, 68/88 transitions.
RANDOM walk for 462 steps (21 resets) in 9 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 784 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25415 reset in 174 ms.
Product exploration explored 100000 steps with 25380 reset in 169 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 88/88 transitions.
Graph (complete) has 336 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 106 transition count 84
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 106 transition count 84
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 11 rules in 3 ms. Remains 106 /115 variables (removed 9) and now considering 84/88 (removed 4) transitions.
[2024-05-21 15:31:23] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
// Phase 1: matrix 84 rows 106 cols
[2024-05-21 15:31:23] [INFO ] Computed 35 invariants in 0 ms
[2024-05-21 15:31:23] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 5 (OVERLAPS) 83/189 variables, 106/141 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/144 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:31:24] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:31:25] [INFO ] Deduced a trap composed of 26 places in 482 ms of which 1 ms to minimize.
[2024-05-21 15:31:25] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:31:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:26] [INFO ] Deduced a trap composed of 24 places in 976 ms of which 1 ms to minimize.
[2024-05-21 15:31:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:31:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:31:26] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 706 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 14/158 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:31:27] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 8/166 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/166 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-21 15:31:28] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/189 variables, 11/177 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:31:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 14/191 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/191 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/191 constraints. Problems are: Problem set: 11 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/190 variables, and 191 constraints, problems are : Problem set: 11 solved, 68 unsolved in 6857 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 106/106 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 11 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 31/35 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 24/59 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/61 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 16/77 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/77 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 6/102 variables, 5/82 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/82 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 83/185 variables, 102/184 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 3/187 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 68/255 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/255 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 4/189 variables, 4/259 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:33] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 12/271 constraints. Problems are: Problem set: 11 solved, 68 unsolved
[2024-05-21 15:31:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 1/272 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 0/272 constraints. Problems are: Problem set: 11 solved, 68 unsolved
At refinement iteration 17 (OVERLAPS) 0/189 variables, 0/272 constraints. Problems are: Problem set: 11 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/190 variables, and 272 constraints, problems are : Problem set: 11 solved, 68 unsolved in 7558 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 106/106 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 68/79 constraints, Known Traps: 60/60 constraints]
After SMT, in 14468ms problems are : Problem set: 11 solved, 68 unsolved
Search for dead transitions found 11 dead transitions in 14470ms
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 : 106/115 places, 73/88 transitions.
Graph (complete) has 307 edges and 106 vertex of which 96 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 94 /106 variables (removed 12) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/115 places, 73/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14489 ms. Remains : 94/115 places, 73/88 transitions.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 115 cols
[2024-05-21 15:31:38] [INFO ] Computed 40 invariants in 1 ms
[2024-05-21 15:31:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 15:31:38] [INFO ] Invariant cache hit.
[2024-05-21 15:31:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:31:38] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 15:31:38] [INFO ] Invariant cache hit.
[2024-05-21 15:31:38] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD47 is UNSAT
At refinement iteration 5 (OVERLAPS) 87/202 variables, 115/155 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/158 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:31:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 13/171 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2024-05-21 15:31:40] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 12/183 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 4/187 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:31:41] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 5/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:42] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:31:42] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:31:42] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:31:42] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/202 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 196 constraints, problems are : Problem set: 1 solved, 82 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 1 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 16/30 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 22/52 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/56 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 22/78 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 87/202 variables, 115/193 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/196 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 82/278 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:44] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:31:44] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:31:44] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:31:44] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:31:45] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:31:45] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:45] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-21 15:31:45] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:31:45] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 9/287 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:31:46] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 9/296 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:31:48] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 6/302 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:49] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:31:50] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 9/311 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-05-21 15:31:53] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:31:53] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/202 variables, 2/313 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 17 (OVERLAPS) 0/202 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 313 constraints, problems are : Problem set: 1 solved, 82 unsolved in 13865 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 82/83 constraints, Known Traps: 73/73 constraints]
After SMT, in 18981ms problems are : Problem set: 1 solved, 82 unsolved
Search for dead transitions found 1 dead transitions in 18982ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 115/115 places, 87/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19201 ms. Remains : 115/115 places, 87/88 transitions.
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 42899 ms.
[2024-05-21 15:31:57] [INFO ] Flatten gal took : 47 ms
[2024-05-21 15:31:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:31:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 408 places, 330 transitions and 986 arcs took 13 ms.
Total runtime 500049 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-10

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: 408
TRANSITIONS: 330
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: 7288
MODEL NAME: /home/mcc/execution/416/model
408 places, 330 transitions.

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...
FORMULA BusinessProcesses-PT-10-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716306190431

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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