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-171620399700546.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-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716335441015

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:50:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:50:42] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-21 23:50:42] [INFO ] Transformed 593 places.
[2024-05-21 23:50:42] [INFO ] Transformed 536 transitions.
[2024-05-21 23:50:42] [INFO ] Found NUPN structural information;
[2024-05-21 23:50:42] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
Support contains 137 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 69 place count 516 transition count 464
Iterating global reduction 1 with 64 rules applied. Total rules applied 133 place count 516 transition count 464
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 162 place count 487 transition count 435
Iterating global reduction 1 with 29 rules applied. Total rules applied 191 place count 487 transition count 435
Applied a total of 191 rules in 192 ms. Remains 487 /585 variables (removed 98) and now considering 435/528 (removed 93) transitions.
// Phase 1: matrix 435 rows 487 cols
[2024-05-21 23:50:43] [INFO ] Computed 90 invariants in 22 ms
[2024-05-21 23:50:43] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-21 23:50:43] [INFO ] Invariant cache hit.
[2024-05-21 23:50:44] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-21 23:50:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 21 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 112 places in 204 ms of which 10 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 107 places in 305 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 97 places in 510 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 119 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 5 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 4 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 115 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 109 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 111 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 115 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 110 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/922 variables, and 210 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 120/210 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 109 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:35] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:35] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:51:35] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 4 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 60267ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 487/585 places, 435/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61616 ms. Remains : 487/585 places, 435/528 transitions.
Support contains 137 out of 487 places after structural reductions.
[2024-05-21 23:51:44] [INFO ] Flatten gal took : 86 ms
[2024-05-21 23:51:44] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:51:44] [INFO ] Input system was already deterministic with 435 transitions.
RANDOM walk for 40000 steps (284 resets) in 1678 ms. (23 steps per ms) remains 61/97 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
[2024-05-21 23:51:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 216/309 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 82/391 variables, 20/52 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 5 (OVERLAPS) 86/477 variables, 38/90 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/90 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 428/905 variables, 477/567 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 0/567 constraints. Problems are: Problem set: 4 solved, 57 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 9 (OVERLAPS) 11/916 variables, 6/573 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/916 variables, 0/573 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 6/922 variables, 4/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 0/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/922 variables, 0/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 577 constraints, problems are : Problem set: 9 solved, 52 unsolved in 4595 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 214/294 variables, 30/30 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-05-21 23:51:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:50] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:51:50] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 20/50 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 3 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/70 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 9704ms, After SMT, problems are : Problem set: 9 solved, 52 unsolved
Fused 52 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 80 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (complete) has 1079 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 486 transition count 394
Reduce places removed 40 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 44 rules applied. Total rules applied 85 place count 446 transition count 390
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 442 transition count 390
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 89 place count 442 transition count 322
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 234 place count 365 transition count 322
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 244 place count 355 transition count 312
Iterating global reduction 3 with 10 rules applied. Total rules applied 254 place count 355 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 254 place count 355 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 354 transition count 311
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 454 place count 254 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 455 place count 254 transition count 212
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 4 with 2 rules applied. Total rules applied 457 place count 253 transition count 216
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 463 place count 253 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 464 place count 252 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 465 place count 251 transition count 215
Applied a total of 465 rules in 150 ms. Remains 251 /487 variables (removed 236) and now considering 215/435 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 251/487 places, 215/435 transitions.
RANDOM walk for 40000 steps (2087 resets) in 1401 ms. (28 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (32 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (31 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (32 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (30 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 45/52 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
// Phase 1: matrix 215 rows 251 cols
[2024-05-21 23:51:56] [INFO ] Computed 78 invariants in 10 ms
[2024-05-21 23:51:56] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 89/155 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 26/181 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/227 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 2/229 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 1/230 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 215/445 variables, 230/299 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 21/466 variables, 21/325 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 9/334 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (OVERLAPS) 0/466 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 334 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 251/251 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 89/155 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 59 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 62 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 60 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:03] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 26/181 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 46/227 variables, 26/175 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
Problem AtomicPropp89 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 17/252 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 3 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 20/272 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 20/292 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 20/312 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 4/316 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 11/327 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/227 variables, 16/343 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/227 variables, 1/344 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/227 variables, 20/364 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/227 variables, 7/371 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/227 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 28 (OVERLAPS) 2/229 variables, 2/373 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/229 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 30 (OVERLAPS) 1/230 variables, 1/374 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/230 variables, 1/375 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/230 variables, 5/380 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/230 variables, 0/380 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 34 (OVERLAPS) 215/445 variables, 230/610 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/445 variables, 5/615 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/445 variables, 40/655 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/445 variables, 20/675 constraints. Problems are: Problem set: 1 solved, 44 unsolved
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/466 variables, and 679 constraints, problems are : Problem set: 1 solved, 44 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 42/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 230/251 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/45 constraints, Known Traps: 335/335 constraints]
After SMT, in 46795ms problems are : Problem set: 1 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 215/215 transitions.
Graph (trivial) has 13 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 250 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 247 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 247 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 244 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 243 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 243 transition count 207
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 237 transition count 201
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 237 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 235 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 234 transition count 198
Applied a total of 31 rules in 63 ms. Remains 234 /251 variables (removed 17) and now considering 198/215 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 234/251 places, 198/215 transitions.
RANDOM walk for 40000 steps (980 resets) in 372 ms. (107 steps per ms) remains 4/44 properties
BEST_FIRST walk for 40001 steps (302 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (297 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (251 resets) in 74 ms. (533 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (207 resets) in 107 ms. (370 steps per ms) remains 2/3 properties
// Phase 1: matrix 198 rows 234 cols
[2024-05-21 23:52:43] [INFO ] Computed 77 invariants in 5 ms
[2024-05-21 23:52:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/92 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/98 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 70/168 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/172 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/173 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/357 variables, 173/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 68/425 variables, 55/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 17/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/430 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/432 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/432 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/432 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 234/234 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/92 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/98 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 70/168 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/172 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/173 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/357 variables, 173/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 68/425 variables, 55/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 17/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/430 variables, 7/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/430 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/430 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/432 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/432 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/432 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 234/234 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 1521ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 234 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 219 transition count 183
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 30 place count 219 transition count 158
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 87 place count 187 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 94 place count 180 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 180 transition count 151
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 141 place count 159 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 143 place count 158 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 158 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 157 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 157 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 156 transition count 141
Applied a total of 147 rules in 32 ms. Remains 156 /234 variables (removed 78) and now considering 141/198 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 156/234 places, 141/198 transitions.
RANDOM walk for 40000 steps (1787 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (986 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1001 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3306 steps, run visited all 2 properties in 27 ms. (steps per millisecond=122 )
Probabilistic random walk after 3306 steps, saw 1242 distinct states, run finished after 30 ms. (steps per millisecond=110 ) properties seen :2
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:52:45] [INFO ] Input system was already deterministic with 435 transitions.
Support contains 91 out of 487 places (down from 97) after GAL structural reductions.
Computed a total of 138 stabilizing places and 131 stable transitions
Graph (complete) has 1079 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 415 transition count 362
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 132 place count 415 transition count 266
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 341 place count 302 transition count 266
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 369 place count 274 transition count 238
Iterating global reduction 2 with 28 rules applied. Total rules applied 397 place count 274 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 397 place count 274 transition count 235
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 404 place count 270 transition count 235
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 617 place count 162 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 161 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 620 place count 160 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 621 place count 159 transition count 128
Applied a total of 621 rules in 46 ms. Remains 159 /487 variables (removed 328) and now considering 128/435 (removed 307) transitions.
// Phase 1: matrix 128 rows 159 cols
[2024-05-21 23:52:45] [INFO ] Computed 68 invariants in 7 ms
[2024-05-21 23:52:45] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 2, 3, 4, 5, 13, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 110 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 142/487 places, 128/435 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 163 ms. Remains : 142/487 places, 128/435 transitions.
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:52:45] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:52:45] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:52:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6945847774590597412.gal : 6 ms
[2024-05-21 23:52:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10808621267566684623.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6945847774590597412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10808621267566684623.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8389 resets) in 717 ms. (55 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10808621267566684623.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60 after 342
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :342 after 1092
BEST_FIRST walk for 40004 steps (2403 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 158 steps, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Probabilistic random walk after 158 steps, saw 106 distinct states, run finished after 5 ms. (steps per millisecond=31 ) properties seen :1
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 20 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-21 23:52:46] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:52:46] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:52:46] [INFO ] Invariant cache hit.
[2024-05-21 23:52:46] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-21 23:52:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/130 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
Problem TDEAD325 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/150 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-05-21 23:53:03] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:53:03] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:53:04] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:53:05] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/170 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:08] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:53:09] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/190 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-21 23:53:09] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/210 constraints. Problems are: Problem set: 32 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/840 variables, and 210 constraints, problems are : Problem set: 32 solved, 361 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 32 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 120/210 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:22] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:22] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:53:22] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:53:22] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/230 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:53:24] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/250 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:53:27] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:53:28] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/270 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/290 constraints. Problems are: Problem set: 35 solved, 358 unsolved
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:53:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/310 constraints. Problems are: Problem set: 35 solved, 358 unsolved
[2024-05-21 23:53:40] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:53:40] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 5 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 20/330 constraints. Problems are: Problem set: 35 solved, 358 unsolved
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 timeout
0)
(s199 1)
(s200 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/840 variables, and 331 constraints, problems are : Problem set: 35 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/393 constraints, Known Traps: 241/241 constraints]
After SMT, in 60121ms problems are : Problem set: 35 solved, 358 unsolved
Search for dead transitions found 35 dead transitions in 60126ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 446/487 places, 359/435 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 359
Applied a total of 2 rules in 8 ms. Remains 444 /446 variables (removed 2) and now considering 359/359 (removed 0) transitions.
// Phase 1: matrix 359 rows 444 cols
[2024-05-21 23:53:46] [INFO ] Computed 96 invariants in 4 ms
[2024-05-21 23:53:47] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 23:53:47] [INFO ] Invariant cache hit.
[2024-05-21 23:53:47] [INFO ] Implicit Places using invariants and state equation in 462 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 443/487 places, 359/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 443 /443 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61332 ms. Remains : 443/487 places, 359/435 transitions.
[2024-05-21 23:53:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:53:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:53:47] [INFO ] Input system was already deterministic with 359 transitions.
[2024-05-21 23:53:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:53:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:53:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17551095849791066836.gal : 3 ms
[2024-05-21 23:53:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11864494497809832481.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17551095849791066836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11864494497809832481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:54:17] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:54:17] [INFO ] Applying decomposition
[2024-05-21 23:54:17] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16463201500766179288.txt' '-o' '/tmp/graph16463201500766179288.bin' '-w' '/tmp/graph16463201500766179288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16463201500766179288.bin' '-l' '-1' '-v' '-w' '/tmp/graph16463201500766179288.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:17] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-21 23:54:17] [INFO ] Flatten gal took : 61 ms
[2024-05-21 23:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-21 23:54:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8803805809311946939.gal : 8 ms
[2024-05-21 23:54:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5252824062544973968.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8803805809311946939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5252824062544973968.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34315e+25,0.943579,32156,4228,46,53503,740,913,108466,65,1541,0


Converting to forward existential form...Done !
original formula: (AX(!(A((i1.u71.p220!=1) U (!(EF((i15.u79.p249==1))) + AX((i10.i0.u44.p138==1)))))) * (AF((((i11.i0.u51.p182==1)&&(i12.i1.u113.p395==1))&...232
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!((!(E(TRUE U (i15.u79.p249==1))) + !(EX(!((i10.i0.u44.p138==1))))))))) * !(E(!((!(E(TRUE U ...488
Reverse transition relation is NOT exact ! Due to transitions t7, t158, t230, t252, t261, t332, t334, t341, t343, t349, t354, i0.i0.u72.t161, i0.i0.u76.t15...1178
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 448 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 448 transition count 396
Applied a total of 78 rules in 17 ms. Remains 448 /487 variables (removed 39) and now considering 396/435 (removed 39) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-21 23:54:48] [INFO ] Computed 90 invariants in 10 ms
[2024-05-21 23:54:48] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:54:48] [INFO ] Invariant cache hit.
[2024-05-21 23:54:48] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:54:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
Problem TDEAD299 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 15 solved, 380 unsolved
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 20 solved, 375 unsolved
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/170 constraints. Problems are: Problem set: 20 solved, 375 unsolved
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 4 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/190 constraints. Problems are: Problem set: 24 solved, 371 unsolved
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 6 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 24 solved, 371 unsolved
Search for dead transitions found 24 dead transitions in 30175ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/487 places, 372/435 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30827 ms. Remains : 448/487 places, 372/435 transitions.
[2024-05-21 23:55:18] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:55:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:55:18] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 23:55:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:55:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:55:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10159580395800791937.gal : 4 ms
[2024-05-21 23:55:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13846126671126401796.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10159580395800791937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13846126671126401796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:55:49] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:55:49] [INFO ] Applying decomposition
[2024-05-21 23:55:49] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph87930342169113723.txt' '-o' '/tmp/graph87930342169113723.bin' '-w' '/tmp/graph87930342169113723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph87930342169113723.bin' '-l' '-1' '-v' '-w' '/tmp/graph87930342169113723.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:49] [INFO ] Removed a total of 155 redundant transitions.
[2024-05-21 23:55:49] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 9 ms.
[2024-05-21 23:55:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6450023535609667777.gal : 8 ms
[2024-05-21 23:55:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5805222200283070703.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6450023535609667777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5805222200283070703.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 459 transition count 407
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 459 transition count 407
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 449 transition count 397
Applied a total of 76 rules in 36 ms. Remains 449 /487 variables (removed 38) and now considering 397/435 (removed 38) transitions.
// Phase 1: matrix 397 rows 449 cols
[2024-05-21 23:56:19] [INFO ] Computed 90 invariants in 7 ms
[2024-05-21 23:56:19] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 23:56:19] [INFO ] Invariant cache hit.
[2024-05-21 23:56:19] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-21 23:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/449 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 5 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/110 constraints. Problems are: Problem set: 27 solved, 369 unsolved
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/130 constraints. Problems are: Problem set: 27 solved, 369 unsolved
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/150 constraints. Problems are: Problem set: 29 solved, 367 unsolved
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 20/170 constraints. Problems are: Problem set: 29 solved, 367 unsolved
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 20/190 constraints. Problems are: Problem set: 31 solved, 365 unsolved
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 89 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 20/210 constraints. Problems are: Problem set: 31 solved, 365 unsolved
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30153ms, After SMT, problems are : Problem set: 31 solved, 365 unsolved
Search for dead transitions found 31 dead transitions in 30157ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 449/487 places, 366/435 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 366
Applied a total of 1 rules in 7 ms. Remains 448 /449 variables (removed 1) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 448 cols
[2024-05-21 23:56:50] [INFO ] Computed 93 invariants in 4 ms
[2024-05-21 23:56:50] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:56:50] [INFO ] Invariant cache hit.
[2024-05-21 23:56:50] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [143, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 626 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 446/487 places, 366/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 446 /446 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31439 ms. Remains : 446/487 places, 366/435 transitions.
[2024-05-21 23:56:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:50] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:56:50] [INFO ] Input system was already deterministic with 366 transitions.
[2024-05-21 23:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2506666590189777548.gal : 2 ms
[2024-05-21 23:56:50] [INFO ] Time to serialize properties into /tmp/CTLFireability475180233667236055.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2506666590189777548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability475180233667236055.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:57:20] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:57:20] [INFO ] Applying decomposition
[2024-05-21 23:57:20] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11044822775454995014.txt' '-o' '/tmp/graph11044822775454995014.bin' '-w' '/tmp/graph11044822775454995014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11044822775454995014.bin' '-l' '-1' '-v' '-w' '/tmp/graph11044822775454995014.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:57:20] [INFO ] Decomposing Gal with order
[2024-05-21 23:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:57:21] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-21 23:57:21] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2024-05-21 23:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability505222732056269575.gal : 5 ms
[2024-05-21 23:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15507693087424000614.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability505222732056269575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15507693087424000614.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 464 transition count 412
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 464 transition count 412
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 455 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 455 transition count 403
Applied a total of 64 rules in 15 ms. Remains 455 /487 variables (removed 32) and now considering 403/435 (removed 32) transitions.
// Phase 1: matrix 403 rows 455 cols
[2024-05-21 23:57:51] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:57:51] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 23:57:51] [INFO ] Invariant cache hit.
[2024-05-21 23:57:51] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-05-21 23:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/110 constraints. Problems are: Problem set: 12 solved, 390 unsolved
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:01] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:02] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/130 constraints. Problems are: Problem set: 21 solved, 381 unsolved
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/150 constraints. Problems are: Problem set: 23 solved, 379 unsolved
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/170 constraints. Problems are: Problem set: 27 solved, 375 unsolved
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/190 constraints. Problems are: Problem set: 31 solved, 371 unsolved
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 4 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/210 constraints. Problems are: Problem set: 31 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/858 variables, and 210 constraints, problems are : Problem set: 31 solved, 371 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 31 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 36/36 constraints. Problems are: Problem set: 31 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/36 constraints. Problems are: Problem set: 31 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/88 constraints. Problems are: Problem set: 31 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 2/90 constraints. Problems are: Problem set: 31 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 120/210 constraints. Problems are: Problem set: 31 solved, 371 unsolved
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
Problem TDEAD316 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/230 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/250 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 4 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 5 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/270 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/290 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/310 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:58:47] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:58:47] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 20/330 constraints. Problems are: Problem set: 32 solved, 370 unsolved
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 60152ms, After SMT, problems are : Problem set: 32 solved, 370 unsolved
Search for dead transitions found 32 dead transitions in 60156ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/487 places, 371/435 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 371
Applied a total of 1 rules in 6 ms. Remains 454 /455 variables (removed 1) and now considering 371/371 (removed 0) transitions.
// Phase 1: matrix 371 rows 454 cols
[2024-05-21 23:58:52] [INFO ] Computed 94 invariants in 7 ms
[2024-05-21 23:58:52] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:58:52] [INFO ] Invariant cache hit.
[2024-05-21 23:58:52] [INFO ] Implicit Places using invariants and state equation in 465 ms returned [147, 148]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 629 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 452/487 places, 371/435 transitions.
Applied a total of 0 rules in 5 ms. Remains 452 /452 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61547 ms. Remains : 452/487 places, 371/435 transitions.
[2024-05-21 23:58:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:58:52] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:58:52] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-21 23:58:52] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:58:52] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:58:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5171974416040315815.gal : 14 ms
[2024-05-21 23:58:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7704874696977496706.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5171974416040315815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7704874696977496706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:59:22] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:59:22] [INFO ] Applying decomposition
[2024-05-21 23:59:22] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14367486294474292996.txt' '-o' '/tmp/graph14367486294474292996.bin' '-w' '/tmp/graph14367486294474292996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14367486294474292996.bin' '-l' '-1' '-v' '-w' '/tmp/graph14367486294474292996.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:22] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:23] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 23:59:23] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:59:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6833731544349857466.gal : 5 ms
[2024-05-21 23:59:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7002942920935664895.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6833731544349857466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7002942920935664895.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37019e+25,11.8865,243068,7852,48,369942,943,935,640765,72,1957,0


Converting to forward existential form...Done !
original formula: E(!(((EG((i1.u7.p17==1)) * (AX((AG((i2.u13.p30==1)) + (i1.u42.p127!=1))) + !(((E((i8.i0.i0.u54.p162==1) U (i7.u4.p11==1)) + (i14.u89.p264...419
=> equivalent forward existential formula: [((((FwdU(Init,!(((EG((i1.u7.p17==1)) * (!(EX(!((!(E(TRUE U !((i2.u13.p30==1)))) + (i1.u42.p127!=1))))) + !(((E(...492
Reverse transition relation is NOT exact ! Due to transitions t7, t162, t258, t268, t344, t345, t354, t355, t361, i0.u46.t208, i0.u48.t204, i1.u40.t220, i1...1195
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 480 transition count 365
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 418 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 417 transition count 364
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 128 place count 417 transition count 271
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 329 place count 309 transition count 271
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 283 transition count 245
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 283 transition count 245
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 381 place count 283 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 388 place count 279 transition count 242
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 605 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 607 place count 168 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 608 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 609 place count 166 transition count 133
Applied a total of 609 rules in 47 ms. Remains 166 /487 variables (removed 321) and now considering 133/435 (removed 302) transitions.
// Phase 1: matrix 133 rows 166 cols
[2024-05-21 23:59:53] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:59:53] [INFO ] Implicit Places using invariants in 148 ms returned [0, 1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 21, 22, 26, 49, 50, 51, 52, 132, 142]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 150 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/487 places, 133/435 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 146/487 places, 133/435 transitions.
[2024-05-21 23:59:53] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:59:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:59:53] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 23:59:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4669955454539545670.gal : 1 ms
[2024-05-21 23:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17422539158663063528.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4669955454539545670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17422539158663063528.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,41736,0.122474,8180,2,2477,5,14432,6,0,716,11409,0


Converting to forward existential form...Done !
original formula: AF(E(A((AG((p527==1)) * ((p497==1)||(p147==1))) U EG((p226==1))) U AG((p398!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(EG((p226==1))) U (!((!(E(TRUE U !((p527==1)))) * ((p497==1)||(p147==1)))) * !(EG((p226==1)...224
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t31, t32, t33, t34, t35, t59, t60, t61, t62, t91, t92, t93, t125, t126, t127, In...252
(forward)formula 0,0,2.81816,78464,1,0,346,383678,269,248,5336,333353,453
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 34 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-21 23:59:56] [INFO ] Computed 90 invariants in 2 ms
[2024-05-21 23:59:56] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 23:59:56] [INFO ] Invariant cache hit.
[2024-05-21 23:59:56] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-21 23:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/130 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
Problem TDEAD325 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/150 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/170 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/190 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/210 constraints. Problems are: Problem set: 32 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/840 variables, and 210 constraints, problems are : Problem set: 32 solved, 361 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 32 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 32 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 120/210 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/230 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/250 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/270 constraints. Problems are: Problem set: 32 solved, 361 unsolved
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/290 constraints. Problems are: Problem set: 35 solved, 358 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/310 constraints. Problems are: Problem set: 35 solved, 358 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 20/330 constraints. Problems are: Problem set: 35 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/840 variables, and 330 constraints, problems are : Problem set: 35 solved, 358 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/393 constraints, Known Traps: 240/240 constraints]
After SMT, in 60121ms problems are : Problem set: 35 solved, 358 unsolved
Search for dead transitions found 35 dead transitions in 60125ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 446/487 places, 359/435 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 359
Applied a total of 2 rules in 8 ms. Remains 444 /446 variables (removed 2) and now considering 359/359 (removed 0) transitions.
// Phase 1: matrix 359 rows 444 cols
[2024-05-22 00:00:57] [INFO ] Computed 96 invariants in 2 ms
[2024-05-22 00:00:57] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 00:00:57] [INFO ] Invariant cache hit.
[2024-05-22 00:00:57] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 511 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 443/487 places, 359/435 transitions.
Applied a total of 0 rules in 5 ms. Remains 443 /443 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61326 ms. Remains : 443/487 places, 359/435 transitions.
[2024-05-22 00:00:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:57] [INFO ] Input system was already deterministic with 359 transitions.
[2024-05-22 00:00:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2563054985116894934.gal : 3 ms
[2024-05-22 00:00:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15531383800804171974.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2563054985116894934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15531383800804171974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:27] [INFO ] Applying decomposition
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9655407289736301389.txt' '-o' '/tmp/graph9655407289736301389.bin' '-w' '/tmp/graph9655407289736301389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9655407289736301389.bin' '-l' '-1' '-v' '-w' '/tmp/graph9655407289736301389.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:01:27] [INFO ] Decomposing Gal with order
[2024-05-22 00:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:01:27] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:01:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 8 ms.
[2024-05-22 00:01:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16385688815306504449.gal : 5 ms
[2024-05-22 00:01:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12218313848173450841.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16385688815306504449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12218313848173450841.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 448 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 448 transition count 396
Applied a total of 78 rules in 30 ms. Remains 448 /487 variables (removed 39) and now considering 396/435 (removed 39) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-22 00:01:57] [INFO ] Computed 90 invariants in 3 ms
[2024-05-22 00:01:58] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:01:58] [INFO ] Invariant cache hit.
[2024-05-22 00:01:58] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-22 00:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 21 solved, 374 unsolved
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:09] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 21 solved, 374 unsolved
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:02:11] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:02:12] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 25 solved, 370 unsolved
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:02:18] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:02:18] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:18] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:02:18] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 80 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:02:19] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/170 constraints. Problems are: Problem set: 26 solved, 369 unsolved
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:20] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/190 constraints. Problems are: Problem set: 26 solved, 369 unsolved
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 4 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/844 variables, and 207 constraints, problems are : Problem set: 26 solved, 369 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 26 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 26 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 26 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 26 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 26 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 117/207 constraints. Problems are: Problem set: 26 solved, 369 unsolved
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/227 constraints. Problems are: Problem set: 32 solved, 363 unsolved
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/247 constraints. Problems are: Problem set: 32 solved, 363 unsolved
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 13 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/267 constraints. Problems are: Problem set: 34 solved, 361 unsolved
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/287 constraints. Problems are: Problem set: 36 solved, 359 unsolved
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 18/305 constraints. Problems are: Problem set: 36 solved, 359 unsolved
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/844 variables, and 313 constraints, problems are : Problem set: 36 solved, 359 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 223/223 constraints]
After SMT, in 60094ms problems are : Problem set: 36 solved, 359 unsolved
Search for dead transitions found 36 dead transitions in 60098ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/487 places, 360/435 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 445 transition count 360
Applied a total of 3 rules in 7 ms. Remains 445 /448 variables (removed 3) and now considering 360/360 (removed 0) transitions.
// Phase 1: matrix 360 rows 445 cols
[2024-05-22 00:02:58] [INFO ] Computed 96 invariants in 2 ms
[2024-05-22 00:02:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 00:02:58] [INFO ] Invariant cache hit.
[2024-05-22 00:02:59] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 445/487 places, 360/435 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61357 ms. Remains : 445/487 places, 360/435 transitions.
[2024-05-22 00:02:59] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:02:59] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:02:59] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-22 00:02:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:02:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:02:59] [INFO ] Time to serialize gal into /tmp/CTLFireability508042515582835693.gal : 2 ms
[2024-05-22 00:02:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14406652597684754499.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability508042515582835693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14406652597684754499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:03:29] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:03:29] [INFO ] Applying decomposition
[2024-05-22 00:03:29] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7552922374635985339.txt' '-o' '/tmp/graph7552922374635985339.bin' '-w' '/tmp/graph7552922374635985339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7552922374635985339.bin' '-l' '-1' '-v' '-w' '/tmp/graph7552922374635985339.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:03:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:03:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:03:29] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-22 00:03:29] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 00:03:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4767236767831553506.gal : 4 ms
[2024-05-22 00:03:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5781242653352850004.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4767236767831553506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5781242653352850004.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56136e+25,17.9803,331464,14429,35,596829,525,907,1.05793e+06,55,1248,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 461 transition count 409
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 461 transition count 409
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 453 transition count 401
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 453 transition count 401
Applied a total of 68 rules in 34 ms. Remains 453 /487 variables (removed 34) and now considering 401/435 (removed 34) transitions.
// Phase 1: matrix 401 rows 453 cols
[2024-05-22 00:03:59] [INFO ] Computed 90 invariants in 11 ms
[2024-05-22 00:03:59] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 00:03:59] [INFO ] Invariant cache hit.
[2024-05-22 00:04:00] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-22 00:04:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/453 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 20/110 constraints. Problems are: Problem set: 15 solved, 385 unsolved
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 20/130 constraints. Problems are: Problem set: 23 solved, 377 unsolved
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
Problem TDEAD304 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 20/150 constraints. Problems are: Problem set: 25 solved, 375 unsolved
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 20/170 constraints. Problems are: Problem set: 27 solved, 373 unsolved
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 20/190 constraints. Problems are: Problem set: 32 solved, 368 unsolved
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 20/210 constraints. Problems are: Problem set: 34 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/854 variables, and 210 constraints, problems are : Problem set: 34 solved, 366 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/453 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 34 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 36/36 constraints. Problems are: Problem set: 34 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/36 constraints. Problems are: Problem set: 34 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/453 variables, 52/88 constraints. Problems are: Problem set: 34 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 2/90 constraints. Problems are: Problem set: 34 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 120/210 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 20/230 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 5 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 20/250 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 20/270 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 20/290 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 20/310 constraints. Problems are: Problem set: 34 solved, 366 unsolved
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
Problem TDEAD303 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 20/330 constraints. Problems are: Problem set: 35 solved, 365 unsolved
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 1 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 20/350 constraints. Problems are: Problem set: 35 solved, 365 unsolved
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:04:59] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:05:00] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
SMT process timed out in 60147ms, After SMT, problems are : Problem set: 35 solved, 365 unsolved
Search for dead transitions found 35 dead transitions in 60152ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 453/487 places, 366/435 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 450 transition count 366
Applied a total of 3 rules in 16 ms. Remains 450 /453 variables (removed 3) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 450 cols
[2024-05-22 00:05:00] [INFO ] Computed 95 invariants in 4 ms
[2024-05-22 00:05:00] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 00:05:00] [INFO ] Invariant cache hit.
[2024-05-22 00:05:01] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 450/487 places, 366/435 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61584 ms. Remains : 450/487 places, 366/435 transitions.
[2024-05-22 00:05:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:05:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:05:01] [INFO ] Input system was already deterministic with 366 transitions.
[2024-05-22 00:05:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:05:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16084522600535991409.gal : 3 ms
[2024-05-22 00:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12661267093537591500.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16084522600535991409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12661267093537591500.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:05:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:05:31] [INFO ] Applying decomposition
[2024-05-22 00:05:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17616418281659268313.txt' '-o' '/tmp/graph17616418281659268313.bin' '-w' '/tmp/graph17616418281659268313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17616418281659268313.bin' '-l' '-1' '-v' '-w' '/tmp/graph17616418281659268313.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:05:31] [INFO ] Decomposing Gal with order
[2024-05-22 00:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:05:31] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-22 00:05:31] [INFO ] Flatten gal took : 51 ms
[2024-05-22 00:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-05-22 00:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1052035865011628694.gal : 4 ms
[2024-05-22 00:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16011340326107067104.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1052035865011628694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16011340326107067104.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40118e+25,4.25107,108372,11123,40,206936,517,973,309411,62,1296,0


Converting to forward existential form...Done !
original formula: (AG((EX((i2.i0.u52.p153==1)) * (AX((i13.i3.u113.p373==0)) + (i18.u124.p481==1)))) + E(!((EG(AG((i18.u124.p439==1))) * EG((i16.i0.u13.p28=...366
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!((EG(!(E(TRUE U !((i18.u124.p439==1))))) * EG((i16.i0.u13.p28==1)))) U ((!(EG(!(EG((((i6.i0...1096
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t235, t257, t266, t340, t348, t350, t356, i0.i0.u79.t157, i0.i0.u122.t70, i0.i0.u123...1260
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 244 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 415 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 414 transition count 361
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 134 place count 414 transition count 265
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 343 place count 301 transition count 265
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 370 place count 274 transition count 238
Iterating global reduction 3 with 27 rules applied. Total rules applied 397 place count 274 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 397 place count 274 transition count 235
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 404 place count 270 transition count 235
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 619 place count 161 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 621 place count 160 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 622 place count 159 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 158 transition count 127
Applied a total of 623 rules in 58 ms. Remains 158 /487 variables (removed 329) and now considering 127/435 (removed 308) transitions.
// Phase 1: matrix 127 rows 158 cols
[2024-05-22 00:06:01] [INFO ] Computed 68 invariants in 1 ms
[2024-05-22 00:06:01] [INFO ] Implicit Places using invariants in 142 ms returned [0, 1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 143 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/487 places, 127/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 214 ms. Remains : 140/487 places, 127/435 transitions.
[2024-05-22 00:06:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:06:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:06:01] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 00:06:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:06:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:06:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6862768744260450862.gal : 1 ms
[2024-05-22 00:06:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1307697448813210344.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6862768744260450862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1307697448813210344.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8386 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality1307697448813210344.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
BEST_FIRST walk for 40004 steps (2429 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 336
Reachability property BusinessProcesses-PT-13-CTLFireability-2024-09 is true.
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1074,0.038066,5448,2,1550,13,5445,6,0,686,2486,0
Total reachable state count : 1074

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-13-CTLFireability-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-CTLFireability-2024-09,6,0.038447,5448,2,149,13,5445,7,0,689,2486,0
Finished probabilistic random walk after 5986 steps, run visited all 1 properties in 30 ms. (steps per millisecond=199 )
Probabilistic random walk after 5986 steps, saw 1825 distinct states, run finished after 30 ms. (steps per millisecond=199 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 32 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-22 00:06:01] [INFO ] Computed 90 invariants in 4 ms
[2024-05-22 00:06:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:06:01] [INFO ] Invariant cache hit.
[2024-05-22 00:06:02] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-22 00:06:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 5 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/110 constraints. Problems are: Problem set: 11 solved, 383 unsolved
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/130 constraints. Problems are: Problem set: 19 solved, 375 unsolved
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/150 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 5 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/170 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/190 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/210 constraints. Problems are: Problem set: 36 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/842 variables, and 210 constraints, problems are : Problem set: 36 solved, 358 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 36 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 36 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 36 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 52/88 constraints. Problems are: Problem set: 36 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/90 constraints. Problems are: Problem set: 36 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 120/210 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/230 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/250 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/270 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 5 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/290 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/310 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:57] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/330 constraints. Problems are: Problem set: 36 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/842 variables, and 330 constraints, problems are : Problem set: 36 solved, 358 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/394 constraints, Known Traps: 240/240 constraints]
After SMT, in 60086ms problems are : Problem set: 36 solved, 358 unsolved
Search for dead transitions found 36 dead transitions in 60091ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/487 places, 359/435 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 444 transition count 359
Applied a total of 3 rules in 7 ms. Remains 444 /447 variables (removed 3) and now considering 359/359 (removed 0) transitions.
// Phase 1: matrix 359 rows 444 cols
[2024-05-22 00:07:02] [INFO ] Computed 96 invariants in 5 ms
[2024-05-22 00:07:02] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 00:07:02] [INFO ] Invariant cache hit.
[2024-05-22 00:07:03] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 444/487 places, 359/435 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61248 ms. Remains : 444/487 places, 359/435 transitions.
[2024-05-22 00:07:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:07:03] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:07:03] [INFO ] Input system was already deterministic with 359 transitions.
[2024-05-22 00:07:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:07:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:07:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4357340308479814005.gal : 2 ms
[2024-05-22 00:07:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16805287904473853530.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4357340308479814005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16805287904473853530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:07:33] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:07:33] [INFO ] Applying decomposition
[2024-05-22 00:07:33] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15957069324290075079.txt' '-o' '/tmp/graph15957069324290075079.bin' '-w' '/tmp/graph15957069324290075079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15957069324290075079.bin' '-l' '-1' '-v' '-w' '/tmp/graph15957069324290075079.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:07:33] [INFO ] Decomposing Gal with order
[2024-05-22 00:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:07:33] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-22 00:07:33] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2024-05-22 00:07:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16815661697679029630.gal : 4 ms
[2024-05-22 00:07:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4691586099020456108.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16815661697679029630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4691586099020456108.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40153e+25,17.9744,359472,9876,56,494662,1268,911,1.01537e+06,73,2769,0


Converting to forward existential form...Done !
original formula: EX((((i13.u45.p140==1)&&(i10.i2.u117.p400==1))&&((i2.u136.p511==1)&&(i19.u103.p331==1))))
=> equivalent forward existential formula: [(EY(Init) * (((i13.u45.p140==1)&&(i10.i2.u117.p400==1))&&((i2.u136.p511==1)&&(i19.u103.p331==1))))] != FALSE
(forward)formula 0,0,18.019,359472,1,0,494662,1268,1290,1.01537e+06,84,2769,6083
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 239 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 415 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 414 transition count 361
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 134 place count 414 transition count 269
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 335 place count 305 transition count 269
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 361 place count 279 transition count 243
Iterating global reduction 3 with 26 rules applied. Total rules applied 387 place count 279 transition count 243
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 387 place count 279 transition count 240
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 394 place count 275 transition count 240
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 598 place count 172 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 600 place count 171 transition count 138
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 606 place count 171 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 607 place count 170 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 608 place count 169 transition count 137
Applied a total of 608 rules in 34 ms. Remains 169 /487 variables (removed 318) and now considering 137/435 (removed 298) transitions.
// Phase 1: matrix 137 rows 169 cols
[2024-05-22 00:07:51] [INFO ] Computed 69 invariants in 2 ms
[2024-05-22 00:07:51] [INFO ] Implicit Places using invariants in 132 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 23, 24, 25, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 133 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 151/487 places, 137/435 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 151/487 places, 137/435 transitions.
[2024-05-22 00:07:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:51] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:07:51] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:07:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3770208951185244228.gal : 1 ms
[2024-05-22 00:07:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8832206975578882916.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3770208951185244228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8832206975578882916.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,129909,0.902756,31488,2,17040,5,113705,6,0,741,69384,0


Converting to forward existential form...Done !
original formula: E((EF(((p249!=1) * AF(((p202==1)||(p445==1))))) + ((p387==1)&&((p133!=1)||(!((p244==1)||(((p185==1)&&(p385==1))&&(p531==1))))))) U (p378=...159
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U ((p249!=1) * !(EG(!(((p202==1)||(p445==1))))))) + ((p387==1)&&((p133!=1)||(!((p244==1)||((...217
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t39, t40, t41, t42, t43, t44, t57, t58, t59, t60, t61, t83, t84, t85, t91, t92, t93, ...285
(forward)formula 0,1,20.1563,456764,1,0,430,2.60859e+06,272,280,5722,1.73849e+06,577
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 33 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-22 00:08:12] [INFO ] Computed 90 invariants in 2 ms
[2024-05-22 00:08:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:08:12] [INFO ] Invariant cache hit.
[2024-05-22 00:08:12] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-22 00:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 53/89 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/110 constraints. Problems are: Problem set: 10 solved, 384 unsolved
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/130 constraints. Problems are: Problem set: 23 solved, 371 unsolved
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/150 constraints. Problems are: Problem set: 29 solved, 365 unsolved
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
Problem TDEAD303 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/170 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/190 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/210 constraints. Problems are: Problem set: 34 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/842 variables, and 210 constraints, problems are : Problem set: 34 solved, 360 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 34 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 34 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 34 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 53/89 constraints. Problems are: Problem set: 34 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 1/90 constraints. Problems are: Problem set: 34 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 120/210 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:48] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:08:48] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/230 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:53] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:08:53] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/250 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:08:54] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:55] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:55] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/270 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/290 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/310 constraints. Problems are: Problem set: 36 solved, 358 unsolved
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/330 constraints. Problems are: Problem set: 36 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/842 variables, and 330 constraints, problems are : Problem set: 36 solved, 358 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/394 constraints, Known Traps: 240/240 constraints]
After SMT, in 60130ms problems are : Problem set: 36 solved, 358 unsolved
Search for dead transitions found 36 dead transitions in 60136ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/487 places, 359/435 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 444 transition count 359
Applied a total of 3 rules in 9 ms. Remains 444 /447 variables (removed 3) and now considering 359/359 (removed 0) transitions.
// Phase 1: matrix 359 rows 444 cols
[2024-05-22 00:09:12] [INFO ] Computed 96 invariants in 3 ms
[2024-05-22 00:09:12] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 00:09:12] [INFO ] Invariant cache hit.
[2024-05-22 00:09:13] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 444/487 places, 359/435 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61374 ms. Remains : 444/487 places, 359/435 transitions.
[2024-05-22 00:09:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:09:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:09:13] [INFO ] Input system was already deterministic with 359 transitions.
[2024-05-22 00:09:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:09:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17920613637163399236.gal : 5 ms
[2024-05-22 00:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4240334965471708341.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17920613637163399236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4240334965471708341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:09:43] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:09:43] [INFO ] Applying decomposition
[2024-05-22 00:09:43] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10440180261149977760.txt' '-o' '/tmp/graph10440180261149977760.bin' '-w' '/tmp/graph10440180261149977760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10440180261149977760.bin' '-l' '-1' '-v' '-w' '/tmp/graph10440180261149977760.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:09:43] [INFO ] Decomposing Gal with order
[2024-05-22 00:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:09:43] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-22 00:09:43] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:09:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3990297956766147512.gal : 3 ms
[2024-05-22 00:09:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11353523963997509425.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3990297956766147512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11353523963997509425.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34317e+25,1.39787,44580,5110,38,77233,517,949,143743,59,1346,0


Converting to forward existential form...Done !
original formula: AX(EF(AX((i16.u142.p530==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!((i16.u142.p530==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t159, t231, t253, t262, t332, t333, t342, t343, t349, t353, i0.i0.u76.t153, i0.i1.u74.t15...1194
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 236 edges and 487 vertex of which 6 / 487 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1073 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 480 transition count 364
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 416 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 130 place count 416 transition count 272
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 327 place count 310 transition count 272
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 351 place count 286 transition count 248
Iterating global reduction 3 with 24 rules applied. Total rules applied 375 place count 286 transition count 248
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 375 place count 286 transition count 245
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 382 place count 282 transition count 245
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 592 place count 176 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 595 place count 174 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 173 transition count 139
Applied a total of 596 rules in 58 ms. Remains 173 /487 variables (removed 314) and now considering 139/435 (removed 296) transitions.
// Phase 1: matrix 139 rows 173 cols
[2024-05-22 00:10:13] [INFO ] Computed 71 invariants in 1 ms
[2024-05-22 00:10:13] [INFO ] Implicit Places using invariants in 160 ms returned [6, 18, 19, 23, 24, 25, 26, 27, 28, 53, 56, 57, 58, 145]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 161 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/487 places, 139/435 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 222 ms. Remains : 159/487 places, 139/435 transitions.
[2024-05-22 00:10:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:10:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:10:13] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-22 00:10:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:10:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:10:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11996724182275000501.gal : 1 ms
[2024-05-22 00:10:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3902949996616360608.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11996724182275000501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3902949996616360608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,21996,0.291356,13032,2,6582,5,34850,6,0,774,31064,0


Converting to forward existential form...Done !
original formula: AG((EG((((AG((p316==0)) + ((p265==0)&&((p173==0)||(p538==0)))) * (p174==0)) * (p28==0))) * (((p557==1) + EG(!(E((p23==1) U (p445==1))))) ...173
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((((!(E(TRUE U !((p316==0)))) + ((p265==0)&&((p173==0)||(p538==0)))) * (p174==0)) * (p2...273
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t12, t32, t36, t37, t38, t39, t40, t62, t63, t64, t65, t66, t78, t89, t97, t98, t99, ...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.90758,177564,1,0,381,839948,291,235,5844,671047,453
FORMULA BusinessProcesses-PT-13-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 15 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-22 00:10:19] [INFO ] Computed 90 invariants in 6 ms
[2024-05-22 00:10:20] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-22 00:10:20] [INFO ] Invariant cache hit.
[2024-05-22 00:10:20] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-22 00:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 5 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 5 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 5 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 5 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 5 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/130 constraints. Problems are: Problem set: 25 solved, 368 unsolved
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
Problem TDEAD325 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/150 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 5 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/170 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:47] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:10:47] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/190 constraints. Problems are: Problem set: 28 solved, 365 unsolved
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 30229ms, After SMT, problems are : Problem set: 28 solved, 365 unsolved
Search for dead transitions found 28 dead transitions in 30232ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 446/487 places, 366/435 transitions.
Applied a total of 0 rules in 4 ms. Remains 446 /446 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30904 ms. Remains : 446/487 places, 366/435 transitions.
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:10:50] [INFO ] Input system was already deterministic with 366 transitions.
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:10:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3592377539799955464.gal : 3 ms
[2024-05-22 00:10:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14050025701750785911.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3592377539799955464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14050025701750785911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:11:20] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:11:20] [INFO ] Applying decomposition
[2024-05-22 00:11:20] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph48737770273437375.txt' '-o' '/tmp/graph48737770273437375.bin' '-w' '/tmp/graph48737770273437375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph48737770273437375.bin' '-l' '-1' '-v' '-w' '/tmp/graph48737770273437375.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:11:20] [INFO ] Decomposing Gal with order
[2024-05-22 00:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:11:20] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 00:11:20] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:11:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 00:11:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9212834047311343025.gal : 3 ms
[2024-05-22 00:11:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12585012228887846041.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9212834047311343025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12585012228887846041.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 22 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-22 00:11:51] [INFO ] Computed 90 invariants in 6 ms
[2024-05-22 00:11:51] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-22 00:11:51] [INFO ] Invariant cache hit.
[2024-05-22 00:11:51] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-22 00:11:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/130 constraints. Problems are: Problem set: 24 solved, 370 unsolved
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/150 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/170 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/190 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
Problem TDEAD296 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/210 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 34 solved, 360 unsolved
Search for dead transitions found 34 dead transitions in 30083ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/487 places, 361/435 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 361
Applied a total of 1 rules in 8 ms. Remains 446 /447 variables (removed 1) and now considering 361/361 (removed 0) transitions.
// Phase 1: matrix 361 rows 446 cols
[2024-05-22 00:12:21] [INFO ] Computed 96 invariants in 2 ms
[2024-05-22 00:12:22] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:12:22] [INFO ] Invariant cache hit.
[2024-05-22 00:12:22] [INFO ] Implicit Places using invariants and state equation in 377 ms returned [143, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 531 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 444/487 places, 361/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 444 /444 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31417 ms. Remains : 444/487 places, 361/435 transitions.
[2024-05-22 00:12:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:22] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-22 00:12:22] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:12:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7753362757423525024.gal : 2 ms
[2024-05-22 00:12:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2090832053327456456.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7753362757423525024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2090832053327456456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:12:52] [INFO ] Applying decomposition
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph280597605531717327.txt' '-o' '/tmp/graph280597605531717327.bin' '-w' '/tmp/graph280597605531717327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph280597605531717327.bin' '-l' '-1' '-v' '-w' '/tmp/graph280597605531717327.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:52] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:52] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:12:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4566301269664871088.gal : 5 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12168129814286952857.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4566301269664871088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12168129814286952857.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34315e+25,5.81896,113524,12687,49,168691,764,948,533827,65,1668,0


Converting to forward existential form...Done !
original formula: (AG(((i12.i2.u149.p574==1) + A(AX(EX((i2.u131.p504==1))) U A(((i1.i0.u70.p216==1)||(i6.i1.u19.p54==1)) U AG((i1.i0.u67.p207==1)))))) + AG...205
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(((i12.i2.u149.p574==1) + !((E(!(!((E(!(!(E(TRUE U !((i1.i0.u67.p207==1))))) U (!((...788
Reverse transition relation is NOT exact ! Due to transitions t7, t158, t230, t258, t262, t334, t335, t344, t351, t356, i0.i0.u72.t161, i0.i0.u76.t152, i0....1196
Detected timeout of ITS tools.
[2024-05-22 00:13:22] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:13:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:13:22] [INFO ] Applying decomposition
[2024-05-22 00:13:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12168116876684522892.txt' '-o' '/tmp/graph12168116876684522892.bin' '-w' '/tmp/graph12168116876684522892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12168116876684522892.bin' '-l' '-1' '-v' '-w' '/tmp/graph12168116876684522892.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:13:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:13:22] [INFO ] Removed a total of 268 redundant transitions.
[2024-05-22 00:13:22] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:13:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-22 00:13:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1811889663072903591.gal : 5 ms
[2024-05-22 00:13:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10944161090288601828.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1811889663072903591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10944161090288601828.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84504e+25,2.14562,62360,6366,46,100938,622,1229,216052,67,1783,0


Converting to forward existential form...Done !
original formula: (AX(!(A((i11.i0.u76.p220!=1) U (!(EF((i15.i4.u84.p249==1))) + AX((i1.i0.u48.p138==1)))))) * (AF((((i7.i2.u55.p182==1)&&(i7.i2.u127.p395==...238
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!((!(E(TRUE U (i15.i4.u84.p249==1))) + !(EX(!((i1.i0.u48.p138==1))))))))) * !(E(!((!(E(TRUE ...498
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t189, t295, t300, t409, i0.i0.u133.t85, i0.i1.u77.t192, i0.i1.u81.t183, i0.i2.u79...1643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,390.837,2396876,1,0,2.9713e+06,687,5546,8.26584e+06,217,2017,2583246
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EF((i13.i2.u22.p56==1)) + AF((EX((AX((i16.i0.u136.p435==1)) * E((i0.i2.u79.p236==1) U (((i7.i1.u61.p177==1)&&(i7.i0.u62.p180==1))&&(i7.i...199
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (i13.i2.u22.p56==1)))),!((EX((!(EX(!((i16.i0.u136.p435==1)))) * E((i0.i2.u79.p236==1) U...259
(forward)formula 1,1,398.33,2589320,1,0,3.26377e+06,699,5640,8.6162e+06,221,2116,2882331
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(((EG((i16.i1.u137.p440==0)) + AX(AG((i9.i1.u17.p43==0)))) + EF(AX(((i7.i1.u178.p582==0)||(i7.i2.u179.p585==0))))))
=> equivalent forward existential formula: [(FwdU(EY(((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(((i7.i1.u178.p582==0)||(i7.i2.u179.p585==0)))))))) * !(EG((i16.i...214
(forward)formula 2,1,651.128,3234408,1,0,4.01768e+06,709,3751,1.15779e+07,169,2158,2207089
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(!(((EG((i5.i1.u7.p17==1)) * (AX((AG((i10.i0.u13.p30==1)) + (i1.i1.u44.p127!=1))) + !(((E((i7.i0.u54.p162==1) U (i6.i0.u4.p11==1)) + (i1...438
=> equivalent forward existential formula: [((((FwdU(Init,!(((EG((i5.i1.u7.p17==1)) * (!(EX(!((!(E(TRUE U !((i10.i0.u13.p30==1)))) + (i1.i1.u44.p127!=1))))...511
(forward)formula 3,1,653.115,3234408,1,0,4.01768e+06,709,5433,1.15779e+07,207,2158,2547778
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(AX((i2.i1.u29.p78==1)) U !(AG(!((((i7.i1.u60.p179==1)&&(i7.i0.u125.p390==1))&&(i7.i0.u171.p569==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EX(!((i2.i1.u29.p78==1))))),TRUE) * (((i7.i1.u60.p179==1)&&(i7.i0.u125.p390==1))&&(i7.i0.u171...176
(forward)formula 4,1,653.238,3234408,1,0,4.01768e+06,709,5462,1.15779e+07,208,2158,2555454
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A(AG(!(EX((((((i2.i0.u26.p67==1)&&(i8.i0.u130.p405==1))&&(i2.i0.u146.p474==1))||(i4.u33.p94==1)) * AF((i11.i1.u90.p264==1)))))) U AG(!(AG...183
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(E(TRUE U !(E(TRUE U (i6.i0.u51.p148==1))))))))))))) * !(E(!(!(E(TRUE U !(!(!(E...436
(forward)formula 5,1,657.362,3234408,1,0,4.01768e+06,709,5492,1.15779e+07,208,2158,2789335
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AG((EX((i6.i1.u53.p153==1)) * (AX((i15.i2.u120.p373==0)) + (i16.i1.u147.p481==1)))) + E(!((EG(AG((i16.i0.u134.p439==1))) * EG((i10.i0.u1...385
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!((EG(!(E(TRUE U !((i16.i0.u134.p439==1))))) * EG((i10.i0.u12.p28==1)))) U ((!(EG(!(EG((((i1...1147
(forward)formula 6,1,1208.85,5071536,1,0,6.36138e+06,714,3867,1.7237e+07,172,2158,5305407
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX(EF(AX((i16.i0.u134.p530==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!((i16.i0.u134.p530==1)))))))] = FALSE
(forward)formula 7,1,1285.71,5081040,1,0,6.3747e+06,714,3435,1.72685e+07,149,2158,1325642
FORMULA BusinessProcesses-PT-13-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(EX((i6.i1.u52.p151==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i6.i1.u52.p151==1))] != FALSE
(forward)formula 8,1,1286.23,5081040,1,0,6.3747e+06,714,4002,1.72685e+07,154,2158,1454293
FORMULA BusinessProcesses-PT-13-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AG(((i7.i2.u174.p574==1) + A(AX(EX((i1.i1.u154.p504==1))) U A(((i11.i0.u75.p216==1)||(i13.i1.u21.p54==1)) U AG((i9.i0.u72.p207==1)))))) ...212
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(((i7.i2.u174.p574==1) + !((E(!(!((E(!(!(E(TRUE U !((i9.i0.u72.p207==1))))) U (!(((...799
(forward)formula 9,0,1516.21,5081040,1,0,6.3747e+06,714,5375,1.72685e+07,206,2158,3905124
FORMULA BusinessProcesses-PT-13-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2878217 ms.

BK_STOP 1716338320674

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-13"
export BK_EXAMINATION="CTLFireability"
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-13, examination is CTLFireability"
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-171620399700546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;