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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 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 131K 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-10-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716334439407

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:34:00] [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:34:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:34:00] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 23:34:00] [INFO ] Transformed 518 places.
[2024-05-21 23:34:00] [INFO ] Transformed 471 transitions.
[2024-05-21 23:34:00] [INFO ] Found NUPN structural information;
[2024-05-21 23:34:00] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 125 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 467 transition count 421
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 467 transition count 421
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 445 transition count 399
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 445 transition count 399
Applied a total of 145 rules in 81 ms. Remains 445 /518 variables (removed 73) and now considering 399/471 (removed 72) transitions.
// Phase 1: matrix 399 rows 445 cols
[2024-05-21 23:34:01] [INFO ] Computed 84 invariants in 28 ms
[2024-05-21 23:34:01] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-21 23:34:01] [INFO ] Invariant cache hit.
[2024-05-21 23:34:01] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-21 23:34:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 20 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 102 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 4 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 4 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 6 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 30296ms
Starting structural reductions in LTL mode, iteration 1 : 445/518 places, 399/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31065 ms. Remains : 445/518 places, 399/471 transitions.
Support contains 125 out of 445 places after structural reductions.
[2024-05-21 23:34:32] [INFO ] Flatten gal took : 61 ms
[2024-05-21 23:34:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:34:32] [INFO ] Input system was already deterministic with 399 transitions.
Support contains 122 out of 445 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (335 resets) in 2389 ms. (16 steps per ms) remains 39/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
[2024-05-21 23:34:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 242/314 variables, 38/38 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/58 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 19/77 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 5088ms, After SMT, problems are : Problem set: 2 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (complete) has 991 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 444 transition count 363
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 409 transition count 360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 406 transition count 360
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 77 place count 406 transition count 286
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 234 place count 323 transition count 286
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 251 place count 306 transition count 269
Iterating global reduction 3 with 17 rules applied. Total rules applied 268 place count 306 transition count 269
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 437 place count 220 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 438 place count 220 transition count 185
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 445 place count 220 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 446 place count 219 transition count 184
Applied a total of 446 rules in 127 ms. Remains 219 /445 variables (removed 226) and now considering 184/399 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 219/445 places, 184/399 transitions.
RANDOM walk for 40000 steps (1873 resets) in 901 ms. (44 steps per ms) remains 33/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (38 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (36 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (36 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (42 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (39 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (42 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (43 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (38 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (39 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (38 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
// Phase 1: matrix 184 rows 219 cols
[2024-05-21 23:34:39] [INFO ] Computed 72 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 102/162 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 10/172 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/215 variables, 26/83 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/84 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 1/216 variables, 1/85 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 184/400 variables, 216/301 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/301 constraints. Problems are: Problem set: 5 solved, 28 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 13 (OVERLAPS) 3/403 variables, 3/304 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 1/305 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/305 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 0/403 variables, 0/305 constraints. Problems are: Problem set: 10 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 305 constraints, problems are : Problem set: 10 solved, 23 unsolved in 2186 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 10 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 74/110 variables, 19/19 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 5/24 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/24 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 46/156 variables, 24/48 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 8/56 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 54/210 variables, 25/89 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 2/91 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/91 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 2/212 variables, 2/93 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 1/94 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/94 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 182/394 variables, 212/306 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 19/325 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 20/345 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 0/345 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 6/400 variables, 5/350 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 1/351 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/400 variables, 4/355 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 5/360 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/400 variables, 1/361 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/400 variables, 0/361 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 2/402 variables, 1/362 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/402 variables, 0/362 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 1/403 variables, 2/364 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/403 variables, 0/364 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 0/403 variables, 0/364 constraints. Problems are: Problem set: 10 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 364 constraints, problems are : Problem set: 10 solved, 23 unsolved in 6889 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 23/33 constraints, Known Traps: 50/50 constraints]
After SMT, in 9108ms problems are : Problem set: 10 solved, 23 unsolved
Fused 23 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 4074 ms.
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 219 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 217 transition count 182
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4 place count 217 transition count 172
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 26 place count 205 transition count 172
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 193 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 52 place count 192 transition count 177
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 53 place count 192 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 191 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 191 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 190 transition count 175
Applied a total of 56 rules in 38 ms. Remains 190 /219 variables (removed 29) and now considering 175/184 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 190/219 places, 175/184 transitions.
RANDOM walk for 40000 steps (2780 resets) in 352 ms. (113 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (81 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (87 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (79 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (81 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (79 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (95 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (58 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (91 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (84 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (82 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (69 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (85 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (78 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (73 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (74 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (73 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (80 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (78 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (86 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 376029 steps, run visited all 22 properties in 762 ms. (steps per millisecond=493 )
Probabilistic random walk after 376029 steps, saw 68864 distinct states, run finished after 766 ms. (steps per millisecond=490 ) properties seen :22
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:34:53] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:34:53] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:34:53] [INFO ] Input system was already deterministic with 399 transitions.
Support contains 78 out of 445 places (down from 81) after GAL structural reductions.
Computed a total of 223 stabilizing places and 228 stable transitions
Graph (complete) has 991 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 355
Applied a total of 88 rules in 29 ms. Remains 401 /445 variables (removed 44) and now considering 355/399 (removed 44) transitions.
// Phase 1: matrix 355 rows 401 cols
[2024-05-21 23:34:53] [INFO ] Computed 84 invariants in 13 ms
[2024-05-21 23:34:53] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
[2024-05-21 23:34:54] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-05-21 23:34:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 11 solved, 343 unsolved
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 4 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/124 constraints. Problems are: Problem set: 16 solved, 338 unsolved
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/144 constraints. Problems are: Problem set: 22 solved, 332 unsolved
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 6 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 326 unsolved
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/184 constraints. Problems are: Problem set: 32 solved, 322 unsolved
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
SMT process timed out in 30097ms, After SMT, problems are : Problem set: 36 solved, 318 unsolved
Search for dead transitions found 36 dead transitions in 30101ms
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 : 401/445 places, 319/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 319
Applied a total of 3 rules in 16 ms. Remains 398 /401 variables (removed 3) and now considering 319/319 (removed 0) transitions.
// Phase 1: matrix 319 rows 398 cols
[2024-05-21 23:35:24] [INFO ] Computed 90 invariants in 7 ms
[2024-05-21 23:35:24] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 23:35:24] [INFO ] Invariant cache hit.
[2024-05-21 23:35:24] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 398/445 places, 319/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31231 ms. Remains : 398/445 places, 319/399 transitions.
[2024-05-21 23:35:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:35:24] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:35:24] [INFO ] Input system was already deterministic with 319 transitions.
[2024-05-21 23:35:24] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:35:24] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:35:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13343838021008982774.gal : 26 ms
[2024-05-21 23:35:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9908737507571614748.ctl : 3 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/CTLFireability13343838021008982774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9908737507571614748.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-21 23:35:55] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:35:55] [INFO ] Applying decomposition
[2024-05-21 23:35:55] [INFO ] Flatten gal took : 10 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/graph6900754017303758107.txt' '-o' '/tmp/graph6900754017303758107.bin' '-w' '/tmp/graph6900754017303758107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6900754017303758107.bin' '-l' '-1' '-v' '-w' '/tmp/graph6900754017303758107.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:55] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:55] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-21 23:35:55] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-05-21 23:35:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6001229966073771689.gal : 7 ms
[2024-05-21 23:35:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10232714379629853099.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/CTLFireability6001229966073771689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10232714379629853099.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 : 445/445 places, 399/399 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 417 transition count 371
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 417 transition count 371
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 409 transition count 363
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 409 transition count 363
Applied a total of 72 rules in 38 ms. Remains 409 /445 variables (removed 36) and now considering 363/399 (removed 36) transitions.
// Phase 1: matrix 363 rows 409 cols
[2024-05-21 23:36:25] [INFO ] Computed 84 invariants in 9 ms
[2024-05-21 23:36:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:36:25] [INFO ] Invariant cache hit.
[2024-05-21 23:36:25] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 23:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/409 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 5 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/104 constraints. Problems are: Problem set: 10 solved, 352 unsolved
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD289 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 349 unsolved
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/144 constraints. Problems are: Problem set: 21 solved, 341 unsolved
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 4 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD317 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 334 unsolved
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 20/184 constraints. Problems are: Problem set: 32 solved, 330 unsolved
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/772 variables, and 216 constraints, problems are : Problem set: 36 solved, 326 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/409 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 36 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 35/35 constraints. Problems are: Problem set: 36 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/35 constraints. Problems are: Problem set: 36 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/409 variables, 45/80 constraints. Problems are: Problem set: 36 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 4/84 constraints. Problems are: Problem set: 36 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 132/216 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/236 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 4 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/256 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/276 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 20/296 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 20/316 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 20/336 constraints. Problems are: Problem set: 36 solved, 326 unsolved
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 20/356 constraints. Problems are: Problem set: 36 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/772 variables, and 356 constraints, problems are : Problem set: 36 solved, 326 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/409 constraints, PredecessorRefiner: 0/362 constraints, Known Traps: 272/272 constraints]
After SMT, in 60158ms problems are : Problem set: 36 solved, 326 unsolved
Search for dead transitions found 36 dead transitions in 60179ms
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 : 409/445 places, 327/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 406 transition count 327
Applied a total of 3 rules in 8 ms. Remains 406 /409 variables (removed 3) and now considering 327/327 (removed 0) transitions.
// Phase 1: matrix 327 rows 406 cols
[2024-05-21 23:37:26] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 23:37:26] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 23:37:26] [INFO ] Invariant cache hit.
[2024-05-21 23:37:26] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 406/445 places, 327/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61246 ms. Remains : 406/445 places, 327/399 transitions.
[2024-05-21 23:37:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:37:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:37:26] [INFO ] Input system was already deterministic with 327 transitions.
[2024-05-21 23:37:26] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:37:26] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:37:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12931378487292380603.gal : 6 ms
[2024-05-21 23:37:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16856068562815823772.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/CTLFireability12931378487292380603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16856068562815823772.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:37:56] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:37:56] [INFO ] Applying decomposition
[2024-05-21 23:37:56] [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/graph16227518784495621074.txt' '-o' '/tmp/graph16227518784495621074.bin' '-w' '/tmp/graph16227518784495621074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16227518784495621074.bin' '-l' '-1' '-v' '-w' '/tmp/graph16227518784495621074.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:56] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:56] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-21 23:37:56] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-21 23:37:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16786414021979520316.gal : 5 ms
[2024-05-21 23:37:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4973392692091011024.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/CTLFireability16786414021979520316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4973392692091011024.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,4.85468e+24,18.8936,361052,12483,34,608428,530,851,1.08664e+06,47,1563,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 25 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
// Phase 1: matrix 354 rows 400 cols
[2024-05-21 23:38:27] [INFO ] Computed 84 invariants in 4 ms
[2024-05-21 23:38:27] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 23:38:27] [INFO ] Invariant cache hit.
[2024-05-21 23:38:27] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-21 23:38:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 11 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 4 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/184 constraints. Problems are: Problem set: 29 solved, 324 unsolved
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/204 constraints. Problems are: Problem set: 33 solved, 320 unsolved
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 33 solved, 320 unsolved
Search for dead transitions found 33 dead transitions in 30154ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/445 places, 321/399 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 398 transition count 321
Applied a total of 2 rules in 10 ms. Remains 398 /400 variables (removed 2) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 398 cols
[2024-05-21 23:38:57] [INFO ] Computed 88 invariants in 6 ms
[2024-05-21 23:38:57] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 23:38:57] [INFO ] Invariant cache hit.
[2024-05-21 23:38:58] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 460 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 397/445 places, 321/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 397 /397 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31181 ms. Remains : 397/445 places, 321/399 transitions.
[2024-05-21 23:38:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:38:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:38:58] [INFO ] Input system was already deterministic with 321 transitions.
[2024-05-21 23:38:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:38:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:38:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15683610004158096659.gal : 2 ms
[2024-05-21 23:38:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11586532337347143490.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/CTLFireability15683610004158096659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11586532337347143490.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:39:28] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:28] [INFO ] Applying decomposition
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 9 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/graph12809008093700576739.txt' '-o' '/tmp/graph12809008093700576739.bin' '-w' '/tmp/graph12809008093700576739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12809008093700576739.bin' '-l' '-1' '-v' '-w' '/tmp/graph12809008093700576739.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:28] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:39:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15085213389467557976.gal : 15 ms
[2024-05-21 23:39:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8069394242267358545.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/CTLFireability15085213389467557976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8069394242267358545.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,3.87567e+24,6.56919,190436,10220,31,375713,446,831,487675,43,1120,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,6.62905,190436,1,0,375713,446,1169,487675,48,1120,1276
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 368
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 403 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 403 transition count 357
Applied a total of 84 rules in 21 ms. Remains 403 /445 variables (removed 42) and now considering 357/399 (removed 42) transitions.
// Phase 1: matrix 357 rows 403 cols
[2024-05-21 23:39:35] [INFO ] Computed 84 invariants in 4 ms
[2024-05-21 23:39:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:39:35] [INFO ] Invariant cache hit.
[2024-05-21 23:39:35] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-21 23:39:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 20/124 constraints. Problems are: Problem set: 19 solved, 337 unsolved
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 20/144 constraints. Problems are: Problem set: 25 solved, 331 unsolved
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 20/164 constraints. Problems are: Problem set: 32 solved, 324 unsolved
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 20/184 constraints. Problems are: Problem set: 33 solved, 323 unsolved
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:40:01] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:40:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 20/204 constraints. Problems are: Problem set: 33 solved, 323 unsolved
[2024-05-21 23:40:03] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 33 solved, 323 unsolved
Search for dead transitions found 33 dead transitions in 30171ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 403/445 places, 324/399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 324
Applied a total of 1 rules in 7 ms. Remains 402 /403 variables (removed 1) and now considering 324/324 (removed 0) transitions.
// Phase 1: matrix 324 rows 402 cols
[2024-05-21 23:40:05] [INFO ] Computed 89 invariants in 2 ms
[2024-05-21 23:40:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:40:05] [INFO ] Invariant cache hit.
[2024-05-21 23:40:06] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [143, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 414 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 400/445 places, 324/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 400 /400 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31152 ms. Remains : 400/445 places, 324/399 transitions.
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:40:06] [INFO ] Input system was already deterministic with 324 transitions.
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:40:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11165543127421612339.gal : 2 ms
[2024-05-21 23:40:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13917397884242050076.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/CTLFireability11165543127421612339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13917397884242050076.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:40:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:40:36] [INFO ] Applying decomposition
[2024-05-21 23:40:36] [INFO ] Flatten gal took : 10 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/graph1196344784394182949.txt' '-o' '/tmp/graph1196344784394182949.bin' '-w' '/tmp/graph1196344784394182949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1196344784394182949.bin' '-l' '-1' '-v' '-w' '/tmp/graph1196344784394182949.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:36] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-21 23:40:36] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:40:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3941226507945550165.gal : 3 ms
[2024-05-21 23:40:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12970545311506847477.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/CTLFireability3941226507945550165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12970545311506847477.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 SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 7 / 445 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 984 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 438 transition count 332
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 379 transition count 332
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 120 place count 379 transition count 249
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 299 place count 283 transition count 249
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 325 place count 257 transition count 223
Iterating global reduction 2 with 26 rules applied. Total rules applied 351 place count 257 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 351 place count 257 transition count 220
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 358 place count 253 transition count 220
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 550 place count 155 transition count 126
Applied a total of 550 rules in 84 ms. Remains 155 /445 variables (removed 290) and now considering 126/399 (removed 273) transitions.
// Phase 1: matrix 126 rows 155 cols
[2024-05-21 23:41:06] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 23:41:06] [INFO ] Implicit Places using invariants in 194 ms returned [24, 25, 26, 27, 28, 29, 52, 53]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 195 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/445 places, 126/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 288 ms. Remains : 147/445 places, 126/399 transitions.
[2024-05-21 23:41:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:06] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-21 23:41:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16031064307573231684.gal : 1 ms
[2024-05-21 23:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7132810807761566646.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/CTLFireability16031064307573231684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7132810807761566646.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,3.19799e+09,6.25347,162124,2,26919,5,832757,6,0,715,560572,0


Converting to forward existential form...Done !
original formula: E(A(AG(!(AG((p417==1)))) U (AG(E((p0==1) U (p70==1))) + !(EF((p242==1))))) U (p277==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((!(E(TRUE U !(E((p0==1) U (p70==1))))) + !(E(TRUE U (p242==1))))) U (!(!(E(TRUE U !(!(!(E(TRU...350
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t16, t26, t27, t28, t29, t30, t55, t56, t57, t58, t59, t71, t84, t85, t99, t100, ...345
Detected timeout of ITS tools.
[2024-05-21 23:41:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:36] [INFO ] Applying decomposition
[2024-05-21 23:41:36] [INFO ] Flatten gal took : 5 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/graph12360091094538134748.txt' '-o' '/tmp/graph12360091094538134748.bin' '-w' '/tmp/graph12360091094538134748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12360091094538134748.bin' '-l' '-1' '-v' '-w' '/tmp/graph12360091094538134748.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:36] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-21 23:41:36] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-05-21 23:41:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13922819859580433236.gal : 14 ms
[2024-05-21 23:41:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6871809894337297837.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/CTLFireability13922819859580433236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6871809894337297837.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 SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (complete) has 991 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 443 transition count 348
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 394 transition count 345
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 391 transition count 345
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 105 place count 391 transition count 255
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 297 place count 289 transition count 255
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 327 place count 259 transition count 225
Iterating global reduction 3 with 30 rules applied. Total rules applied 357 place count 259 transition count 225
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 259 transition count 222
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 364 place count 255 transition count 222
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 534 place count 168 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 167 transition count 138
Applied a total of 535 rules in 69 ms. Remains 167 /445 variables (removed 278) and now considering 138/399 (removed 261) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-21 23:42:07] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 23:42:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 23:42:07] [INFO ] Invariant cache hit.
[2024-05-21 23:42:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:42:07] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [100, 106, 112, 114]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 367 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 163/445 places, 138/399 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 162 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 160 transition count 135
Applied a total of 6 rules in 15 ms. Remains 160 /163 variables (removed 3) and now considering 135/138 (removed 3) transitions.
// Phase 1: matrix 135 rows 160 cols
[2024-05-21 23:42:07] [INFO ] Computed 63 invariants in 1 ms
[2024-05-21 23:42:07] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 23:42:07] [INFO ] Invariant cache hit.
[2024-05-21 23:42:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:42:07] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [34, 35, 36]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 399 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 157/445 places, 135/399 transitions.
Graph (complete) has 527 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 139 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 139 transition count 95
Applied a total of 19 rules in 14 ms. Remains 139 /157 variables (removed 18) and now considering 95/135 (removed 40) transitions.
// Phase 1: matrix 95 rows 139 cols
[2024-05-21 23:42:07] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 23:42:08] [INFO ] Implicit Places using invariants in 71 ms returned [34, 35, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 136/445 places, 95/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 955 ms. Remains : 136/445 places, 95/399 transitions.
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:42:08] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:42:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5817570891964422028.gal : 2 ms
[2024-05-21 23:42:08] [INFO ] Time to serialize properties into /tmp/CTLFireability18278707545667940410.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/CTLFireability5817570891964422028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18278707545667940410.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,6.27824e+09,4.20865,126052,2,8563,5,599935,6,0,636,488442,0


Converting to forward existential form...Done !
original formula: EF((((A((p3==1) U ((p102==1)&&(p116==1))) * (p74==0)) * (AG((((p43==1)&&(p269==1))&&(p396==1))) * AF((((p21==1)&&(p248==1))&&(p479==1))))...201
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((!((E(!(((p102==1)&&(p116==1))) U (!((p3==1)) * !(((p102==1)&&(p116==1))))) + EG(!(((...603
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t14, t20, t22, t31, t34, t35, t45, t46, t47, t48, t53, t54, t56, t65, t66, t67, t...327
Detected timeout of ITS tools.
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:42:38] [INFO ] Applying decomposition
[2024-05-21 23:42:38] [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/graph12551202271774642116.txt' '-o' '/tmp/graph12551202271774642116.bin' '-w' '/tmp/graph12551202271774642116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12551202271774642116.bin' '-l' '-1' '-v' '-w' '/tmp/graph12551202271774642116.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:38] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:42:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:42:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2351990396721147543.gal : 2 ms
[2024-05-21 23:42:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13019683079942164413.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/CTLFireability2351990396721147543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13019683079942164413.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,6.27824e+09,0.280224,13788,622,209,22166,1040,450,22793,106,2042,0


Converting to forward existential form...Done !
original formula: EF((((A((u13.p3==1) U ((i2.u8.p102==1)&&(i3.u10.p116==1))) * (i10.u6.p74==0)) * (AG((((i5.i1.u1.p43==1)&&(i4.i2.u22.p269==1))&&(i5.i1.u39...301
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((!((E(!(((i2.u8.p102==1)&&(i3.u10.p116==1))) U (!((u13.p3==1)) * !(((i2.u8.p102==1)&&...828
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t22, t45, t53, t54, t56, t65, t66, t67, t68, t71, t72, t73, t74, t75, t76, t77, t78,...377
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 an SCC at level 11
(forward)formula 0,0,1.03642,44148,1,0,84455,5840,2148,99657,613,16712,138858
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 420 transition count 374
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 420 transition count 374
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 411 transition count 365
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 411 transition count 365
Applied a total of 68 rules in 30 ms. Remains 411 /445 variables (removed 34) and now considering 365/399 (removed 34) transitions.
// Phase 1: matrix 365 rows 411 cols
[2024-05-21 23:42:39] [INFO ] Computed 84 invariants in 8 ms
[2024-05-21 23:42:39] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 23:42:39] [INFO ] Invariant cache hit.
[2024-05-21 23:42:39] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-21 23:42:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 20/124 constraints. Problems are: Problem set: 12 solved, 352 unsolved
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 20/144 constraints. Problems are: Problem set: 24 solved, 340 unsolved
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 336 unsolved
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 20/184 constraints. Problems are: Problem set: 28 solved, 336 unsolved
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 5 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 20/204 constraints. Problems are: Problem set: 28 solved, 336 unsolved
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/776 variables, and 215 constraints, problems are : Problem set: 28 solved, 336 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 28 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 35/35 constraints. Problems are: Problem set: 28 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/35 constraints. Problems are: Problem set: 28 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 45/80 constraints. Problems are: Problem set: 28 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 4/84 constraints. Problems are: Problem set: 28 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 131/215 constraints. Problems are: Problem set: 28 solved, 336 unsolved
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 20/235 constraints. Problems are: Problem set: 34 solved, 330 unsolved
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 20/255 constraints. Problems are: Problem set: 34 solved, 330 unsolved
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 20/275 constraints. Problems are: Problem set: 36 solved, 328 unsolved
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 20/295 constraints. Problems are: Problem set: 36 solved, 328 unsolved
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 20/315 constraints. Problems are: Problem set: 36 solved, 328 unsolved
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/335 constraints. Problems are: Problem set: 36 solved, 328 unsolved
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 20/355 constraints. Problems are: Problem set: 36 solved, 328 unsolved
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/776 variables, and 356 constraints, problems are : Problem set: 36 solved, 328 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 272/272 constraints]
After SMT, in 60085ms problems are : Problem set: 36 solved, 328 unsolved
Search for dead transitions found 36 dead transitions in 60089ms
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 : 411/445 places, 329/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 408 transition count 329
Applied a total of 3 rules in 17 ms. Remains 408 /411 variables (removed 3) and now considering 329/329 (removed 0) transitions.
// Phase 1: matrix 329 rows 408 cols
[2024-05-21 23:43:40] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:43:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 23:43:40] [INFO ] Invariant cache hit.
[2024-05-21 23:43:40] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 408/445 places, 329/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61393 ms. Remains : 408/445 places, 329/399 transitions.
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:43:40] [INFO ] Input system was already deterministic with 329 transitions.
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:43:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4257966685346233857.gal : 2 ms
[2024-05-21 23:43:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8712644330003789882.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/CTLFireability4257966685346233857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8712644330003789882.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:44:10] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:44:10] [INFO ] Applying decomposition
[2024-05-21 23:44:10] [INFO ] Flatten gal took : 19 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/graph7327048380967694825.txt' '-o' '/tmp/graph7327048380967694825.bin' '-w' '/tmp/graph7327048380967694825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7327048380967694825.bin' '-l' '-1' '-v' '-w' '/tmp/graph7327048380967694825.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:10] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-21 23:44:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:44:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13150856690833310265.gal : 5 ms
[2024-05-21 23:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17800038846428656038.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/CTLFireability13150856690833310265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17800038846428656038.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 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 43 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
// Phase 1: matrix 354 rows 400 cols
[2024-05-21 23:44:41] [INFO ] Computed 84 invariants in 6 ms
[2024-05-21 23:44:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 23:44:41] [INFO ] Invariant cache hit.
[2024-05-21 23:44:41] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-21 23:44:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/184 constraints. Problems are: Problem set: 29 solved, 324 unsolved
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/204 constraints. Problems are: Problem set: 33 solved, 320 unsolved
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 33 solved, 320 unsolved
Search for dead transitions found 33 dead transitions in 30215ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/445 places, 321/399 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 398 transition count 321
Applied a total of 2 rules in 11 ms. Remains 398 /400 variables (removed 2) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 398 cols
[2024-05-21 23:45:11] [INFO ] Computed 88 invariants in 4 ms
[2024-05-21 23:45:11] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 23:45:11] [INFO ] Invariant cache hit.
[2024-05-21 23:45:12] [INFO ] Implicit Places using invariants and state equation in 372 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 618 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 397/445 places, 321/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 397 /397 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31401 ms. Remains : 397/445 places, 321/399 transitions.
[2024-05-21 23:45:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:12] [INFO ] Input system was already deterministic with 321 transitions.
[2024-05-21 23:45:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:45:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11988458881019663339.gal : 2 ms
[2024-05-21 23:45:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4081818964869082352.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/CTLFireability11988458881019663339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4081818964869082352.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-21 23:45:42] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:45:42] [INFO ] Applying decomposition
[2024-05-21 23:45:42] [INFO ] Flatten gal took : 13 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/graph13030876203027088401.txt' '-o' '/tmp/graph13030876203027088401.bin' '-w' '/tmp/graph13030876203027088401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13030876203027088401.bin' '-l' '-1' '-v' '-w' '/tmp/graph13030876203027088401.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:42] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:42] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-21 23:45:42] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-21 23:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12456750220702164711.gal : 16 ms
[2024-05-21 23:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5420458992557006906.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/CTLFireability12456750220702164711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5420458992557006906.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,3.87567e+24,7.65504,177292,8617,41,309953,573,868,686696,57,1459,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U EG((i0.i0.u0.p0==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,EX(TRUE)),(i0.i0.u0.p0==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t7, t143, t165, t185, t209, t218, t226, t230, t282, t284, t286, t288, t289, t290, t29...1143
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 402 transition count 356
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 402 transition count 356
Applied a total of 86 rules in 29 ms. Remains 402 /445 variables (removed 43) and now considering 356/399 (removed 43) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-21 23:46:12] [INFO ] Computed 84 invariants in 4 ms
[2024-05-21 23:46:12] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 23:46:12] [INFO ] Invariant cache hit.
[2024-05-21 23:46:13] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-21 23:46:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 14 solved, 341 unsolved
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 25 solved, 330 unsolved
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/144 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/164 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 20/184 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 4 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 20/224 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 20/244 constraints. Problems are: Problem set: 36 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/758 variables, and 244 constraints, problems are : Problem set: 36 solved, 319 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 36 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 36 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 36 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 36 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 36 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 160/244 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/264 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/284 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/304 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 20/324 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 4 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 4 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 20/344 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 20/364 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 20/384 constraints. Problems are: Problem set: 36 solved, 319 unsolved
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/758 variables, and 391 constraints, problems are : Problem set: 36 solved, 319 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 0/355 constraints, Known Traps: 307/307 constraints]
After SMT, in 60128ms problems are : Problem set: 36 solved, 319 unsolved
Search for dead transitions found 36 dead transitions in 60133ms
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 : 402/445 places, 320/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 399 transition count 320
Applied a total of 3 rules in 7 ms. Remains 399 /402 variables (removed 3) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 399 cols
[2024-05-21 23:47:13] [INFO ] Computed 90 invariants in 2 ms
[2024-05-21 23:47:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:47:13] [INFO ] Invariant cache hit.
[2024-05-21 23:47:13] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 399/445 places, 320/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61201 ms. Remains : 399/445 places, 320/399 transitions.
[2024-05-21 23:47:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:47:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:47:13] [INFO ] Input system was already deterministic with 320 transitions.
[2024-05-21 23:47:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10105342173675885425.gal : 1 ms
[2024-05-21 23:47:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15303958420531072146.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/CTLFireability10105342173675885425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15303958420531072146.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:47:43] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:47:43] [INFO ] Applying decomposition
[2024-05-21 23:47:43] [INFO ] Flatten gal took : 14 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/graph8011435718959128516.txt' '-o' '/tmp/graph8011435718959128516.bin' '-w' '/tmp/graph8011435718959128516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8011435718959128516.bin' '-l' '-1' '-v' '-w' '/tmp/graph8011435718959128516.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:44] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:44] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-21 23:47:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:47:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16163018727726381086.gal : 4 ms
[2024-05-21 23:47:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14363086664456821552.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/CTLFireability16163018727726381086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14363086664456821552.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.
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,3.87576e+24,2.43937,79024,5064,47,140259,864,843,363278,64,1765,0


Converting to forward existential form...Done !
original formula: EF((!(E((EG((i17.i1.u95.p310==1)) + EF((i0.i0.u1.p3==1))) U !((EX((i14.i1.u85.p266==1)) + (i16.i1.u88.p280==1))))) * (i4.u9.p22==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i4.u9.p22==0)) * !(E((EG((i17.i1.u95.p310==1)) + E(TRUE U (i0.i0.u1.p3==1))) U !((EX((i14....209
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t145, t187, t220, t228, t281, t283, t285, t287, t288, t289, t297, t298, t301, t303, t...1165
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 a local 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
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
(forward)formula 0,1,12.4032,370480,1,0,722052,864,5657,1.57594e+06,332,1765,1181599
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 355
Applied a total of 88 rules in 13 ms. Remains 401 /445 variables (removed 44) and now considering 355/399 (removed 44) transitions.
// Phase 1: matrix 355 rows 401 cols
[2024-05-21 23:47:56] [INFO ] Computed 84 invariants in 5 ms
[2024-05-21 23:47:56] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:47:56] [INFO ] Invariant cache hit.
[2024-05-21 23:47:57] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-05-21 23:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 15 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/124 constraints. Problems are: Problem set: 21 solved, 333 unsolved
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/144 constraints. Problems are: Problem set: 24 solved, 330 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 326 unsolved
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/184 constraints. Problems are: Problem set: 35 solved, 319 unsolved
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 20/204 constraints. Problems are: Problem set: 35 solved, 319 unsolved
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 4 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 20/224 constraints. Problems are: Problem set: 36 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/756 variables, and 224 constraints, problems are : Problem set: 36 solved, 318 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 36 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 36 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 36 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 36 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 36 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 140/224 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/244 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/264 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 20/284 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 45 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/304 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 17/321 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 13/334 constraints. Problems are: Problem set: 36 solved, 318 unsolved
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 60178ms, After SMT, problems are : Problem set: 36 solved, 318 unsolved
Search for dead transitions found 36 dead transitions in 60184ms
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 : 401/445 places, 319/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 319
Applied a total of 3 rules in 7 ms. Remains 398 /401 variables (removed 3) and now considering 319/319 (removed 0) transitions.
// Phase 1: matrix 319 rows 398 cols
[2024-05-21 23:48:57] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:48:57] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 23:48:57] [INFO ] Invariant cache hit.
[2024-05-21 23:48:57] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 398/445 places, 319/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61391 ms. Remains : 398/445 places, 319/399 transitions.
[2024-05-21 23:48:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:57] [INFO ] Input system was already deterministic with 319 transitions.
[2024-05-21 23:48:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:48:57] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2745108916415117352.gal : 2 ms
[2024-05-21 23:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14285343465871560531.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/CTLFireability2745108916415117352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14285343465871560531.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-21 23:49:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:28] [INFO ] Applying decomposition
[2024-05-21 23:49:28] [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/graph5326842317836659622.txt' '-o' '/tmp/graph5326842317836659622.bin' '-w' '/tmp/graph5326842317836659622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5326842317836659622.bin' '-l' '-1' '-v' '-w' '/tmp/graph5326842317836659622.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:28] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-21 23:49:28] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-21 23:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2923912875281733736.gal : 3 ms
[2024-05-21 23:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability387865948172738933.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/CTLFireability2923912875281733736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability387865948172738933.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 -...261
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,3.9394e+24,21.7247,436684,10609,54,709178,1026,815,1.92133e+06,60,2285,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 4 / 445 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 988 edges and 442 vertex of which 441 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 440 transition count 334
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 380 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 378 transition count 332
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 126 place count 378 transition count 250
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 303 place count 283 transition count 250
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 330 place count 256 transition count 223
Iterating global reduction 3 with 27 rules applied. Total rules applied 357 place count 256 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 256 transition count 220
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 364 place count 252 transition count 220
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 550 place count 157 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 552 place count 156 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 553 place count 156 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 155 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 555 place count 154 transition count 127
Applied a total of 555 rules in 37 ms. Remains 154 /445 variables (removed 291) and now considering 127/399 (removed 272) transitions.
// Phase 1: matrix 127 rows 154 cols
[2024-05-21 23:49:58] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 23:49:58] [INFO ] Implicit Places using invariants in 332 ms returned [0, 1, 4, 5, 6, 7, 21, 22, 23, 24, 25, 26, 50]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 336 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/445 places, 127/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 378 ms. Remains : 141/445 places, 127/399 transitions.
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:49:58] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7179310868571766760.gal : 3 ms
[2024-05-21 23:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2256482720391412958.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/CTLFireability7179310868571766760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2256482720391412958.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,3.64889e+09,4.37047,132120,2,7340,5,695810,6,0,691,387439,0


Converting to forward existential form...Done !
original formula: EF(((p306==1) + (((p40==1) * AF((((p183==1)&&(p344==1))&&(p503==1)))) * AG((p368==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p306==1))] != FALSE + [((FwdU(Init,TRUE) * ((p40==1) * !(EG(!((((p183==1)&&(p344==1))&&(p5...207
(forward)formula 0,1,4.3746,132120,1,0,7,695810,8,1,694,387439,1
FORMULA BusinessProcesses-PT-10-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 402 transition count 356
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 402 transition count 356
Applied a total of 86 rules in 13 ms. Remains 402 /445 variables (removed 43) and now considering 356/399 (removed 43) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-21 23:50:03] [INFO ] Computed 84 invariants in 5 ms
[2024-05-21 23:50:03] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 23:50:03] [INFO ] Invariant cache hit.
[2024-05-21 23:50:03] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-21 23:50:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 9 solved, 346 unsolved
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 28 solved, 327 unsolved
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/144 constraints. Problems are: Problem set: 32 solved, 323 unsolved
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
Problem TDEAD301 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/164 constraints. Problems are: Problem set: 33 solved, 322 unsolved
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 20/184 constraints. Problems are: Problem set: 33 solved, 322 unsolved
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 5 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 20/204 constraints. Problems are: Problem set: 34 solved, 321 unsolved
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 34 solved, 321 unsolved
Search for dead transitions found 34 dead transitions in 30166ms
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 : 402/445 places, 322/399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 401 transition count 322
Applied a total of 1 rules in 10 ms. Remains 401 /402 variables (removed 1) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 401 cols
[2024-05-21 23:50:33] [INFO ] Computed 90 invariants in 1 ms
[2024-05-21 23:50:33] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 23:50:33] [INFO ] Invariant cache hit.
[2024-05-21 23:50:34] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [143, 357]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 506 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 399/445 places, 322/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 399 /399 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31287 ms. Remains : 399/445 places, 322/399 transitions.
[2024-05-21 23:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:34] [INFO ] Input system was already deterministic with 322 transitions.
[2024-05-21 23:50:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5250459447619454988.gal : 1 ms
[2024-05-21 23:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6553304674499606854.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/CTLFireability5250459447619454988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6553304674499606854.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:51:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:51:04] [INFO ] Applying decomposition
[2024-05-21 23:51:04] [INFO ] Flatten gal took : 10 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/graph3549986634797886996.txt' '-o' '/tmp/graph3549986634797886996.bin' '-w' '/tmp/graph3549986634797886996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3549986634797886996.bin' '-l' '-1' '-v' '-w' '/tmp/graph3549986634797886996.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:04] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:04] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-21 23:51:04] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:51:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14206945702744347757.gal : 4 ms
[2024-05-21 23:51:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8454453421147644818.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/CTLFireability14206945702744347757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8454453421147644818.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,3.91065e+24,9.46198,214208,9021,40,422521,568,817,633081,55,1406,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 33 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
// Phase 1: matrix 354 rows 400 cols
[2024-05-21 23:51:34] [INFO ] Computed 84 invariants in 6 ms
[2024-05-21 23:51:34] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:51:34] [INFO ] Invariant cache hit.
[2024-05-21 23:51:35] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-21 23:51:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:41] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:42] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:43] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:44] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:45] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:45] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:45] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:46] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 340 unsolved
[2024-05-21 23:51:46] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:46] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:51:46] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:51:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:51:47] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:48] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:49] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:51:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 331 unsolved
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/184 constraints. Problems are: Problem set: 29 solved, 324 unsolved
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/204 constraints. Problems are: Problem set: 33 solved, 320 unsolved
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 (/ 1.0 2.0))
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 2.0))
(s158 0.0)
(s159 0.0)
(s160 (/ 1.0 2.0))
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/754 variables, and 214 constraints, problems are : Problem set: 33 solved, 320 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 33 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 33 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 33 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 33 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 33 solved, 320 unsolved
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 130/214 constraints. Problems are: Problem set: 35 solved, 318 unsolved
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 4 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/234 constraints. Problems are: Problem set: 35 solved, 318 unsolved
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/254 constraints. Problems are: Problem set: 35 solved, 318 unsolved
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:17] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/274 constraints. Problems are: Problem set: 35 solved, 318 unsolved
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/294 constraints. Problems are: Problem set: 36 solved, 317 unsolved
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/314 constraints. Problems are: Problem set: 36 solved, 317 unsolved
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 3 ms to minimize.
SMT process timed out in 60083ms, After SMT, problems are : Problem set: 36 solved, 317 unsolved
Search for dead transitions found 36 dead transitions in 60087ms
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 : 400/445 places, 318/399 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 318
Applied a total of 3 rules in 5 ms. Remains 397 /400 variables (removed 3) and now considering 318/318 (removed 0) transitions.
// Phase 1: matrix 318 rows 397 cols
[2024-05-21 23:52:35] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 23:52:35] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:52:35] [INFO ] Invariant cache hit.
[2024-05-21 23:52:35] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 397/445 places, 318/399 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61217 ms. Remains : 397/445 places, 318/399 transitions.
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:35] [INFO ] Input system was already deterministic with 318 transitions.
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10946831658448183089.gal : 2 ms
[2024-05-21 23:52:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2723958033102538210.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/CTLFireability10946831658448183089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2723958033102538210.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-21 23:53:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:53:05] [INFO ] Applying decomposition
[2024-05-21 23:53:05] [INFO ] Flatten gal took : 13 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/graph11628964703016109944.txt' '-o' '/tmp/graph11628964703016109944.bin' '-w' '/tmp/graph11628964703016109944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11628964703016109944.bin' '-l' '-1' '-v' '-w' '/tmp/graph11628964703016109944.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:05] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-21 23:53:05] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:53:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:53:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2253180498935832728.gal : 4 ms
[2024-05-21 23:53:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3817857308076179466.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/CTLFireability2253180498935832728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3817857308076179466.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 : 445/445 places, 399/399 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 416 transition count 370
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 416 transition count 370
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 407 transition count 361
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 407 transition count 361
Applied a total of 76 rules in 34 ms. Remains 407 /445 variables (removed 38) and now considering 361/399 (removed 38) transitions.
// Phase 1: matrix 361 rows 407 cols
[2024-05-21 23:53:36] [INFO ] Computed 84 invariants in 5 ms
[2024-05-21 23:53:36] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 23:53:36] [INFO ] Invariant cache hit.
[2024-05-21 23:53:36] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 23:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/104 constraints. Problems are: Problem set: 18 solved, 342 unsolved
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/124 constraints. Problems are: Problem set: 31 solved, 329 unsolved
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:53:50] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:53:50] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:53:50] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:53:50] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:53:50] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:53:51] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
Problem TDEAD270 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 20/144 constraints. Problems are: Problem set: 32 solved, 328 unsolved
[2024-05-21 23:53:53] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:53:53] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:53:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:53:55] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 20/164 constraints. Problems are: Problem set: 34 solved, 326 unsolved
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 20/184 constraints. Problems are: Problem set: 34 solved, 326 unsolved
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 20/204 constraints. Problems are: Problem set: 34 solved, 326 unsolved
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:54:06] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
SMT process timed out in 30084ms, After SMT, problems are : Problem set: 34 solved, 326 unsolved
Search for dead transitions found 34 dead transitions in 30088ms
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 : 407/445 places, 327/399 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 405 transition count 327
Applied a total of 2 rules in 6 ms. Remains 405 /407 variables (removed 2) and now considering 327/327 (removed 0) transitions.
// Phase 1: matrix 327 rows 405 cols
[2024-05-21 23:54:06] [INFO ] Computed 89 invariants in 4 ms
[2024-05-21 23:54:06] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 23:54:06] [INFO ] Invariant cache hit.
[2024-05-21 23:54:07] [INFO ] Implicit Places using invariants and state equation in 402 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 404/445 places, 327/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 404 /404 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31291 ms. Remains : 404/445 places, 327/399 transitions.
[2024-05-21 23:54:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:54:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:54:07] [INFO ] Input system was already deterministic with 327 transitions.
[2024-05-21 23:54:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:54:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:54:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14485651253934627794.gal : 2 ms
[2024-05-21 23:54:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10569221369395279652.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/CTLFireability14485651253934627794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10569221369395279652.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:37] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:54:37] [INFO ] Applying decomposition
[2024-05-21 23:54:37] [INFO ] Flatten gal took : 17 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/graph14022485737291526190.txt' '-o' '/tmp/graph14022485737291526190.bin' '-w' '/tmp/graph14022485737291526190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14022485737291526190.bin' '-l' '-1' '-v' '-w' '/tmp/graph14022485737291526190.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:37] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-21 23:54:37] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:54:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4460669749195314800.gal : 4 ms
[2024-05-21 23:54:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6308468214917980477.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/CTLFireability4460669749195314800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6308468214917980477.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.
[2024-05-21 23:55:07] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:55:07] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:55:07] [INFO ] Applying decomposition
[2024-05-21 23:55:07] [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/graph10439277794594654411.txt' '-o' '/tmp/graph10439277794594654411.bin' '-w' '/tmp/graph10439277794594654411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10439277794594654411.bin' '-l' '-1' '-v' '-w' '/tmp/graph10439277794594654411.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:07] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:07] [INFO ] Removed a total of 238 redundant transitions.
[2024-05-21 23:55:07] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:55:07] [INFO ] Time to serialize gal into /tmp/CTLFireability18440359018370391337.gal : 4 ms
[2024-05-21 23:55:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5229686832923670307.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/CTLFireability18440359018370391337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5229686832923670307.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.02031e+25,1536.16,12660492,248373,94,1.79088e+07,1029,1208,2.94068e+07,84,3887,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:22:10] [INFO ] Applying decomposition
[2024-05-22 00:22:10] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:22:10] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:10] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-22 00:22:10] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:22:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 13 ms.
[2024-05-22 00:22:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16803119600232885852.gal : 7 ms
[2024-05-22 00:22:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8962787761614101793.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/CTLFireability16803119600232885852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8962787761614101793.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.
ITS-tools command line returned an error code 137
[2024-05-22 00:28:37] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:28:37] [INFO ] Input system was already deterministic with 399 transitions.
[2024-05-22 00:28:37] [INFO ] Transformed 445 places.
[2024-05-22 00:28:37] [INFO ] Transformed 399 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability9934849281241243513.gal : 4 ms
[2024-05-22 00:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12501018355739166031.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/CTLFireability9934849281241243513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12501018355739166031.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-10"
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-10, 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-171620399700522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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