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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225616418

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:06:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:06:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:06:57] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 07:06:57] [INFO ] Transformed 567 places.
[2024-06-01 07:06:57] [INFO ] Transformed 508 transitions.
[2024-06-01 07:06:57] [INFO ] Found NUPN structural information;
[2024-06-01 07:06:57] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 75 place count 485 transition count 430
Iterating global reduction 1 with 71 rules applied. Total rules applied 146 place count 485 transition count 430
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 182 place count 449 transition count 394
Iterating global reduction 1 with 36 rules applied. Total rules applied 218 place count 449 transition count 394
Applied a total of 218 rules in 108 ms. Remains 449 /560 variables (removed 111) and now considering 394/501 (removed 107) transitions.
// Phase 1: matrix 394 rows 449 cols
[2024-06-01 07:06:58] [INFO ] Computed 91 invariants in 30 ms
[2024-06-01 07:06:58] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 07:06:58] [INFO ] Invariant cache hit.
[2024-06-01 07:06:58] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-06-01 07:06:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/449 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 23 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/111 constraints. Problems are: Problem set: 12 solved, 381 unsolved
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 6 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 3 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/131 constraints. Problems are: Problem set: 21 solved, 372 unsolved
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 8 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 11 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/151 constraints. Problems are: Problem set: 24 solved, 369 unsolved
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 20/171 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 20/191 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/843 variables, and 211 constraints, problems are : Problem set: 31 solved, 362 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 31 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 38/38 constraints. Problems are: Problem set: 31 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/38 constraints. Problems are: Problem set: 31 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/449 variables, 49/87 constraints. Problems are: Problem set: 31 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 4/91 constraints. Problems are: Problem set: 31 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 120/211 constraints. Problems are: Problem set: 31 solved, 362 unsolved
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/231 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/251 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 20/271 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 20/291 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 20/311 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 20/331 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 4 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 20/351 constraints. Problems are: Problem set: 36 solved, 357 unsolved
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/843 variables, and 358 constraints, problems are : Problem set: 36 solved, 357 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/393 constraints, Known Traps: 267/267 constraints]
After SMT, in 60197ms problems are : Problem set: 36 solved, 357 unsolved
Search for dead transitions found 36 dead transitions in 60230ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 449/560 places, 358/501 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 446 transition count 358
Applied a total of 3 rules in 34 ms. Remains 446 /449 variables (removed 3) and now considering 358/358 (removed 0) transitions.
// Phase 1: matrix 358 rows 446 cols
[2024-06-01 07:07:59] [INFO ] Computed 97 invariants in 13 ms
[2024-06-01 07:07:59] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 07:07:59] [INFO ] Invariant cache hit.
[2024-06-01 07:07:59] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 446/560 places, 358/501 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61945 ms. Remains : 446/560 places, 358/501 transitions.
Support contains 47 out of 446 places after structural reductions.
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 58 ms
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:08:00] [INFO ] Input system was already deterministic with 358 transitions.
RANDOM walk for 40000 steps (300 resets) in 1944 ms. (20 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40004 steps (39 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (38 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (54 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (57 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (52 resets) in 142 ms. (279 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (56 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (54 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (53 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (54 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (58 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
[2024-06-01 07:08:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 120/142 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 179/321 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 116/437 variables, 48/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 352/789 variables, 437/534 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 15 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 5083ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (complete) has 918 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 445 transition count 310
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 398 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 396 transition count 308
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 99 place count 396 transition count 220
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 293 place count 290 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 298 place count 285 transition count 215
Iterating global reduction 3 with 5 rules applied. Total rules applied 303 place count 285 transition count 215
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 513 place count 177 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 514 place count 177 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 176 transition count 116
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 520 place count 176 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 175 transition count 115
Applied a total of 521 rules in 134 ms. Remains 175 /446 variables (removed 271) and now considering 115/358 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 175/446 places, 115/358 transitions.
RANDOM walk for 40000 steps (2605 resets) in 1263 ms. (31 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (512 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (627 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (671 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (676 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (675 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (656 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (657 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (665 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (677 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (675 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (850 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
Probably explored full state space saw : 63630 states, properties seen :9
Probabilistic random walk after 272121 steps, saw 63630 distinct states, run finished after 1402 ms. (steps per millisecond=194 ) properties seen :9
Explored full state space saw : 63630 states, properties seen :0
Exhaustive walk after 272121 steps, saw 63630 distinct states, run finished after 1014 ms. (steps per millisecond=268 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-11-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 431 stabilizing places and 343 stable transitions
Graph (complete) has 918 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 8 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 436 transition count 348
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 436 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 435 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 435 transition count 347
Applied a total of 22 rules in 36 ms. Remains 435 /446 variables (removed 11) and now considering 347/358 (removed 11) transitions.
// Phase 1: matrix 347 rows 435 cols
[2024-06-01 07:08:10] [INFO ] Computed 97 invariants in 8 ms
[2024-06-01 07:08:10] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 07:08:10] [INFO ] Invariant cache hit.
[2024-06-01 07:08:11] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-06-01 07:08:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 51/95 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 4 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 347/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30747 ms. Remains : 435/446 places, 347/358 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-00 finished in 31151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (complete) has 918 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 444 transition count 307
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 395 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 393 transition count 305
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 103 place count 393 transition count 208
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 315 place count 278 transition count 208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 323 place count 270 transition count 200
Iterating global reduction 3 with 8 rules applied. Total rules applied 331 place count 270 transition count 200
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 561 place count 149 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 562 place count 149 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 564 place count 148 transition count 94
Applied a total of 564 rules in 57 ms. Remains 148 /446 variables (removed 298) and now considering 94/358 (removed 264) transitions.
// Phase 1: matrix 94 rows 148 cols
[2024-06-01 07:08:41] [INFO ] Computed 67 invariants in 3 ms
[2024-06-01 07:08:41] [INFO ] Implicit Places using invariants in 222 ms returned [1, 4, 5, 16, 17, 18, 19, 27, 28, 29, 34, 35, 36, 37, 38, 39, 40, 41]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 223 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/446 places, 94/358 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 130/446 places, 94/358 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-01 finished in 428 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((X(X(p0))||(p1&&G(p2)))))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 437 transition count 349
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 437 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 436 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 436 transition count 348
Applied a total of 20 rules in 20 ms. Remains 436 /446 variables (removed 10) and now considering 348/358 (removed 10) transitions.
// Phase 1: matrix 348 rows 436 cols
[2024-06-01 07:08:42] [INFO ] Computed 97 invariants in 5 ms
[2024-06-01 07:08:42] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 07:08:42] [INFO ] Invariant cache hit.
[2024-06-01 07:08:42] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-06-01 07:08:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/93 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 6 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 30248ms, After SMT, problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 30254ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 348/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31033 ms. Remains : 436/446 places, 348/358 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 233 ms.
Computed a total of 421 stabilizing places and 333 stable transitions
Graph (complete) has 906 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 421 stabilizing places and 333 stable transitions
Detected a total of 421/436 stabilizing places and 333/348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 31880 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((X(p1)&&p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 436 transition count 348
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 436 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 435 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 435 transition count 347
Applied a total of 22 rules in 31 ms. Remains 435 /446 variables (removed 11) and now considering 347/358 (removed 11) transitions.
// Phase 1: matrix 347 rows 435 cols
[2024-06-01 07:09:14] [INFO ] Computed 97 invariants in 3 ms
[2024-06-01 07:09:14] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 07:09:14] [INFO ] Invariant cache hit.
[2024-06-01 07:09:14] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-06-01 07:09:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 51/95 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 346 unsolved
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 435/782 variables, and 237 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 51/95 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 140/237 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/782 variables, and 357 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 0/346 constraints, Known Traps: 260/260 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 347/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60698 ms. Remains : 435/446 places, 347/358 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-03
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-03 finished in 60822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 437 transition count 349
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 437 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 436 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 436 transition count 348
Applied a total of 20 rules in 20 ms. Remains 436 /446 variables (removed 10) and now considering 348/358 (removed 10) transitions.
// Phase 1: matrix 348 rows 436 cols
[2024-06-01 07:10:14] [INFO ] Computed 97 invariants in 4 ms
[2024-06-01 07:10:15] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 07:10:15] [INFO ] Invariant cache hit.
[2024-06-01 07:10:15] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-06-01 07:10:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/93 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 4 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 7 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 348/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30709 ms. Remains : 436/446 places, 348/358 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 164 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Computed a total of 421 stabilizing places and 333 stable transitions
Graph (complete) has 906 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 421 stabilizing places and 333 stable transitions
Detected a total of 421/436 stabilizing places and 333/348 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 p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 31215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (trivial) has 206 edges and 446 vertex of which 6 / 446 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 912 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 439 transition count 300
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 389 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 388 transition count 299
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 104 place count 388 transition count 205
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 310 place count 276 transition count 205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 269 transition count 198
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 269 transition count 198
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 229 rules applied. Total rules applied 553 place count 150 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 555 place count 149 transition count 92
Applied a total of 555 rules in 100 ms. Remains 149 /446 variables (removed 297) and now considering 92/358 (removed 266) transitions.
// Phase 1: matrix 92 rows 149 cols
[2024-06-01 07:10:46] [INFO ] Computed 70 invariants in 2 ms
[2024-06-01 07:10:46] [INFO ] Implicit Places using invariants in 133 ms returned [1, 4, 5, 16, 17, 18, 19, 26, 27, 28, 37, 38, 39, 40, 41, 42, 43, 44, 143, 145, 147]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 134 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/446 places, 92/358 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 128/446 places, 92/358 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-06 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (trivial) has 206 edges and 446 vertex of which 6 / 446 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 912 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 439 transition count 300
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 389 transition count 300
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 389 transition count 206
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 308 place count 277 transition count 206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 270 transition count 199
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 270 transition count 199
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 556 place count 147 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 146 transition count 92
Applied a total of 558 rules in 39 ms. Remains 146 /446 variables (removed 300) and now considering 92/358 (removed 266) transitions.
// Phase 1: matrix 92 rows 146 cols
[2024-06-01 07:10:46] [INFO ] Computed 67 invariants in 2 ms
[2024-06-01 07:10:46] [INFO ] Implicit Places using invariants in 140 ms returned [1, 4, 5, 16, 17, 18, 19, 26, 27, 28, 33, 34, 35, 36, 37, 38, 39, 40]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 141 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/446 places, 92/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 128/446 places, 92/358 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07
Stuttering criterion allowed to conclude after 44 steps with 8 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 276 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)||G((F(p1)&&F(p2)))))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (trivial) has 206 edges and 446 vertex of which 6 / 446 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 912 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 439 transition count 300
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 389 transition count 300
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 389 transition count 206
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 278 transition count 206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 270 transition count 198
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 270 transition count 198
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 551 place count 150 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 553 place count 149 transition count 94
Applied a total of 553 rules in 39 ms. Remains 149 /446 variables (removed 297) and now considering 94/358 (removed 264) transitions.
// Phase 1: matrix 94 rows 149 cols
[2024-06-01 07:10:46] [INFO ] Computed 68 invariants in 2 ms
[2024-06-01 07:10:46] [INFO ] Implicit Places using invariants in 118 ms returned [1, 4, 5, 16, 17, 18, 19, 26, 27, 28, 33, 34, 35, 36, 37, 38, 39, 40, 41]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 119 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/446 places, 94/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 130/446 places, 94/358 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 330 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)))) U !p2))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Graph (trivial) has 204 edges and 446 vertex of which 6 / 446 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 912 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 440 transition count 301
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 390 transition count 301
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 390 transition count 207
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 279 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 313 place count 273 transition count 201
Iterating global reduction 2 with 6 rules applied. Total rules applied 319 place count 273 transition count 201
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 553 place count 150 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 555 place count 149 transition count 94
Applied a total of 555 rules in 31 ms. Remains 149 /446 variables (removed 297) and now considering 94/358 (removed 264) transitions.
// Phase 1: matrix 94 rows 149 cols
[2024-06-01 07:10:47] [INFO ] Computed 68 invariants in 2 ms
[2024-06-01 07:10:47] [INFO ] Implicit Places using invariants in 105 ms returned [1, 4, 5, 16, 17, 18, 19, 26, 27, 28, 33, 34, 35, 36, 37, 38, 41, 42, 122]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 107 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/446 places, 94/358 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 130/446 places, 94/358 transitions.
Stuttering acceptance computed with spot in 109 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 29123 reset in 275 ms.
Product exploration explored 100000 steps with 29120 reset in 292 ms.
Computed a total of 121 stabilizing places and 86 stable transitions
Computed a total of 121 stabilizing places and 86 stable transitions
Detected a total of 121/130 stabilizing places and 86/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 844 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9021 resets) in 1744 ms. (22 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (3008 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3108 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
// Phase 1: matrix 94 rows 130 cols
[2024-06-01 07:10:49] [INFO ] Computed 49 invariants in 2 ms
[2024-06-01 07:10:49] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/43 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/108 variables, 32/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/127 variables, 14/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 93/220 variables, 127/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 13/191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/223 variables, 3/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/224 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/224 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 195 constraints, problems are : Problem set: 1 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/108 variables, 32/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/127 variables, 14/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/220 variables, 127/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 13/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/223 variables, 3/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/224 variables, 1/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/224 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 198 constraints, problems are : Problem set: 1 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 473ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 94/94 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 130 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 129 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 128 transition count 91
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 126 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 126 transition count 89
Applied a total of 10 rules in 16 ms. Remains 126 /130 variables (removed 4) and now considering 89/94 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/130 places, 89/94 transitions.
RANDOM walk for 319 steps (9 resets) in 9 ms. (31 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 17 factoid took 1110 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 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 130 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 : 130/130 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-01 07:10:51] [INFO ] Invariant cache hit.
[2024-06-01 07:10:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 07:10:51] [INFO ] Invariant cache hit.
[2024-06-01 07:10:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 07:10:51] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [3, 13, 15, 17, 19, 26, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 68, 70, 72, 74, 76, 78]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 280 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/130 places, 94/94 transitions.
Graph (complete) has 220 edges and 99 vertex of which 87 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 18 place count 87 transition count 72
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 70 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 67 transition count 67
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 67 transition count 67
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 74 place count 47 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 43 transition count 50
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 43 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 42 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 42 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 42 transition count 47
Applied a total of 87 rules in 17 ms. Remains 42 /99 variables (removed 57) and now considering 47/94 (removed 47) transitions.
// Phase 1: matrix 47 rows 42 cols
[2024-06-01 07:10:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 07:10:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 07:10:51] [INFO ] Invariant cache hit.
[2024-06-01 07:10:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 07:10:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/130 places, 47/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 42/130 places, 47/94 transitions.
Computed a total of 33 stabilizing places and 39 stable transitions
Computed a total of 33 stabilizing places and 39 stable transitions
Detected a total of 33/42 stabilizing places and 39/47 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 115 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 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 294 steps (68 resets) in 5 ms. (49 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 120 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 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21178 reset in 87 ms.
Product exploration explored 100000 steps with 21188 reset in 95 ms.
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 47/47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 40 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 39 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 39 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 38 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 37 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 37 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 37 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 37 transition count 40
Applied a total of 12 rules in 9 ms. Remains 37 /42 variables (removed 5) and now considering 40/47 (removed 7) transitions.
// Phase 1: matrix 40 rows 37 cols
[2024-06-01 07:10:52] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 07:10:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:10:52] [INFO ] Invariant cache hit.
[2024-06-01 07:10:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 07:10:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 07:10:52] [INFO ] Redundant transitions in 20 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 07:10:52] [INFO ] Invariant cache hit.
[2024-06-01 07:10:52] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/76 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 71 constraints, problems are : Problem set: 0 solved, 38 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/76 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 38/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 109 constraints, problems are : Problem set: 0 solved, 38 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/42 places, 40/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1786 ms. Remains : 37/42 places, 40/47 transitions.
Treatment of property BusinessProcesses-PT-11-LTLFireability-10 finished in 7177 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&&(G(p1)||X(F(p2))))) U X(X(G(!p2)))))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 438 transition count 350
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 438 transition count 350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 437 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 437 transition count 349
Applied a total of 18 rules in 46 ms. Remains 437 /446 variables (removed 9) and now considering 349/358 (removed 9) transitions.
// Phase 1: matrix 349 rows 437 cols
[2024-06-01 07:10:54] [INFO ] Computed 97 invariants in 5 ms
[2024-06-01 07:10:54] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 07:10:54] [INFO ] Invariant cache hit.
[2024-06-01 07:10:54] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 07:10:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/437 variables, 49/93 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 14 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30100ms
Starting structural reductions in LTL mode, iteration 1 : 437/446 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30686 ms. Remains : 437/446 places, 349/358 transitions.
Stuttering acceptance computed with spot in 277 ms :[p2, (AND (NOT p0) p2), p2, true, (AND (NOT p0) p2), p2, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 20058 reset in 169 ms.
Stack based approach found an accepted trace after 1049 steps with 211 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 31165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 7 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 358/358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 437 transition count 349
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 437 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 436 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 436 transition count 348
Applied a total of 20 rules in 22 ms. Remains 436 /446 variables (removed 10) and now considering 348/358 (removed 10) transitions.
// Phase 1: matrix 348 rows 436 cols
[2024-06-01 07:11:25] [INFO ] Computed 97 invariants in 4 ms
[2024-06-01 07:11:25] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 07:11:25] [INFO ] Invariant cache hit.
[2024-06-01 07:11:26] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-06-01 07:11:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/93 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 5 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 348/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30912 ms. Remains : 436/446 places, 348/358 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 421 stabilizing places and 333 stable transitions
Graph (complete) has 906 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Computed a total of 421 stabilizing places and 333 stable transitions
Detected a total of 421/436 stabilizing places and 333/348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 31 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-11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-13 finished in 31438 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)))) U !p2))'
[2024-06-01 07:11:57] [INFO ] Flatten gal took : 56 ms
[2024-06-01 07:11:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:11:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 446 places, 358 transitions and 1058 arcs took 5 ms.
Total runtime 299553 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BusinessProcesses-PT-11-LTLFireability-10

BK_STOP 1717226005517

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-11-LTLFireability-10
ltl formula formula --ltl=/tmp/4737/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 446 places, 358 transitions and 1058 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.100 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 447 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 447, there are 375 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( 1/ 4): ~121 levels ~10000 states ~45116 transitions
pnml2lts-mc( 1/ 4): ~121 levels ~20000 states ~100076 transitions
pnml2lts-mc( 1/ 4): ~121 levels ~40000 states ~220404 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~80000 states ~462868 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~160000 states ~885764 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~320000 states ~2157556 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~640000 states ~4595364 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~1280000 states ~8609144 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~2560000 states ~18452732 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~5120000 states ~39238520 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~10240000 states ~82819196 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10937059
pnml2lts-mc( 0/ 4): unique states count: 11584168
pnml2lts-mc( 0/ 4): unique transitions count: 97914223
pnml2lts-mc( 0/ 4): - self-loop count: 79
pnml2lts-mc( 0/ 4): - claim dead count: 86068908
pnml2lts-mc( 0/ 4): - claim found count: 258571
pnml2lts-mc( 0/ 4): - claim success count: 11584177
pnml2lts-mc( 0/ 4): - cum. max stack depth: 847
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11584177 states 97914248 transitions, fanout: 8.452
pnml2lts-mc( 0/ 4): Total exploration time 87.310 sec (87.310 sec minimum, 87.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 132679, Transitions per second: 1121455
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 152.4MB, 13.8 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 361 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 152.4MB (~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-11"
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-11, 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-171620399700532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 ;