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.r472-tajo-171620399600476.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 ltsminxred
Input is BusinessProcesses-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 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 79K 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-04-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225081819

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:58:03] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 06:58:03] [INFO ] Transformed 288 places.
[2024-06-01 06:58:03] [INFO ] Transformed 283 transitions.
[2024-06-01 06:58:03] [INFO ] Found NUPN structural information;
[2024-06-01 06:58:03] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 245 transition count 243
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 245 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 245 transition count 242
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 95 place count 230 transition count 227
Iterating global reduction 2 with 15 rules applied. Total rules applied 110 place count 230 transition count 227
Applied a total of 110 rules in 58 ms. Remains 230 /286 variables (removed 56) and now considering 227/281 (removed 54) transitions.
// Phase 1: matrix 227 rows 230 cols
[2024-06-01 06:58:03] [INFO ] Computed 41 invariants in 29 ms
[2024-06-01 06:58:04] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 06:58:04] [INFO ] Invariant cache hit.
[2024-06-01 06:58:04] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-01 06:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 40 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 20/61 constraints. Problems are: Problem set: 1 solved, 225 unsolved
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 5 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 10 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 20/81 constraints. Problems are: Problem set: 1 solved, 225 unsolved
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 3 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 8 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 20/101 constraints. Problems are: Problem set: 25 solved, 201 unsolved
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 3 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 20/121 constraints. Problems are: Problem set: 27 solved, 199 unsolved
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 5 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 20/141 constraints. Problems are: Problem set: 38 solved, 188 unsolved
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 5 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
Problem TDEAD189 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 20/161 constraints. Problems are: Problem set: 39 solved, 187 unsolved
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 14 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 20/181 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 3/184 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 13/197 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 8/205 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/457 variables, and 206 constraints, problems are : Problem set: 40 solved, 186 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 165/165 constraints]
Escalating to Integer solving :Problem set: 40 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 18/18 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/18 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 20/38 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 3/41 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 165/206 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 5/211 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 5/216 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 3/219 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:41] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 2/221 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 2/223 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/224 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 2/226 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 2/228 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/229 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/229 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 15 (OVERLAPS) 227/457 variables, 230/459 constraints. Problems are: Problem set: 40 solved, 186 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 186/645 constraints. Problems are: Problem set: 40 solved, 186 unsolved
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 647 constraints, problems are : Problem set: 40 solved, 186 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 186/226 constraints, Known Traps: 190/190 constraints]
After SMT, in 60152ms problems are : Problem set: 40 solved, 186 unsolved
Search for dead transitions found 40 dead transitions in 60173ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 230/286 places, 187/281 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 227 transition count 187
Applied a total of 3 rules in 7 ms. Remains 227 /230 variables (removed 3) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 227 cols
[2024-06-01 06:59:04] [INFO ] Computed 49 invariants in 17 ms
[2024-06-01 06:59:04] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 06:59:04] [INFO ] Invariant cache hit.
[2024-06-01 06:59:04] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/286 places, 187/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61157 ms. Remains : 227/286 places, 187/281 transitions.
Support contains 51 out of 227 places after structural reductions.
[2024-06-01 06:59:05] [INFO ] Flatten gal took : 67 ms
[2024-06-01 06:59:05] [INFO ] Flatten gal took : 51 ms
[2024-06-01 06:59:05] [INFO ] Input system was already deterministic with 187 transitions.
Support contains 50 out of 227 places (down from 51) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (427 resets) in 1539 ms. (25 steps per ms) remains 8/38 properties
BEST_FIRST walk for 40003 steps (89 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (97 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (96 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (94 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
[2024-06-01 06:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 87/102 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 45/147 variables, 11/19 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 18 places in 834 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 17 places in 753 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 2/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 7 (OVERLAPS) 70/217 variables, 30/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 180/397 variables, 217/268 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/268 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/408 variables, 6/274 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/274 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/414 variables, 4/278 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 0/278 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/414 variables, 0/278 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 278 constraints, problems are : Problem set: 7 solved, 1 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/143 variables, 17/18 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/20 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/20 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 217/414 variables, and 51 constraints, problems are : Problem set: 8 solved, 0 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 2020ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 204 stabilizing places and 165 stable transitions
Graph (complete) has 473 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA BusinessProcesses-PT-04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 217 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 217 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 215 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 215 transition count 177
Applied a total of 22 rules in 28 ms. Remains 215 /227 variables (removed 12) and now considering 177/187 (removed 10) transitions.
// Phase 1: matrix 177 rows 215 cols
[2024-06-01 06:59:09] [INFO ] Computed 47 invariants in 2 ms
[2024-06-01 06:59:09] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 06:59:09] [INFO ] Invariant cache hit.
[2024-06-01 06:59:09] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 06:59:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 3 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 3 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 177/392 variables, 215/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 13/343 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/392 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/392 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/392 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 22 (OVERLAPS) 0/392 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 348 constraints, problems are : Problem set: 0 solved, 176 unsolved in 25289 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 86/133 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 177/392 variables, 215/352 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 176/528 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:38] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 536 constraints, problems are : Problem set: 0 solved, 176 unsolved in 27767 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 98/98 constraints]
After SMT, in 53097ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 53102ms
Starting structural reductions in LTL mode, iteration 1 : 215/227 places, 177/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53725 ms. Remains : 215/227 places, 177/187 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 192 stabilizing places and 155 stable transitions
Graph (complete) has 453 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 192 stabilizing places and 155 stable transitions
Detected a total of 192/215 stabilizing places and 155/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLFireability-00 finished in 54644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X((G((F(p1) U (p1||X(p2)))) U (p0&&G((F(p1) U (p1||X(p2)))))))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 218 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 218 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 217 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 217 transition count 178
Applied a total of 19 rules in 33 ms. Remains 217 /227 variables (removed 10) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 217 cols
[2024-06-01 07:00:03] [INFO ] Computed 48 invariants in 3 ms
[2024-06-01 07:00:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 07:00:04] [INFO ] Invariant cache hit.
[2024-06-01 07:00:04] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-01 07:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (OVERLAPS) 178/395 variables, 217/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 19 (OVERLAPS) 0/395 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 343 constraints, problems are : Problem set: 0 solved, 177 unsolved in 20619 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 78/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/395 variables, 217/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 177/531 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/395 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 533 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19993 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 91/91 constraints]
After SMT, in 40654ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 40668ms
Starting structural reductions in LTL mode, iteration 1 : 217/227 places, 178/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41189 ms. Remains : 217/227 places, 178/187 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-01 finished in 41602 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||X(p1)))))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 217 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 217 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 216 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 216 transition count 178
Applied a total of 20 rules in 16 ms. Remains 216 /227 variables (removed 11) and now considering 178/187 (removed 9) transitions.
// Phase 1: matrix 178 rows 216 cols
[2024-06-01 07:00:45] [INFO ] Computed 47 invariants in 2 ms
[2024-06-01 07:00:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:00:45] [INFO ] Invariant cache hit.
[2024-06-01 07:00:46] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-01 07:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 8/94 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:54] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:54] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:55] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 178/394 variables, 216/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/394 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 21 (OVERLAPS) 0/394 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 365 constraints, problems are : Problem set: 0 solved, 177 unsolved in 25835 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/394 variables, 216/365 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 177/542 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 542 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16243 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 102/102 constraints]
After SMT, in 42121ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 42125ms
Starting structural reductions in LTL mode, iteration 1 : 216/227 places, 178/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42735 ms. Remains : 216/227 places, 178/187 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-02
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-02 finished in 42852 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 U p1)||X((!p0&&F((!p0&&X(p2)))))))'
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 217 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 217 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 215 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 215 transition count 177
Applied a total of 22 rules in 20 ms. Remains 215 /227 variables (removed 12) and now considering 177/187 (removed 10) transitions.
// Phase 1: matrix 177 rows 215 cols
[2024-06-01 07:01:28] [INFO ] Computed 47 invariants in 1 ms
[2024-06-01 07:01:28] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 07:01:28] [INFO ] Invariant cache hit.
[2024-06-01 07:01:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:01:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 3 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 17/84 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 0 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 17 (OVERLAPS) 177/392 variables, 215/351 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/392 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/392 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 25 (OVERLAPS) 0/392 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 364 constraints, problems are : Problem set: 0 solved, 176 unsolved in 28624 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 177/392 variables, 215/370 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 176/546 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 547 constraints, problems are : Problem set: 0 solved, 176 unsolved in 21313 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 109/109 constraints]
After SMT, in 50002ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 50004ms
Starting structural reductions in LTL mode, iteration 1 : 215/227 places, 177/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50413 ms. Remains : 215/227 places, 177/187 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (OR (NOT p2) p0), (OR (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 3668 reset in 150 ms.
Stack based approach found an accepted trace after 233 steps with 10 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-05 finished in 50841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 217 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 217 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 215 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 215 transition count 177
Applied a total of 22 rules in 8 ms. Remains 215 /227 variables (removed 12) and now considering 177/187 (removed 10) transitions.
// Phase 1: matrix 177 rows 215 cols
[2024-06-01 07:02:19] [INFO ] Computed 47 invariants in 2 ms
[2024-06-01 07:02:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 07:02:19] [INFO ] Invariant cache hit.
[2024-06-01 07:02:19] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (OVERLAPS) 177/392 variables, 215/345 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/392 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 18 (OVERLAPS) 0/392 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 353 constraints, problems are : Problem set: 0 solved, 176 unsolved in 23808 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 91/138 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 177/392 variables, 215/353 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 176/529 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:03:07] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/392 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 539 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 101/101 constraints]
After SMT, in 53848ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 53851ms
Starting structural reductions in LTL mode, iteration 1 : 215/227 places, 177/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54278 ms. Remains : 215/227 places, 177/187 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-06 finished in 54419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Graph (trivial) has 101 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 466 edges and 222 vertex of which 221 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
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 218 transition count 159
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 198 transition count 159
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 42 place count 198 transition count 111
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 144 place count 144 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 138 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 138 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 156 place count 138 transition count 104
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 158 place count 137 transition count 104
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 103 rules applied. Total rules applied 261 place count 80 transition count 58
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 263 place count 79 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 78 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 265 place count 77 transition count 60
Applied a total of 265 rules in 106 ms. Remains 77 /227 variables (removed 150) and now considering 60/187 (removed 127) transitions.
// Phase 1: matrix 60 rows 77 cols
[2024-06-01 07:03:13] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 07:03:13] [INFO ] Implicit Places using invariants in 74 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/227 places, 60/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 76/227 places, 60/187 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 10522 reset in 274 ms.
Product exploration explored 100000 steps with 10502 reset in 265 ms.
Computed a total of 69 stabilizing places and 53 stable transitions
Computed a total of 69 stabilizing places and 53 stable transitions
Detected a total of 69/76 stabilizing places and 53/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 486 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4665 resets) in 247 ms. (161 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1615 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
// Phase 1: matrix 60 rows 76 cols
[2024-06-01 07:03:15] [INFO ] Computed 28 invariants in 0 ms
[2024-06-01 07:03:15] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/55 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/110 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/134 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/135 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/135 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/136 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 43/136 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 10/20 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/76 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 205ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 510 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-01 07:03:15] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 07:03:16] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [22, 23, 24, 26, 28, 32, 34, 36, 38, 40]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 138 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/76 places, 60/60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 52
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 58 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 57 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 57 transition count 50
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 place count 34 transition count 39
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 27 transition count 32
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 27 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 24 transition count 29
Applied a total of 72 rules in 17 ms. Remains 24 /66 variables (removed 42) and now considering 29/60 (removed 31) transitions.
// Phase 1: matrix 29 rows 24 cols
[2024-06-01 07:03:16] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 07:03:16] [INFO ] Invariant cache hit.
[2024-06-01 07:03:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:03:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/76 places, 29/60 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 24/76 places, 29/60 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/24 stabilizing places and 22/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 340 steps (53 resets) in 5 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 12656 reset in 78 ms.
Product exploration explored 100000 steps with 12605 reset in 94 ms.
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 29/29 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 21 transition count 27
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 21 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 25
Applied a total of 5 rules in 5 ms. Remains 21 /24 variables (removed 3) and now considering 25/29 (removed 4) transitions.
// Phase 1: matrix 25 rows 21 cols
[2024-06-01 07:03:16] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 07:03:17] [INFO ] Invariant cache hit.
[2024-06-01 07:03:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-06-01 07:03:17] [INFO ] Redundant transitions in 14 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 07:03:17] [INFO ] Invariant cache hit.
[2024-06-01 07:03:17] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 21/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 21/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 25/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1127 ms. Remains : 21/24 places, 25/29 transitions.
Treatment of property BusinessProcesses-PT-04-LTLFireability-07 finished in 4341 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)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Graph (trivial) has 99 edges and 227 vertex of which 6 / 227 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 466 edges and 222 vertex of which 221 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
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 218 transition count 160
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 199 transition count 160
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 40 place count 199 transition count 114
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 138 place count 147 transition count 114
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 140 transition count 107
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 140 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 152 place count 140 transition count 106
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 154 place count 139 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 107 rules applied. Total rules applied 261 place count 80 transition count 58
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 263 place count 79 transition count 61
Applied a total of 263 rules in 33 ms. Remains 79 /227 variables (removed 148) and now considering 61/187 (removed 126) transitions.
// Phase 1: matrix 61 rows 79 cols
[2024-06-01 07:03:17] [INFO ] Computed 30 invariants in 1 ms
[2024-06-01 07:03:18] [INFO ] Implicit Places using invariants in 220 ms returned [1, 7, 20, 21, 22]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 221 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/227 places, 61/187 transitions.
Applied a total of 0 rules in 15 ms. Remains 74 /74 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 74/227 places, 61/187 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-09 finished in 337 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)) U (!p2 U p3)))'
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Graph (trivial) has 97 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 466 edges and 222 vertex of which 221 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
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 218 transition count 162
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 201 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 200 transition count 161
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 38 place count 200 transition count 115
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 136 place count 148 transition count 115
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 143 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 143 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 146 place count 143 transition count 109
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 148 place count 142 transition count 109
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 109 rules applied. Total rules applied 257 place count 82 transition count 60
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 259 place count 81 transition count 63
Applied a total of 259 rules in 35 ms. Remains 81 /227 variables (removed 146) and now considering 63/187 (removed 124) transitions.
// Phase 1: matrix 63 rows 81 cols
[2024-06-01 07:03:18] [INFO ] Computed 30 invariants in 0 ms
[2024-06-01 07:03:18] [INFO ] Implicit Places using invariants in 363 ms returned [1, 7, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 365 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/227 places, 63/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 77/227 places, 63/187 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p3), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-10 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 216 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 216 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 214 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 214 transition count 176
Applied a total of 24 rules in 5 ms. Remains 214 /227 variables (removed 13) and now considering 176/187 (removed 11) transitions.
// Phase 1: matrix 176 rows 214 cols
[2024-06-01 07:03:18] [INFO ] Computed 47 invariants in 1 ms
[2024-06-01 07:03:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 07:03:18] [INFO ] Invariant cache hit.
[2024-06-01 07:03:19] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-06-01 07:03:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 5 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 16/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/390 variables, 214/354 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 18 (OVERLAPS) 0/390 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 371 constraints, problems are : Problem set: 0 solved, 175 unsolved in 26228 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 110/157 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 176/390 variables, 214/375 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 175/550 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/390 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/390 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 555 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 119/119 constraints]
After SMT, in 56290ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 56292ms
Starting structural reductions in LTL mode, iteration 1 : 214/227 places, 176/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56545 ms. Remains : 214/227 places, 176/187 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 107 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-12 finished in 56656 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)) U !p1) U (X(p1) U p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 218 transition count 178
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 218 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 216 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 216 transition count 176
Applied a total of 22 rules in 7 ms. Remains 216 /227 variables (removed 11) and now considering 176/187 (removed 11) transitions.
// Phase 1: matrix 176 rows 216 cols
[2024-06-01 07:04:15] [INFO ] Computed 49 invariants in 2 ms
[2024-06-01 07:04:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 07:04:15] [INFO ] Invariant cache hit.
[2024-06-01 07:04:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-06-01 07:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 3 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 9/94 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/392 variables, 216/319 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/392 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 19 (OVERLAPS) 0/392 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 334 constraints, problems are : Problem set: 0 solved, 175 unsolved in 23909 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 69/118 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/392 variables, 216/346 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 175/521 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/392 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 528 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 88/88 constraints]
After SMT, in 53937ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 53940ms
Starting structural reductions in LTL mode, iteration 1 : 216/227 places, 176/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54202 ms. Remains : 216/227 places, 176/187 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-13
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-13 finished in 54396 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(p0)||X(F(p1))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 216 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 216 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 214 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 214 transition count 176
Applied a total of 24 rules in 11 ms. Remains 214 /227 variables (removed 13) and now considering 176/187 (removed 11) transitions.
// Phase 1: matrix 176 rows 214 cols
[2024-06-01 07:05:09] [INFO ] Computed 47 invariants in 2 ms
[2024-06-01 07:05:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 07:05:10] [INFO ] Invariant cache hit.
[2024-06-01 07:05:10] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-06-01 07:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 22 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 16/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:19] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:19] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:05:19] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/390 variables, 214/354 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:29] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 18 (OVERLAPS) 0/390 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 371 constraints, problems are : Problem set: 0 solved, 175 unsolved in 22277 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 110/157 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 176/390 variables, 214/375 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 175/550 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/390 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/390 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 555 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 119/119 constraints]
After SMT, in 52316ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 52319ms
Starting structural reductions in LTL mode, iteration 1 : 214/227 places, 176/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52721 ms. Remains : 214/227 places, 176/187 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 191 stabilizing places and 154 stable transitions
Graph (complete) has 451 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 191 stabilizing places and 154 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLFireability-14 finished in 53097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 187/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 216 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 216 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 215 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 215 transition count 177
Applied a total of 22 rules in 13 ms. Remains 215 /227 variables (removed 12) and now considering 177/187 (removed 10) transitions.
// Phase 1: matrix 177 rows 215 cols
[2024-06-01 07:06:02] [INFO ] Computed 47 invariants in 1 ms
[2024-06-01 07:06:03] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:06:03] [INFO ] Invariant cache hit.
[2024-06-01 07:06:03] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:06:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 177/392 variables, 215/301 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (OVERLAPS) 0/392 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 323 constraints, problems are : Problem set: 0 solved, 176 unsolved in 17466 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 61/108 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 177/392 variables, 215/336 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 176/512 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/392 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 518 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 80/80 constraints]
After SMT, in 47506ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 47509ms
Starting structural reductions in LTL mode, iteration 1 : 215/227 places, 177/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47804 ms. Remains : 215/227 places, 177/187 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-15
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-15 finished in 48079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:06:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:06:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 227 places, 187 transitions and 555 arcs took 3 ms.
Total runtime 527896 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-04-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225772287

--------------------
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
mcc2024
ltl formula name BusinessProcesses-PT-04-LTLFireability-07
ltl formula formula --ltl=/tmp/4438/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 187 transitions and 555 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4438/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4438/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4438/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4438/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 228 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 228, there are 204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~77 levels ~10000 states ~45712 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~20000 states ~81856 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~40000 states ~172272 transitions
pnml2lts-mc( 0/ 4): ~332 levels ~80000 states ~387536 transitions
pnml2lts-mc( 0/ 4): ~332 levels ~160000 states ~809852 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~320000 states ~1648376 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~640000 states ~3615016 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~1280000 states ~7470060 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~2560000 states ~15823404 transitions
pnml2lts-mc( 2/ 4): ~367 levels ~5120000 states ~33390820 transitions
pnml2lts-mc( 0/ 4): ~394 levels ~10240000 states ~69877180 transitions
pnml2lts-mc( 0/ 4): ~394 levels ~20480000 states ~151034684 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18405278
pnml2lts-mc( 0/ 4): unique states count: 33552632
pnml2lts-mc( 0/ 4): unique transitions count: 258796780
pnml2lts-mc( 0/ 4): - self-loop count: 214
pnml2lts-mc( 0/ 4): - claim dead count: 205939495
pnml2lts-mc( 0/ 4): - claim found count: 19307428
pnml2lts-mc( 0/ 4): - claim success count: 33554236
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33554499 states 258808298 transitions, fanout: 7.713
pnml2lts-mc( 0/ 4): Total exploration time 160.210 sec (160.190 sec minimum, 160.198 sec on average)
pnml2lts-mc( 0/ 4): States per second: 209441, Transitions per second: 1615432
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 267.3MB, 8.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/17.0%
pnml2lts-mc( 0/ 4): Stored 187 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 267.3MB (~256.0MB paged-in)

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-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-04, 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 r472-tajo-171620399600476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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