About the Execution of GreatSPN+red for BusinessProcesses-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8668.096 | 2289072.00 | 6802834.00 | 241.30 | FFFFFF?FFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500588.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500588
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716308390062
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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:19:51] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-21 16:19:51] [INFO ] Transformed 717 places.
[2024-05-21 16:19:51] [INFO ] Transformed 642 transitions.
[2024-05-21 16:19:51] [INFO ] Found NUPN structural information;
[2024-05-21 16:19:51] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 15 places in 26 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 102 place count 600 transition count 533
Iterating global reduction 1 with 94 rules applied. Total rules applied 196 place count 600 transition count 533
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 243 place count 553 transition count 486
Iterating global reduction 1 with 47 rules applied. Total rules applied 290 place count 553 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 552 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 552 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 551 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 551 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 550 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 550 transition count 483
Applied a total of 296 rules in 263 ms. Remains 550 /702 variables (removed 152) and now considering 483/627 (removed 144) transitions.
// Phase 1: matrix 483 rows 550 cols
[2024-05-21 16:19:52] [INFO ] Computed 106 invariants in 32 ms
[2024-05-21 16:19:53] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-21 16:19:53] [INFO ] Invariant cache hit.
[2024-05-21 16:19:54] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-21 16:19:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-21 16:20:02] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 23 ms to minimize.
[2024-05-21 16:20:02] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 4 ms to minimize.
[2024-05-21 16:20:02] [INFO ] Deduced a trap composed of 102 places in 435 ms of which 3 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 14 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 111 places in 199 ms of which 2 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 7 ms to minimize.
[2024-05-21 16:20:03] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 8 ms to minimize.
[2024-05-21 16:20:04] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:20:05] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:20:05] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:20:05] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-21 16:20:08] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 5 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:20:09] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 4 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:20:10] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:20:11] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:12] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 4 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 4 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 5 ms to minimize.
[2024-05-21 16:20:13] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:20:14] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:20:14] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/166 constraints. Problems are: Problem set: 16 solved, 466 unsolved
[2024-05-21 16:20:14] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:20:14] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:20:14] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 5 ms to minimize.
[2024-05-21 16:20:15] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:20:16] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:20:17] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:20:17] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/186 constraints. Problems are: Problem set: 31 solved, 451 unsolved
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:20:21] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:20:22] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 94 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:20:23] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 20/206 constraints. Problems are: Problem set: 31 solved, 451 unsolved
[2024-05-21 16:20:24] [INFO ] Deduced a trap composed of 129 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:20:24] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:20:24] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 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 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1033 variables, and 209 constraints, problems are : Problem set: 31 solved, 451 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 31 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 41/41 constraints. Problems are: Problem set: 31 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 31 solved, 451 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 65/106 constraints. Problems are: Problem set: 31 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 103/209 constraints. Problems are: Problem set: 31 solved, 451 unsolved
[2024-05-21 16:20:28] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:20:28] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:20:28] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:20:28] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:20:28] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:20:29] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:20:30] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:20:31] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/229 constraints. Problems are: Problem set: 31 solved, 451 unsolved
[2024-05-21 16:20:31] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:20:31] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:20:31] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:20:31] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:20:32] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:20:32] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:20:32] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:20:32] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:20:32] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:20:33] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:20:34] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:20:34] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:20:34] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:20:34] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/249 constraints. Problems are: Problem set: 33 solved, 449 unsolved
[2024-05-21 16:20:34] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 4 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 4 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:20:35] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 18 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:20:36] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:20:37] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:20:37] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:20:37] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:20:37] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/269 constraints. Problems are: Problem set: 33 solved, 449 unsolved
[2024-05-21 16:20:38] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:20:38] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:20:38] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 2 ms to minimize.
[2024-05-21 16:20:38] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:20:39] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:20:40] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:20:41] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 20/289 constraints. Problems are: Problem set: 33 solved, 449 unsolved
[2024-05-21 16:20:42] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:20:42] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 4 ms to minimize.
[2024-05-21 16:20:42] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 97 places in 205 ms of which 6 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 4 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:20:43] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:20:44] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:20:45] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:20:45] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:20:45] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:20:45] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:20:45] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 20/309 constraints. Problems are: Problem set: 33 solved, 449 unsolved
[2024-05-21 16:20:46] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:20:46] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:20:47] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:20:48] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:20:49] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
Problem TDEAD416 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 20/329 constraints. Problems are: Problem set: 34 solved, 448 unsolved
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 4 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:20:51] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:20:52] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:20:53] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:20:53] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:20:53] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:20:53] [INFO ] Deduced a trap composed of 101 places in 209 ms of which 3 ms to minimize.
[2024-05-21 16:20:53] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:20:54] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 20/349 constraints. Problems are: Problem set: 34 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1033 variables, and 349 constraints, problems are : Problem set: 34 solved, 448 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/482 constraints, Known Traps: 243/243 constraints]
After SMT, in 60288ms problems are : Problem set: 34 solved, 448 unsolved
Search for dead transitions found 34 dead transitions in 60318ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 550/702 places, 449/627 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 548 transition count 449
Applied a total of 2 rules in 44 ms. Remains 548 /550 variables (removed 2) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 548 cols
[2024-05-21 16:20:54] [INFO ] Computed 111 invariants in 22 ms
[2024-05-21 16:20:55] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-21 16:20:55] [INFO ] Invariant cache hit.
[2024-05-21 16:20:55] [INFO ] Implicit Places using invariants and state equation in 629 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1035 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 547/702 places, 449/627 transitions.
Applied a total of 0 rules in 16 ms. Remains 547 /547 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63565 ms. Remains : 547/702 places, 449/627 transitions.
Support contains 42 out of 547 places after structural reductions.
[2024-05-21 16:20:55] [INFO ] Flatten gal took : 65 ms
[2024-05-21 16:20:55] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:20:55] [INFO ] Input system was already deterministic with 449 transitions.
RANDOM walk for 40000 steps (207 resets) in 1115 ms. (35 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40003 steps (37 resets) in 296 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (38 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (37 resets) in 227 ms. (175 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40003 steps (36 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (38 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (30 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
// Phase 1: matrix 449 rows 547 cols
[2024-05-21 16:20:56] [INFO ] Computed 110 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 154/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:20:57] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 239/407 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 14 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:20:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 128/535 variables, 45/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 3 ms to minimize.
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 101 places in 172 ms of which 4 ms to minimize.
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 4 ms to minimize.
[2024-05-21 16:20:59] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 4 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:21:00] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:21:01] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
SMT process timed out in 5061ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (complete) has 1143 edges and 547 vertex of which 546 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 546 transition count 385
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 483 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 481 transition count 383
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 131 place count 481 transition count 272
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 376 place count 347 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 384 place count 339 transition count 264
Iterating global reduction 3 with 8 rules applied. Total rules applied 392 place count 339 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 394 place count 339 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 395 place count 338 transition count 262
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 297 rules applied. Total rules applied 692 place count 185 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 693 place count 185 transition count 117
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 6 with 2 rules applied. Total rules applied 695 place count 184 transition count 120
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 703 place count 184 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 704 place count 183 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 705 place count 182 transition count 119
Applied a total of 705 rules in 91 ms. Remains 182 /547 variables (removed 365) and now considering 119/449 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 182/547 places, 119/449 transitions.
RANDOM walk for 40000 steps (3131 resets) in 580 ms. (68 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (1033 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1069 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1067 resets) in 169 ms. (235 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (1044 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1060 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
// Phase 1: matrix 119 rows 182 cols
[2024-05-21 16:21:02] [INFO ] Computed 77 invariants in 2 ms
[2024-05-21 16:21:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/82 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/84 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/110 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:21:02] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 117/227 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 74/301 variables, 72/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 33/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/301 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 182/182 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/82 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/84 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/110 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:21:02] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:21:02] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 117/227 variables, 110/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 74/301 variables, 72/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 33/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:21:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/301 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 276 constraints, problems are : Problem set: 0 solved, 4 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 182/182 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 4 properties in 115 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 489 stabilizing places and 400 stable transitions
Graph (complete) has 1143 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 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 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 371
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 138 place count 471 transition count 256
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 393 place count 331 transition count 256
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 404 place count 320 transition count 245
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 320 transition count 245
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 708 place count 169 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 710 place count 168 transition count 106
Applied a total of 710 rules in 70 ms. Remains 168 /547 variables (removed 379) and now considering 106/449 (removed 343) transitions.
// Phase 1: matrix 106 rows 168 cols
[2024-05-21 16:21:04] [INFO ] Computed 76 invariants in 1 ms
[2024-05-21 16:21:04] [INFO ] Implicit Places using invariants in 137 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 139 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/547 places, 106/449 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 140/547 places, 106/449 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 496 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((p1||(!p1 U p0)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (trivial) has 267 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 539 transition count 373
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 473 transition count 373
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 473 transition count 259
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 334 transition count 259
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 324 transition count 249
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 324 transition count 249
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 702 place count 172 transition count 106
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 704 place count 171 transition count 109
Applied a total of 704 rules in 53 ms. Remains 171 /547 variables (removed 376) and now considering 109/449 (removed 340) transitions.
// Phase 1: matrix 109 rows 171 cols
[2024-05-21 16:21:04] [INFO ] Computed 76 invariants in 1 ms
[2024-05-21 16:21:04] [INFO ] Implicit Places using invariants in 125 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 127 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/547 places, 109/449 transitions.
Applied a total of 0 rules in 10 ms. Remains 143 /143 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 143/547 places, 109/449 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 436
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 435
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 529 transition count 430
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 529 transition count 430
Applied a total of 37 rules in 122 ms. Remains 529 /547 variables (removed 18) and now considering 430/449 (removed 19) transitions.
// Phase 1: matrix 430 rows 529 cols
[2024-05-21 16:21:05] [INFO ] Computed 110 invariants in 6 ms
[2024-05-21 16:21:05] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 16:21:05] [INFO ] Invariant cache hit.
[2024-05-21 16:21:05] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-21 16:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/529 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:11] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:21:11] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:21:12] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:21:13] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:21:14] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:21:14] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:21:17] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:21:18] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:21:19] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:21:20] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 122 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:21] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:21:22] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:21:23] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:21:24] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:21:24] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:24] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:21:24] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:21:24] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:27] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:21:27] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:21:28] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 4 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:21:29] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:21:30] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:21:31] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:21:32] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
Problem TDEAD388 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/230 constraints. Problems are: Problem set: 1 solved, 428 unsolved
[2024-05-21 16:21:33] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:21:33] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:21:33] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:21:33] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:21:34] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:21:35] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
SMT process timed out in 30149ms, After SMT, problems are : Problem set: 1 solved, 428 unsolved
Search for dead transitions found 1 dead transitions in 30155ms
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 : 529/547 places, 429/449 transitions.
Applied a total of 0 rules in 15 ms. Remains 529 /529 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31000 ms. Remains : 529/547 places, 429/449 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-02 finished in 31217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X((p1 U X(p2))) U (p3&&X((p1 U X(p2))))))||p0))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 537 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 537 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 534 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 534 transition count 436
Applied a total of 26 rules in 72 ms. Remains 534 /547 variables (removed 13) and now considering 436/449 (removed 13) transitions.
// Phase 1: matrix 436 rows 534 cols
[2024-05-21 16:21:36] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:21:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 16:21:36] [INFO ] Invariant cache hit.
[2024-05-21 16:21:36] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-05-21 16:21:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-21 16:21:42] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:21:42] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:21:42] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:21:42] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:21:43] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 5 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:21:44] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:21:45] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:21:45] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-21 16:21:48] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:21:48] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:21:48] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:21:48] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:21:49] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:21:49] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:21:49] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:21:49] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:21:49] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:21:50] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:21:51] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:21:51] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:21:51] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-21 16:21:51] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:21:51] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 97 places in 228 ms of which 3 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:21:52] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:21:53] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-21 16:21:54] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:21:55] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
Problem TDEAD394 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 434 unsolved
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 7 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 98 places in 261 ms of which 7 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 97 places in 218 ms of which 4 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 434 unsolved
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 1 solved, 434 unsolved
Search for dead transitions found 1 dead transitions in 30145ms
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 : 534/547 places, 435/449 transitions.
Applied a total of 0 rules in 10 ms. Remains 534 /534 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30770 ms. Remains : 534/547 places, 435/449 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2415 steps with 12 reset in 17 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 31165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 533 transition count 434
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 528 transition count 429
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 528 transition count 429
Applied a total of 39 rules in 73 ms. Remains 528 /547 variables (removed 19) and now considering 429/449 (removed 20) transitions.
// Phase 1: matrix 429 rows 528 cols
[2024-05-21 16:22:07] [INFO ] Computed 110 invariants in 4 ms
[2024-05-21 16:22:07] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-21 16:22:07] [INFO ] Invariant cache hit.
[2024-05-21 16:22:08] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-05-21 16:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:22:14] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:22:14] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:15] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 117 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:16] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:22:20] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:22:20] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:22:20] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:22:21] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:22:22] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:23] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 3 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:24] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 4 ms to minimize.
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:22:25] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 3 ms to minimize.
[2024-05-21 16:22:26] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:27] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:22:28] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:22:28] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:22:28] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:22:28] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:28] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:22:31] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:22:31] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:22:32] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:22:33] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 8 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
Problem TDEAD387 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:34] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:22:35] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:22:36] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/230 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 114 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:22:37] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:22:38] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:22:38] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/957 variables, and 239 constraints, problems are : Problem set: 1 solved, 427 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/528 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 1 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 45/45 constraints. Problems are: Problem set: 1 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/110 constraints. Problems are: Problem set: 1 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 129/239 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:41] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:22:41] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:22:41] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:22:41] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:22:42] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:22:43] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/259 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:22:44] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:22:45] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:22:46] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/279 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:22:47] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 3 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:22:48] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:22:49] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/299 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 4 ms to minimize.
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:50] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:22:51] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:52] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:22:52] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:22:52] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:22:52] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:22:52] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/319 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:22:53] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:22:54] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:22:54] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:22:55] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:22:56] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:22:56] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:22:56] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:22:56] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:22:56] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/339 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:22:57] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:22:58] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:22:59] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 3 ms to minimize.
[2024-05-21 16:22:59] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:22:59] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:22:59] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:22:59] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 20/359 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:23:00] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:23:01] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:23:02] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:23:03] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 20/379 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:23:03] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:23:04] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:23:05] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:23:06] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:23:06] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:23:06] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:23:06] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 20/399 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:23:07] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:23:08] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:23:08] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
SMT process timed out in 60152ms, After SMT, problems are : Problem set: 1 solved, 427 unsolved
Search for dead transitions found 1 dead transitions in 60158ms
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 : 528/547 places, 428/449 transitions.
Applied a total of 0 rules in 21 ms. Remains 528 /528 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61034 ms. Remains : 528/547 places, 428/449 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 61142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 535 transition count 437
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 535 transition count 437
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 535 transition count 436
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 530 transition count 431
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 530 transition count 431
Applied a total of 35 rules in 24 ms. Remains 530 /547 variables (removed 17) and now considering 431/449 (removed 18) transitions.
// Phase 1: matrix 431 rows 530 cols
[2024-05-21 16:23:08] [INFO ] Computed 110 invariants in 5 ms
[2024-05-21 16:23:08] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-21 16:23:08] [INFO ] Invariant cache hit.
[2024-05-21 16:23:09] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-21 16:23:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:23:15] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:23:15] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:23:15] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:23:15] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:23:16] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:23:17] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:23:21] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 118 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 3 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:23:22] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:23:23] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:24] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:23:25] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:23:25] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:23:25] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:23:25] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 5 ms to minimize.
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
Problem TDEAD389 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/170 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:23:26] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:23:27] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:23:28] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:23:29] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:23:29] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:23:29] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:23:32] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:23:32] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:23:32] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:23:33] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:23:34] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:23:35] [INFO ] Deduced a trap composed of 122 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 2 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:23:36] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:23:37] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:23:38] [INFO ] Deduced a trap composed of 121 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:23:38] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 20/230 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:23:38] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:23:38] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:23:39] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:23:39] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:23:39] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 1 solved, 429 unsolved
Search for dead transitions found 1 dead transitions in 30127ms
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 : 530/547 places, 430/449 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30862 ms. Remains : 530/547 places, 430/449 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 528 reset in 251 ms.
Product exploration explored 100000 steps with 533 reset in 331 ms.
Computed a total of 475 stabilizing places and 385 stable transitions
Graph (complete) has 1119 edges and 530 vertex of which 529 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 475 stabilizing places and 385 stable transitions
Detected a total of 475/530 stabilizing places and 385/430 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 333 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (201 resets) in 483 ms. (82 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 123 ms. (322 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (34 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (38 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
// Phase 1: matrix 430 rows 530 cols
[2024-05-21 16:23:41] [INFO ] Computed 111 invariants in 2 ms
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) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 333/391 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-21 16:23:41] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/518 variables, 46/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 422/940 variables, 518/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/957 variables, 9/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/957 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/957 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/960 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/960 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/960 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 960/960 variables, and 653 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 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) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 333/391 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:23:42] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:23:43] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:23:43] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:23:43] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:23:43] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:23:43] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/518 variables, 46/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 422/940 variables, 518/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 17/957 variables, 9/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/957 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/957 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/960 variables, 3/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/960 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/960 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 960/960 variables, and 668 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 2395ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 868 ms.
Support contains 3 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 430/430 transitions.
Graph (trivial) has 250 edges and 530 vertex of which 6 / 530 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 1104 edges and 525 vertex of which 524 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 524 transition count 362
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 464 transition count 362
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 464 transition count 249
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 326 transition count 249
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 674 place count 170 transition count 104
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 676 place count 169 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 677 place count 169 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 678 place count 168 transition count 106
Applied a total of 678 rules in 43 ms. Remains 168 /530 variables (removed 362) and now considering 106/430 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 168/530 places, 106/430 transitions.
RANDOM walk for 40000 steps (2084 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (552 resets) in 92 ms. (430 steps per ms) remains 1/2 properties
// Phase 1: matrix 106 rows 168 cols
[2024-05-21 16:23:44] [INFO ] Computed 75 invariants in 1 ms
[2024-05-21 16:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/155 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:23:44] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/164 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/270 variables, 164/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/274 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 168/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/155 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/164 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/270 variables, 164/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/274 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 253 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 168/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 168/168 places, 106/106 transitions.
RANDOM walk for 40000 steps (2014 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (569 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127222 steps, run visited all 1 properties in 387 ms. (steps per millisecond=328 )
Probabilistic random walk after 127222 steps, saw 33385 distinct states, run finished after 390 ms. (steps per millisecond=326 ) properties seen :1
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 15 factoid took 824 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 430/430 transitions.
Graph (trivial) has 250 edges and 530 vertex of which 6 / 530 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 1112 edges and 525 vertex of which 524 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 523 transition count 362
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 463 transition count 362
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 463 transition count 249
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 325 transition count 249
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 672 place count 170 transition count 105
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 674 place count 169 transition count 108
Applied a total of 674 rules in 51 ms. Remains 169 /530 variables (removed 361) and now considering 108/430 (removed 322) transitions.
// Phase 1: matrix 108 rows 169 cols
[2024-05-21 16:23:46] [INFO ] Computed 75 invariants in 2 ms
[2024-05-21 16:23:46] [INFO ] Implicit Places using invariants in 124 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 26, 27, 28, 29, 30, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 126 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/530 places, 108/430 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 142/530 places, 108/430 transitions.
Computed a total of 119 stabilizing places and 90 stable transitions
Computed a total of 119 stabilizing places and 90 stable transitions
Detected a total of 119/142 stabilizing places and 90/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 373 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5262 resets) in 660 ms. (60 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (1436 resets) in 60 ms. (655 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (1851 resets) in 56 ms. (701 steps per ms) remains 1/2 properties
// Phase 1: matrix 108 rows 142 cols
[2024-05-21 16:23:47] [INFO ] Computed 48 invariants in 0 ms
[2024-05-21 16:23:47] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 118/129 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:23:47] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/138 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 107/245 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/249 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 118/129 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/138 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 107/245 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/249 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 108/108 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 142 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 142 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 141 transition count 106
Applied a total of 3 rules in 19 ms. Remains 141 /142 variables (removed 1) and now considering 106/108 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 141/142 places, 106/108 transitions.
RANDOM walk for 40000 steps (2020 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (556 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127222 steps, run visited all 1 properties in 278 ms. (steps per millisecond=457 )
Probabilistic random walk after 127222 steps, saw 33385 distinct states, run finished after 278 ms. (steps per millisecond=457 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 1163 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11125 reset in 266 ms.
Product exploration explored 100000 steps with 11220 reset in 244 ms.
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 16:23:50] [INFO ] Invariant cache hit.
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 16:23:51] [INFO ] Invariant cache hit.
[2024-05-21 16:23:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [3, 14, 43, 45, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 130]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 304 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/142 places, 108/108 transitions.
Graph (complete) has 286 edges and 116 vertex of which 107 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 (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 107 transition count 89
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 92 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 88 transition count 84
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 88 transition count 84
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 88 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 45 place count 85 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 49 place count 81 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 81 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 81 transition count 76
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 5 with 16 rules applied. Total rules applied 70 place count 72 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 71 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 71 transition count 67
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 71 transition count 67
Applied a total of 75 rules in 19 ms. Remains 71 /116 variables (removed 45) and now considering 67/108 (removed 41) transitions.
// Phase 1: matrix 67 rows 71 cols
[2024-05-21 16:23:51] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants in 50 ms returned [65, 70]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/142 places, 67/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 67 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 67 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 66 transition count 64
Applied a total of 6 rules in 7 ms. Remains 66 /69 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 66 cols
[2024-05-21 16:23:51] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 16:23:51] [INFO ] Invariant cache hit.
[2024-05-21 16:23:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 65/142 places, 64/108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 63
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 64 cols
[2024-05-21 16:23:51] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 16:23:51] [INFO ] Invariant cache hit.
[2024-05-21 16:23:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 64/142 places, 63/108 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 625 ms. Remains : 64/142 places, 63/108 transitions.
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 43257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)&&F(p2)) U X(!p2)))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 436
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 435
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 530 transition count 431
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 530 transition count 431
Applied a total of 35 rules in 31 ms. Remains 530 /547 variables (removed 17) and now considering 431/449 (removed 18) transitions.
// Phase 1: matrix 431 rows 530 cols
[2024-05-21 16:23:51] [INFO ] Computed 110 invariants in 4 ms
[2024-05-21 16:23:51] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 16:23:51] [INFO ] Invariant cache hit.
[2024-05-21 16:23:52] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-21 16:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:23:58] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:23:58] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:23:58] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:23:58] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:23:58] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:23:59] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:00] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:24:04] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:24:05] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:24:06] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:24:06] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:24:06] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:24:06] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:24:06] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
Problem TDEAD389 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/150 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:24:07] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:24:08] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:24:09] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/170 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:24:10] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:24:10] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:10] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:24:10] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:24:10] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:11] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:24:12] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:24:13] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:24:13] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:24:16] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:24:16] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:24:16] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:24:17] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:24:18] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:24:19] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 2 ms to minimize.
[2024-05-21 16:24:19] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:24:19] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:24:19] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 429 unsolved
[2024-05-21 16:24:20] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:24:20] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:24:20] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:24:20] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:24:20] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 3 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:24:21] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:24:22] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:24:22] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:24:22] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 2 ms to minimize.
SMT process timed out in 30137ms, After SMT, problems are : Problem set: 1 solved, 429 unsolved
Search for dead transitions found 1 dead transitions in 30141ms
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 : 530/547 places, 430/449 transitions.
Applied a total of 0 rules in 12 ms. Remains 530 /530 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30850 ms. Remains : 530/547 places, 430/449 transitions.
Stuttering acceptance computed with spot in 283 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-07 finished in 31162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 436
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 435
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 529 transition count 430
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 529 transition count 430
Applied a total of 37 rules in 65 ms. Remains 529 /547 variables (removed 18) and now considering 430/449 (removed 19) transitions.
// Phase 1: matrix 430 rows 529 cols
[2024-05-21 16:24:22] [INFO ] Computed 110 invariants in 6 ms
[2024-05-21 16:24:23] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 16:24:23] [INFO ] Invariant cache hit.
[2024-05-21 16:24:23] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-21 16:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/529 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:24:30] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:24:31] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:24:32] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:24:36] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:24:37] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:24:38] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:24:39] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:24:40] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:24:41] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:42] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:24:43] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:24:44] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:24:45] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:48] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:24:48] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:24:48] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:24:48] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:24:49] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:24:50] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:24:50] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:24:50] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:24:51] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-21 16:24:52] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:24:52] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:24:52] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:24:52] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:24:52] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:24:53] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 529/547 places, 430/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31108 ms. Remains : 529/547 places, 430/449 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Computed a total of 474 stabilizing places and 385 stable transitions
Graph (complete) has 1118 edges and 529 vertex of which 528 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 474 stabilizing places and 385 stable transitions
Detected a total of 474/529 stabilizing places and 385/430 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 31843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 371
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 471 transition count 257
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 332 transition count 257
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 321 transition count 246
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 321 transition count 246
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 708 place count 169 transition count 103
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 710 place count 168 transition count 106
Applied a total of 710 rules in 59 ms. Remains 168 /547 variables (removed 379) and now considering 106/449 (removed 343) transitions.
// Phase 1: matrix 106 rows 168 cols
[2024-05-21 16:24:54] [INFO ] Computed 76 invariants in 1 ms
[2024-05-21 16:24:54] [INFO ] Implicit Places using invariants in 134 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 139 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/547 places, 106/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 140/547 places, 106/449 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 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' '!(X((F(G(!p0)) U (p1 U p2))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 436
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 435
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 531 transition count 432
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 531 transition count 432
Applied a total of 33 rules in 38 ms. Remains 531 /547 variables (removed 16) and now considering 432/449 (removed 17) transitions.
// Phase 1: matrix 432 rows 531 cols
[2024-05-21 16:24:54] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:24:55] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 16:24:55] [INFO ] Invariant cache hit.
[2024-05-21 16:24:55] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 16:24:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 16:25:01] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:25:01] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:25:02] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:25:03] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:25:04] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:25:04] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:25:04] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:25:04] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:25:04] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:25:08] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:25:09] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:25:09] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:25:09] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:25:09] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:25:09] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:25:10] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:25:10] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:25:10] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:25:10] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:25:10] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:25:11] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:25:11] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
Problem TDEAD390 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/150 constraints. Problems are: Problem set: 1 solved, 430 unsolved
[2024-05-21 16:25:11] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:25:11] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:25:11] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:25:12] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:25:13] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:25:13] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:25:13] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:25:13] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:25:14] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:25:14] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:25:14] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:25:14] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:25:14] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/170 constraints. Problems are: Problem set: 1 solved, 430 unsolved
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:25:15] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:25:16] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:25:17] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:18] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:25:18] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 430 unsolved
[2024-05-21 16:25:21] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:25:22] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:25:23] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:25:24] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 430 unsolved
[2024-05-21 16:25:25] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:25:25] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:25:25] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:25:25] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:25:25] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 30086ms, After SMT, problems are : Problem set: 1 solved, 430 unsolved
Search for dead transitions found 1 dead transitions in 30092ms
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 : 531/547 places, 431/449 transitions.
Applied a total of 0 rules in 11 ms. Remains 531 /531 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30842 ms. Remains : 531/547 places, 431/449 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 537 reset in 312 ms.
Product exploration explored 100000 steps with 534 reset in 338 ms.
Computed a total of 475 stabilizing places and 385 stable transitions
Graph (complete) has 1118 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 475 stabilizing places and 385 stable transitions
Detected a total of 475/531 stabilizing places and 385/431 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 339 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (208 resets) in 319 ms. (125 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (35 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 382 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (36 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (37 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
// Phase 1: matrix 431 rows 531 cols
[2024-05-21 16:25:27] [INFO ] Computed 111 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/146 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/393 variables, 61/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 16:25:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:25:28] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:25:29] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/85 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:25:30] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:25:31] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:25:32] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 5129ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 431/431 transitions.
Graph (trivial) has 249 edges and 531 vertex of which 6 / 531 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 1111 edges and 526 vertex of which 525 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 525 transition count 364
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 466 transition count 364
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 120 place count 466 transition count 252
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 368 place count 330 transition count 252
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 673 place count 172 transition count 105
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 675 place count 171 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 676 place count 171 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 677 place count 170 transition count 107
Applied a total of 677 rules in 33 ms. Remains 170 /531 variables (removed 361) and now considering 107/431 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 170/531 places, 107/431 transitions.
RANDOM walk for 332 steps (9 resets) in 6 ms. (47 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 13 factoid took 1026 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2024-05-21 16:25:34] [INFO ] Invariant cache hit.
[2024-05-21 16:25:35] [INFO ] [Real]Absence check using 65 positive place invariants in 33 ms returned sat
[2024-05-21 16:25:35] [INFO ] [Real]Absence check using 65 positive and 46 generalized place invariants in 33 ms returned sat
[2024-05-21 16:25:36] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2024-05-21 16:25:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:25:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2024-05-21 16:25:36] [INFO ] [Nat]Absence check using 65 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-21 16:25:36] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-21 16:25:36] [INFO ] Computed and/alt/rep : 429/749/429 causal constraints (skipped 1 transitions) in 30 ms.
[2024-05-21 16:25:39] [INFO ] Added : 326 causal constraints over 66 iterations in 2984 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 431/431 transitions.
Graph (trivial) has 247 edges and 531 vertex of which 4 / 531 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1115 edges and 528 vertex of which 527 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 526 transition count 367
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 467 transition count 367
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 120 place count 467 transition count 255
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 368 place count 331 transition count 255
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 303 rules applied. Total rules applied 671 place count 174 transition count 109
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 673 place count 173 transition count 112
Applied a total of 673 rules in 37 ms. Remains 173 /531 variables (removed 358) and now considering 112/431 (removed 319) transitions.
// Phase 1: matrix 112 rows 173 cols
[2024-05-21 16:25:39] [INFO ] Computed 76 invariants in 2 ms
[2024-05-21 16:25:39] [INFO ] Implicit Places using invariants in 136 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 143 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/531 places, 112/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 145/531 places, 112/431 transitions.
Computed a total of 121 stabilizing places and 92 stable transitions
Computed a total of 121 stabilizing places and 92 stable transitions
Detected a total of 121/145 stabilizing places and 92/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 16 factoid took 819 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (3577 resets) in 773 ms. (51 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40000 steps (1189 resets) in 246 ms. (161 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (1236 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1251 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1229 resets) in 318 ms. (125 steps per ms) remains 4/4 properties
// Phase 1: matrix 112 rows 145 cols
[2024-05-21 16:25:41] [INFO ] Computed 48 invariants in 1 ms
[2024-05-21 16:25:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/52 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/130 variables, 37/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-21 16:25:41] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/141 variables, 8/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/252 variables, 141/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 4/194 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/256 variables, 4/198 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/257 variables, and 198 constraints, problems are : Problem set: 3 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/130 variables, 37/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-21 16:25:41] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:25:41] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:25:42] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 8/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/141 variables, 8/57 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/57 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/252 variables, 141/198 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 4/202 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/256 variables, 4/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/256 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/257 variables, and 207 constraints, problems are : Problem set: 3 solved, 1 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 775ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 19 factoid took 1323 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2024-05-21 16:25:44] [INFO ] Invariant cache hit.
[2024-05-21 16:25:44] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2024-05-21 16:25:44] [INFO ] [Real]Absence check using 40 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-21 16:25:44] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-21 16:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:25:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2024-05-21 16:25:44] [INFO ] [Nat]Absence check using 40 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 16:25:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 16:25:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:25:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-21 16:25:45] [INFO ] Computed and/alt/rep : 99/290/99 causal constraints (skipped 8 transitions) in 8 ms.
[2024-05-21 16:25:45] [INFO ] Added : 4 causal constraints over 1 iterations in 31 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-12 finished in 50525 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((F(G(p0))&&G(p1))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 541 vertex of which 540 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 539 transition count 372
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 472 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 471 transition count 371
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 138 place count 471 transition count 256
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 393 place count 331 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 319 transition count 244
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 319 transition count 244
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 287 rules applied. Total rules applied 704 place count 171 transition count 105
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 706 place count 170 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 707 place count 169 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 708 place count 168 transition count 107
Applied a total of 708 rules in 65 ms. Remains 168 /547 variables (removed 379) and now considering 107/449 (removed 342) transitions.
// Phase 1: matrix 107 rows 168 cols
[2024-05-21 16:25:45] [INFO ] Computed 75 invariants in 3 ms
[2024-05-21 16:25:45] [INFO ] Implicit Places using invariants in 147 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 148 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/547 places, 107/449 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 157/547 places, 107/449 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(p2)||p1)))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 533 transition count 434
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 528 transition count 429
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 528 transition count 429
Applied a total of 39 rules in 41 ms. Remains 528 /547 variables (removed 19) and now considering 429/449 (removed 20) transitions.
// Phase 1: matrix 429 rows 528 cols
[2024-05-21 16:25:45] [INFO ] Computed 110 invariants in 4 ms
[2024-05-21 16:25:46] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 16:25:46] [INFO ] Invariant cache hit.
[2024-05-21 16:25:46] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-05-21 16:25:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:25:52] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:53] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:25:54] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:25:55] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:25:55] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:25:55] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:25:55] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:25:55] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:25:58] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:25:59] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 8 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:26:00] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:26:01] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:26:02] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:26:03] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:26:04] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:26:04] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:26:04] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:26:04] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:26:04] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:26:05] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:26:06] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:26:07] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:26:11] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:26:12] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:26:13] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
Problem TDEAD387 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 427 unsolved
[2024-05-21 16:26:14] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:26:14] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:26:14] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:26:14] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:26:14] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:26:15] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:26:16] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 2 ms to minimize.
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 1 solved, 427 unsolved
Search for dead transitions found 1 dead transitions in 30109ms
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 : 528/547 places, 428/449 transitions.
Applied a total of 0 rules in 13 ms. Remains 528 /528 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31017 ms. Remains : 528/547 places, 428/449 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 473 stabilizing places and 383 stable transitions
Graph (complete) has 1115 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 473 stabilizing places and 383 stable transitions
Detected a total of 473/528 stabilizing places and 383/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 30 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 31733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (complete) has 1143 edges and 547 vertex of which 546 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 545 transition count 383
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 481 transition count 380
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 478 transition count 380
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 135 place count 478 transition count 262
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 396 place count 335 transition count 262
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 409 place count 322 transition count 249
Iterating global reduction 3 with 13 rules applied. Total rules applied 422 place count 322 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 424 place count 322 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 321 transition count 247
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 5 with 289 rules applied. Total rules applied 714 place count 172 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 715 place count 172 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 717 place count 171 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 718 place count 170 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 719 place count 169 transition count 108
Applied a total of 719 rules in 65 ms. Remains 169 /547 variables (removed 378) and now considering 108/449 (removed 341) transitions.
// Phase 1: matrix 108 rows 169 cols
[2024-05-21 16:26:17] [INFO ] Computed 75 invariants in 2 ms
[2024-05-21 16:26:17] [INFO ] Implicit Places using invariants in 153 ms returned [29, 30, 31, 32, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 155 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/547 places, 108/449 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 155/547 places, 108/449 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-18-LTLFireability-06
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 547/547 places, 449/449 transitions.
Graph (trivial) has 268 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 371
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 138 place count 471 transition count 258
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 389 place count 333 transition count 258
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 323 transition count 248
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 323 transition count 248
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 702 place count 172 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 704 place count 171 transition count 109
Applied a total of 704 rules in 51 ms. Remains 171 /547 variables (removed 376) and now considering 109/449 (removed 340) transitions.
// Phase 1: matrix 109 rows 171 cols
[2024-05-21 16:26:18] [INFO ] Computed 76 invariants in 2 ms
[2024-05-21 16:26:18] [INFO ] Implicit Places using invariants in 184 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 28, 29, 30, 31, 32, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 185 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 144/547 places, 109/449 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 239 ms. Remains : 144/547 places, 109/449 transitions.
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 11184 reset in 222 ms.
Product exploration explored 100000 steps with 11202 reset in 249 ms.
Computed a total of 121 stabilizing places and 91 stable transitions
Computed a total of 121 stabilizing places and 91 stable transitions
Detected a total of 121/144 stabilizing places and 91/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 662 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5185 resets) in 572 ms. (69 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (1475 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1840 resets) in 101 ms. (392 steps per ms) remains 1/2 properties
// Phase 1: matrix 109 rows 144 cols
[2024-05-21 16:26:20] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 16:26:20] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:26:20] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:26:20] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:26:20] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:26:20] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/140 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/248 variables, 140/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/252 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/253 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/140 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/248 variables, 140/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/252 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/253 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 109/109 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 144 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 144 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 143 transition count 107
Applied a total of 3 rules in 10 ms. Remains 143 /144 variables (removed 1) and now considering 107/109 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 143/144 places, 107/109 transitions.
RANDOM walk for 40000 steps (2027 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (632 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 111687 steps, run visited all 1 properties in 245 ms. (steps per millisecond=455 )
Probabilistic random walk after 111687 steps, saw 29286 distinct states, run finished after 246 ms. (steps per millisecond=454 ) properties seen :1
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 14 factoid took 1057 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 16:26:22] [INFO ] Invariant cache hit.
[2024-05-21 16:26:22] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 16:26:22] [INFO ] Invariant cache hit.
[2024-05-21 16:26:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:26:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [3, 13, 16, 45, 47, 51, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 128, 132]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 309 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/144 places, 109/109 transitions.
Graph (complete) has 299 edges and 117 vertex of which 108 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 (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 108 transition count 92
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 95 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 91 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 91 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 91 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 88 transition count 84
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 45 place count 84 transition count 80
Iterating global reduction 4 with 4 rules applied. Total rules applied 49 place count 84 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 84 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 60 place count 79 transition count 74
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 79 transition count 74
Applied a total of 62 rules in 11 ms. Remains 79 /117 variables (removed 38) and now considering 74/109 (removed 35) transitions.
// Phase 1: matrix 74 rows 79 cols
[2024-05-21 16:26:23] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 16:26:23] [INFO ] Implicit Places using invariants in 60 ms returned [69, 75, 78]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/144 places, 74/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 72
Applied a total of 4 rules in 4 ms. Remains 74 /76 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 74 cols
[2024-05-21 16:26:23] [INFO ] Computed 14 invariants in 0 ms
[2024-05-21 16:26:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 16:26:23] [INFO ] Invariant cache hit.
[2024-05-21 16:26:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:26:23] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 74/144 places, 72/109 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 534 ms. Remains : 74/144 places, 72/109 transitions.
Computed a total of 51 stabilizing places and 54 stable transitions
Graph (complete) has 227 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 51 stabilizing places and 54 stable transitions
Detected a total of 51/74 stabilizing places and 54/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 646 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5166 resets) in 493 ms. (80 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (1493 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1797 resets) in 105 ms. (377 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 104 ms. (380 steps per ms) remains 1/2 properties
[2024-05-21 16:26:24] [INFO ] Invariant cache hit.
[2024-05-21 16:26:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/31 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/73 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/126 variables, 33/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/135 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/142 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/142 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/145 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/31 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/73 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/126 variables, 33/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:26:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/135 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/142 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/145 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 72/72 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 74 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 74 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 73 transition count 70
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 73 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 70 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 70 transition count 66
Applied a total of 10 rules in 8 ms. Remains 70 /74 variables (removed 4) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 70/74 places, 66/72 transitions.
RANDOM walk for 40000 steps (2672 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (730 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110242 steps, run visited all 1 properties in 175 ms. (steps per millisecond=629 )
Probabilistic random walk after 110242 steps, saw 30831 distinct states, run finished after 176 ms. (steps per millisecond=626 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 1139 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11217 reset in 185 ms.
Product exploration explored 100000 steps with 11268 reset in 168 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-21 16:26:27] [INFO ] Invariant cache hit.
[2024-05-21 16:26:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 16:26:27] [INFO ] Invariant cache hit.
[2024-05-21 16:26:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:26:27] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 16:26:27] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 16:26:27] [INFO ] Invariant cache hit.
[2024-05-21 16:26:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:26:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 6 (OVERLAPS) 71/145 variables, 74/101 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/104 constraints. Problems are: Problem set: 2 solved, 66 unsolved
[2024-05-21 16:26:28] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 66 unsolved
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 4/110 constraints. Problems are: Problem set: 2 solved, 66 unsolved
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:26:29] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 2/112 constraints. Problems are: Problem set: 2 solved, 66 unsolved
[2024-05-21 16:26:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:26:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 2/114 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 114 constraints, problems are : Problem set: 2 solved, 66 unsolved in 3606 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 2 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 13/29 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/37 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 71/145 variables, 74/111 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/114 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 66/180 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 180 constraints, problems are : Problem set: 2 solved, 66 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/68 constraints, Known Traps: 23/23 constraints]
After SMT, in 5369ms problems are : Problem set: 2 solved, 66 unsolved
Search for dead transitions found 2 dead transitions in 5370ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 70/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 68
Applied a total of 4 rules in 8 ms. Remains 72 /74 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 72 cols
[2024-05-21 16:26:32] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 16:26:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 16:26:32] [INFO ] Invariant cache hit.
[2024-05-21 16:26:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:26:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [34, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/74 places, 68/72 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 62 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 60 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 60 transition count 58
Applied a total of 20 rules in 8 ms. Remains 60 /70 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 60 cols
[2024-05-21 16:26:32] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 16:26:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 16:26:32] [INFO ] Invariant cache hit.
[2024-05-21 16:26:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:26:32] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 60/74 places, 58/72 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5849 ms. Remains : 60/74 places, 58/72 transitions.
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 15162 ms.
[2024-05-21 16:26:33] [INFO ] Flatten gal took : 31 ms
[2024-05-21 16:26:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 16:26:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 547 places, 449 transitions and 1321 arcs took 7 ms.
Total runtime 401544 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BusinessProcesses-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 547
TRANSITIONS: 449
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.001s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 6365
MODEL NAME: /home/mcc/execution/415/model
547 places, 449 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-18-LTLFireability-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716310679134
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-18"
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-18, 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-171620398500588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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 '
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 ;