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.r048-tajo-171620399700540.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 itstools
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716335033665

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:43:55] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-21 23:43:55] [INFO ] Transformed 586 places.
[2024-05-21 23:43:55] [INFO ] Transformed 525 transitions.
[2024-05-21 23:43:55] [INFO ] Found NUPN structural information;
[2024-05-21 23:43:55] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 29 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 504 transition count 446
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 504 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 187 place count 470 transition count 412
Iterating global reduction 1 with 34 rules applied. Total rules applied 221 place count 470 transition count 412
Applied a total of 221 rules in 209 ms. Remains 470 /582 variables (removed 112) and now considering 412/521 (removed 109) transitions.
// Phase 1: matrix 412 rows 470 cols
[2024-05-21 23:43:56] [INFO ] Computed 95 invariants in 40 ms
[2024-05-21 23:43:57] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-21 23:43:57] [INFO ] Invariant cache hit.
[2024-05-21 23:43:59] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2911 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-05-21 23:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 32 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 11 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 5 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 66 places in 912 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 8 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 6 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 4 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 405 unsolved
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 91 places in 267 ms of which 5 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 399 unsolved
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 4 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 7 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 6 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 90 places in 229 ms of which 18 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/882 variables, and 193 constraints, problems are : Problem set: 12 solved, 399 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 12 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 12 solved, 399 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 98/193 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/213 constraints. Problems are: Problem set: 25 solved, 386 unsolved
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/233 constraints. Problems are: Problem set: 30 solved, 381 unsolved
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 4 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/253 constraints. Problems are: Problem set: 30 solved, 381 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 5 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/273 constraints. Problems are: Problem set: 30 solved, 381 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 89 places in 195 ms of which 5 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/293 constraints. Problems are: Problem set: 30 solved, 381 unsolved
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 92 places in 213 ms of which 5 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 5 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 20/313 constraints. Problems are: Problem set: 33 solved, 378 unsolved
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 5 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 85 places in 237 ms of which 5 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 84 places in 314 ms of which 4 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 5 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/882 variables, and 332 constraints, problems are : Problem set: 33 solved, 378 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 0/411 constraints, Known Traps: 237/237 constraints]
After SMT, in 60322ms problems are : Problem set: 33 solved, 378 unsolved
Search for dead transitions found 33 dead transitions in 60368ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/582 places, 379/521 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 379
Applied a total of 1 rules in 12 ms. Remains 469 /470 variables (removed 1) and now considering 379/379 (removed 0) transitions.
// Phase 1: matrix 379 rows 469 cols
[2024-05-21 23:44:59] [INFO ] Computed 100 invariants in 16 ms
[2024-05-21 23:44:59] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-21 23:44:59] [INFO ] Invariant cache hit.
[2024-05-21 23:45:00] [INFO ] Implicit Places using invariants and state equation in 576 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 862 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/582 places, 379/521 transitions.
Applied a total of 0 rules in 21 ms. Remains 468 /468 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 64437 ms. Remains : 468/582 places, 379/521 transitions.
Support contains 38 out of 468 places after structural reductions.
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 65 ms
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:45:00] [INFO ] Input system was already deterministic with 379 transitions.
RANDOM walk for 40000 steps (290 resets) in 1417 ms. (28 steps per ms) remains 14/32 properties
BEST_FIRST walk for 40002 steps (50 resets) in 332 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (53 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (52 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (53 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (53 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (55 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (53 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (51 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (50 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (50 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (55 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (52 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
// Phase 1: matrix 379 rows 468 cols
[2024-05-21 23:45:02] [INFO ] Computed 99 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 149/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 183/352 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 5 (OVERLAPS) 110/462 variables, 44/99 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 4 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 4 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 16 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 5 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 84 places in 185 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/119 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 6 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 87 places in 232 ms of which 7 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 5103ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 379/379 transitions.
Graph (trivial) has 205 edges and 468 vertex of which 6 / 468 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 967 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 49 place count 462 transition count 324
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 415 transition count 324
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 96 place count 415 transition count 232
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 296 place count 307 transition count 232
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 305 place count 298 transition count 223
Iterating global reduction 2 with 9 rules applied. Total rules applied 314 place count 298 transition count 223
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 549 place count 176 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 175 transition count 114
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 555 place count 175 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 559 place count 171 transition count 110
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 564 place count 171 transition count 110
Applied a total of 564 rules in 114 ms. Remains 171 /468 variables (removed 297) and now considering 110/379 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 171/468 places, 110/379 transitions.
RANDOM walk for 40000 steps (1199 resets) in 931 ms. (42 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40002 steps (641 resets) in 307 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (628 resets) in 322 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (625 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
// Phase 1: matrix 110 rows 171 cols
[2024-05-21 23:45:08] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 23:45:08] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 76/134 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/169 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 110/279 variables, 169/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 13/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/281 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 171/171 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/134 variables, 47/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (OVERLAPS) 35/169 variables, 22/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 110/279 variables, 169/245 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 13/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 1/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/281 variables, 2/261 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/281 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 262 constraints, problems are : Problem set: 2 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 171/171 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 652ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 167 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 8 place count 167 transition count 99
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 158 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 156 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 156 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 37 place count 151 transition count 93
Applied a total of 37 rules in 25 ms. Remains 151 /171 variables (removed 20) and now considering 93/110 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 151/171 places, 93/110 transitions.
RANDOM walk for 40000 steps (1423 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (815 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1914 steps, run visited all 1 properties in 15 ms. (steps per millisecond=127 )
Probabilistic random walk after 1914 steps, saw 855 distinct states, run finished after 19 ms. (steps per millisecond=100 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 453 stabilizing places and 364 stable transitions
Graph (complete) has 974 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Graph (complete) has 974 edges and 468 vertex of which 467 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 466 transition count 329
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 418 transition count 327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 416 transition count 327
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 101 place count 416 transition count 225
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 323 place count 296 transition count 225
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 336 place count 283 transition count 212
Iterating global reduction 3 with 13 rules applied. Total rules applied 349 place count 283 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 349 place count 283 transition count 211
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 351 place count 282 transition count 211
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 595 place count 155 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 155 transition count 93
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 598 place count 154 transition count 97
Applied a total of 598 rules in 41 ms. Remains 154 /468 variables (removed 314) and now considering 97/379 (removed 282) transitions.
// Phase 1: matrix 97 rows 154 cols
[2024-05-21 23:45:09] [INFO ] Computed 71 invariants in 2 ms
[2024-05-21 23:45:09] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 5, 6, 21, 22, 23, 24, 31, 32, 33, 38, 39, 40, 41, 42, 43, 44, 45]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 97 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/468 places, 97/379 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 135/468 places, 97/379 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Graph (trivial) has 220 edges and 468 vertex of which 6 / 468 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 968 edges and 463 vertex of which 462 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 461 transition count 320
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 410 transition count 320
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 410 transition count 222
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 318 place count 294 transition count 222
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 281 transition count 209
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 281 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 281 transition count 208
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 346 place count 280 transition count 208
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 7 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 573 place count 163 transition count 98
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 575 place count 162 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 576 place count 161 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 160 transition count 101
Applied a total of 577 rules in 40 ms. Remains 160 /468 variables (removed 308) and now considering 101/379 (removed 278) transitions.
// Phase 1: matrix 101 rows 160 cols
[2024-05-21 23:45:09] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 23:45:09] [INFO ] Implicit Places using invariants in 145 ms returned [23, 38, 39, 44, 45, 46, 47, 48, 49, 50, 136, 142]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 146 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/468 places, 101/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 148/468 places, 101/379 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G((p1 U X((p2||G(p3))))))))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 453 transition count 364
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 453 transition count 364
Applied a total of 30 rules in 42 ms. Remains 453 /468 variables (removed 15) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 453 cols
[2024-05-21 23:45:10] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 23:45:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 23:45:10] [INFO ] Invariant cache hit.
[2024-05-21 23:45:10] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 548 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/468 places, 364/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 598 ms. Remains : 452/468 places, 364/379 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 731 reset in 323 ms.
Stack based approach found an accepted trace after 10294 steps with 76 reset with depth 12 and stack size 12 in 36 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 1378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(X(F((!(p0 U p1)||p0)))))))))'
Support contains 2 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Graph (trivial) has 217 edges and 468 vertex of which 6 / 468 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 968 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 461 transition count 322
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 412 transition count 322
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 100 place count 412 transition count 224
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 314 place count 296 transition count 224
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 326 place count 284 transition count 212
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 284 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 284 transition count 211
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 340 place count 283 transition count 211
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 582 place count 157 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 583 place count 156 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 584 place count 155 transition count 94
Applied a total of 584 rules in 36 ms. Remains 155 /468 variables (removed 313) and now considering 94/379 (removed 285) transitions.
// Phase 1: matrix 94 rows 155 cols
[2024-05-21 23:45:11] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 23:45:11] [INFO ] Implicit Places using invariants in 103 ms returned [0, 1, 6, 7, 22, 23, 24, 25, 32, 33, 34, 39, 40, 41, 42, 43, 44, 45]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 105 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/468 places, 94/379 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 137/468 places, 94/379 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Graph (trivial) has 220 edges and 468 vertex of which 6 / 468 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 968 edges and 463 vertex of which 462 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 461 transition count 321
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 411 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 410 transition count 320
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 104 place count 410 transition count 221
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 320 place count 293 transition count 221
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 333 place count 280 transition count 208
Iterating global reduction 3 with 13 rules applied. Total rules applied 346 place count 280 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 280 transition count 207
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 348 place count 279 transition count 207
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 586 place count 155 transition count 93
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 588 place count 154 transition count 97
Applied a total of 588 rules in 38 ms. Remains 154 /468 variables (removed 314) and now considering 97/379 (removed 282) transitions.
// Phase 1: matrix 97 rows 154 cols
[2024-05-21 23:45:11] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 23:45:11] [INFO ] Implicit Places using invariants in 97 ms returned [1, 2, 5, 6, 21, 22, 23, 24, 31, 32, 33, 38, 39, 40, 41, 44, 45, 46]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 100 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/468 places, 97/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 136 /136 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 136/468 places, 97/379 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 457 transition count 368
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 457 transition count 368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 455 transition count 366
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 455 transition count 366
Applied a total of 26 rules in 29 ms. Remains 455 /468 variables (removed 13) and now considering 366/379 (removed 13) transitions.
// Phase 1: matrix 366 rows 455 cols
[2024-05-21 23:45:11] [INFO ] Computed 99 invariants in 2 ms
[2024-05-21 23:45:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 23:45:11] [INFO ] Invariant cache hit.
[2024-05-21 23:45:12] [INFO ] Implicit Places using invariants and state equation in 362 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/468 places, 366/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 454 /454 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 454/468 places, 366/379 transitions.
Stuttering acceptance computed with spot in 219 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 33464 reset in 210 ms.
Product exploration explored 100000 steps with 33319 reset in 190 ms.
Computed a total of 439 stabilizing places and 351 stable transitions
Graph (complete) has 954 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 439 stabilizing places and 351 stable transitions
Detected a total of 439/454 stabilizing places and 351/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT 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 23 factoid took 721 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Reduction of identical properties reduced properties to check from 11 to 7
RANDOM walk for 40000 steps (290 resets) in 245 ms. (162 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
// Phase 1: matrix 366 rows 454 cols
[2024-05-21 23:45:14] [INFO ] Computed 98 invariants in 4 ms
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/448 variables, 46/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 362/810 variables, 448/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/819 variables, 5/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/820 variables, 1/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/820 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 552 constraints, problems are : Problem set: 1 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/321 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
SMT process timed out in 5470ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 366/366 transitions.
Graph (trivial) has 205 edges and 454 vertex of which 6 / 454 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 947 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 448 transition count 312
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 402 transition count 312
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 94 place count 402 transition count 215
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 306 place count 287 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 286 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 286 transition count 214
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 558 place count 156 transition count 94
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 560 place count 155 transition count 98
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 155 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 564 place count 153 transition count 96
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 153 transition count 96
Applied a total of 565 rules in 77 ms. Remains 153 /454 variables (removed 301) and now considering 96/366 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 153/454 places, 96/366 transitions.
RANDOM walk for 144 steps (5 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT 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) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 2305 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 295 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 366/366 transitions.
Applied a total of 0 rules in 10 ms. Remains 454 /454 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-21 23:45:22] [INFO ] Invariant cache hit.
[2024-05-21 23:45:23] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 23:45:23] [INFO ] Invariant cache hit.
[2024-05-21 23:45:23] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-21 23:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 5 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/820 variables, and 204 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 106/204 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 4 ms to minimize.
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 5 ms to minimize.
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:45:58] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:45:59] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 5 ms to minimize.
[2024-05-21 23:45:59] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:45:59] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:45:59] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:45:59] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 5 ms to minimize.
[2024-05-21 23:46:01] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:46:01] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:01] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:46:01] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:46:01] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 6 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:46:04] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:46:04] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:46:04] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 2 ms to minimize.
[2024-05-21 23:46:04] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 3 ms to minimize.
[2024-05-21 23:46:05] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:05] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 5 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 5 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 84 places in 211 ms of which 5 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 5 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 5 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 4 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 17 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 5 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 5 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 80 places in 249 ms of which 31 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 5 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
SMT process timed out in 60214ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 60978 ms. Remains : 454/454 places, 366/366 transitions.
Computed a total of 439 stabilizing places and 351 stable transitions
Graph (complete) has 954 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 439 stabilizing places and 351 stable transitions
Detected a total of 439/454 stabilizing places and 351/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 750 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 13232 steps (95 resets) in 63 ms. (206 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1549 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 300 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 316 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Product exploration explored 100000 steps with 33444 reset in 159 ms.
Product exploration explored 100000 steps with 33382 reset in 151 ms.
Applying partial POR strategy [true, true, false, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 366/366 transitions.
Graph (trivial) has 203 edges and 454 vertex of which 6 / 454 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 948 edges and 449 vertex of which 448 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
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 448 transition count 359
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 448 transition count 408
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 448 transition count 408
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 432 transition count 377
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 432 transition count 377
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 295 place count 432 transition count 377
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 329 place count 398 transition count 343
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 363 place count 398 transition count 343
Deduced a syphon composed of 211 places in 0 ms
Applied a total of 363 rules in 124 ms. Remains 398 /454 variables (removed 56) and now considering 343/366 (removed 23) transitions.
[2024-05-21 23:46:28] [INFO ] Redundant transitions in 20 ms returned []
Running 342 sub problems to find dead transitions.
// Phase 1: matrix 343 rows 398 cols
[2024-05-21 23:46:28] [INFO ] Computed 98 invariants in 3 ms
[2024-05-21 23:46:28] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/118 constraints. Problems are: Problem set: 132 solved, 210 unsolved
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/138 constraints. Problems are: Problem set: 200 solved, 142 unsolved
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 4 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/158 constraints. Problems are: Problem set: 227 solved, 115 unsolved
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 3 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/178 constraints. Problems are: Problem set: 235 solved, 107 unsolved
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 4 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 4 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 19/197 constraints. Problems are: Problem set: 239 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/197 constraints. Problems are: Problem set: 239 solved, 103 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 10 (OVERLAPS) 342/740 variables, 398/595 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 11/606 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 14 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 3/609 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 0/609 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 1/741 variables, 1/610 constraints. Problems are: Problem set: 248 solved, 94 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/741 variables, 0/610 constraints. Problems are: Problem set: 248 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/741 variables, and 610 constraints, problems are : Problem set: 248 solved, 94 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 398/398 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 248 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 163/349 variables, 54/54 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 102/156 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 5 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 20/176 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 5 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 20/196 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 5 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 4 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 5 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 20/216 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 20/236 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 20/256 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 4 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 20/276 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 38 places in 1558 ms of which 3 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 20/296 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 4/300 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/300 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 47/396 variables, 44/344 constraints. Problems are: Problem set: 248 solved, 94 unsolved
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 2/346 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/346 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 342/738 variables, 396/742 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/738 variables, 11/753 constraints. Problems are: Problem set: 248 solved, 94 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/738 variables, 94/847 constraints. Problems are: Problem set: 248 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/741 variables, and 847 constraints, problems are : Problem set: 248 solved, 94 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 396/398 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 94/342 constraints, Known Traps: 248/248 constraints]
After SMT, in 60306ms problems are : Problem set: 248 solved, 94 unsolved
Search for dead transitions found 248 dead transitions in 60313ms
Found 248 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 248 transitions
Dead transitions reduction (with SMT) removed 248 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 398/454 places, 95/366 transitions.
Graph (complete) has 707 edges and 398 vertex of which 187 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.2 ms
Discarding 211 places :
Also discarding 0 output transitions
Ensure Unique test removed 31 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 156 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 24 ms. Remains 156 /398 variables (removed 242) and now considering 107/95 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/454 places, 107/366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60490 ms. Remains : 156/454 places, 107/366 transitions.
Built C files in :
/tmp/ltsmin6053549203452844584
[2024-05-21 23:47:28] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6053549203452844584
Running compilation step : cd /tmp/ltsmin6053549203452844584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1090 ms.
Running link step : cd /tmp/ltsmin6053549203452844584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin6053549203452844584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1668029005393897894.hoa' '--buchi-type=spotba'
LTSmin run took 13542 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 151713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(G(p1)&&F(p2)))&&(p2||G(p0)))))'
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 457 transition count 368
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 457 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 456 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 456 transition count 367
Applied a total of 24 rules in 42 ms. Remains 456 /468 variables (removed 12) and now considering 367/379 (removed 12) transitions.
// Phase 1: matrix 367 rows 456 cols
[2024-05-21 23:47:43] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 23:47:43] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 23:47:43] [INFO ] Invariant cache hit.
[2024-05-21 23:47:44] [INFO ] Implicit Places using invariants and state equation in 591 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 871 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/468 places, 367/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 922 ms. Remains : 455/468 places, 367/379 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 1137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 454 transition count 365
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 454 transition count 365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 452 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 452 transition count 363
Applied a total of 32 rules in 22 ms. Remains 452 /468 variables (removed 16) and now considering 363/379 (removed 16) transitions.
// Phase 1: matrix 363 rows 452 cols
[2024-05-21 23:47:44] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 23:47:44] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-21 23:47:44] [INFO ] Invariant cache hit.
[2024-05-21 23:47:45] [INFO ] Implicit Places using invariants and state equation in 727 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/468 places, 363/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 451 /451 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1043 ms. Remains : 451/468 places, 363/379 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 1221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((G(p1)||p0))) U p2)&&X(p3)))'
Support contains 6 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 453 transition count 364
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 453 transition count 364
Applied a total of 30 rules in 17 ms. Remains 453 /468 variables (removed 15) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 453 cols
[2024-05-21 23:47:45] [INFO ] Computed 99 invariants in 5 ms
[2024-05-21 23:47:46] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 23:47:46] [INFO ] Invariant cache hit.
[2024-05-21 23:47:46] [INFO ] Implicit Places using invariants and state equation in 741 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 957 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/468 places, 364/379 transitions.
Applied a total of 0 rules in 9 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 984 ms. Remains : 452/468 places, 364/379 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 1341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 453 transition count 364
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 453 transition count 364
Applied a total of 30 rules in 32 ms. Remains 453 /468 variables (removed 15) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 453 cols
[2024-05-21 23:47:47] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 23:47:47] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 23:47:47] [INFO ] Invariant cache hit.
[2024-05-21 23:47:48] [INFO ] Implicit Places using invariants and state equation in 749 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 976 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/468 places, 364/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1016 ms. Remains : 452/468 places, 364/379 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 1280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1)) U (p2&&F(p3)))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 458 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 458 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 457 transition count 368
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 457 transition count 368
Applied a total of 22 rules in 18 ms. Remains 457 /468 variables (removed 11) and now considering 368/379 (removed 11) transitions.
// Phase 1: matrix 368 rows 457 cols
[2024-05-21 23:47:48] [INFO ] Computed 99 invariants in 4 ms
[2024-05-21 23:47:48] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 23:47:48] [INFO ] Invariant cache hit.
[2024-05-21 23:47:49] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 787 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/468 places, 368/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 812 ms. Remains : 456/468 places, 368/379 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15
Product exploration explored 100000 steps with 727 reset in 218 ms.
Product exploration explored 100000 steps with 726 reset in 350 ms.
Computed a total of 441 stabilizing places and 353 stable transitions
Graph (complete) has 956 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 441 stabilizing places and 353 stable transitions
Detected a total of 441/456 stabilizing places and 353/368 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X p3), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p1)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1290 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), true]
RANDOM walk for 40000 steps (292 resets) in 303 ms. (131 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (49 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
// Phase 1: matrix 368 rows 456 cols
[2024-05-21 23:47:52] [INFO ] Computed 98 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 220/323 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:47:53] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 6 ms to minimize.
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:47:54] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 1 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
SMT process timed out in 5030ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 368/368 transitions.
Graph (trivial) has 205 edges and 456 vertex of which 6 / 456 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 949 edges and 451 vertex of which 450 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 450 transition count 316
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 406 transition count 316
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 90 place count 406 transition count 218
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 304 place count 290 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 305 place count 289 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 289 transition count 217
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 558 place count 158 transition count 96
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 560 place count 157 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 157 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 564 place count 155 transition count 98
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 155 transition count 98
Applied a total of 565 rules in 36 ms. Remains 155 /456 variables (removed 301) and now considering 98/368 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 155/456 places, 98/368 transitions.
RANDOM walk for 40000 steps (1310 resets) in 228 ms. (174 steps per ms) remains 1/5 properties
BEST_FIRST walk for 5575 steps (50 resets) in 15 ms. (348 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X p3), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p1)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p3))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 18 factoid took 1822 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 10822 ms.
All properties solved by simple procedures.
Total runtime 243977 ms.

BK_STOP 1716335279372

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-12, 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 r048-tajo-171620399700540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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