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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716334669299

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:37:51] [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:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:37:51] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-21 23:37:51] [INFO ] Transformed 567 places.
[2024-05-21 23:37:51] [INFO ] Transformed 508 transitions.
[2024-05-21 23:37:51] [INFO ] Found NUPN structural information;
[2024-05-21 23:37:51] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Deduced a syphon composed of 7 places in 14 ms
Reduce places removed 7 places and 7 transitions.
Support contains 129 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 499 transition count 444
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 499 transition count 444
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 143 place count 474 transition count 419
Iterating global reduction 1 with 25 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 106 ms. Remains 474 /560 variables (removed 86) and now considering 419/501 (removed 82) transitions.
// Phase 1: matrix 419 rows 474 cols
[2024-05-21 23:37:51] [INFO ] Computed 91 invariants in 29 ms
[2024-05-21 23:37:52] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-21 23:37:52] [INFO ] Invariant cache hit.
[2024-05-21 23:37:52] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-21 23:37:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 31 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 69 places in 652 ms of which 27 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 91 places in 1105 ms of which 3 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 91 places in 664 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 89 places in 233 ms of which 28 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 18 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 2 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 6 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 419/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31230 ms. Remains : 474/560 places, 419/501 transitions.
Support contains 129 out of 474 places after structural reductions.
[2024-05-21 23:38:22] [INFO ] Flatten gal took : 68 ms
[2024-05-21 23:38:23] [INFO ] Flatten gal took : 59 ms
[2024-05-21 23:38:23] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (296 resets) in 1808 ms. (22 steps per ms) remains 45/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
[2024-05-21 23:38:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 242/328 variables, 38/38 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 38/366 variables, 11/49 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 99/465 variables, 42/91 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 413/878 variables, 465/556 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 0/556 constraints. Problems are: Problem set: 3 solved, 42 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/891 variables, 7/563 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 6 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 29 places in 949 ms of which 2 ms to minimize.
SMT process timed out in 5215ms, After SMT, problems are : Problem set: 9 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 473 transition count 374
Reduce places removed 44 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 429 transition count 368
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 101 place count 423 transition count 368
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 101 place count 423 transition count 297
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 257 place count 338 transition count 297
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 270 place count 325 transition count 284
Iterating global reduction 3 with 13 rules applied. Total rules applied 283 place count 325 transition count 284
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 470 place count 230 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 230 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 472 place count 230 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 229 transition count 190
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 480 place count 229 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 481 place count 228 transition count 189
Applied a total of 481 rules in 168 ms. Remains 228 /474 variables (removed 246) and now considering 189/419 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 228/474 places, 189/419 transitions.
RANDOM walk for 40000 steps (1644 resets) in 855 ms. (46 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 56 ms. (70 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (31 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (26 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (29 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 645316 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :33 out of 36
Probabilistic random walk after 645316 steps, saw 105034 distinct states, run finished after 3005 ms. (steps per millisecond=214 ) properties seen :33
// Phase 1: matrix 189 rows 228 cols
[2024-05-21 23:38:33] [INFO ] Computed 74 invariants in 16 ms
[2024-05-21 23:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/121 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/184 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/190 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 182/374 variables, 192/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 40/414 variables, 34/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 12/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/416 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/417 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/417 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 35/121 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 6 (OVERLAPS) 63/184 variables, 23/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/190 variables, 6/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/192 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 182/374 variables, 192/254 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 40/414 variables, 34/289 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 12/301 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 1/302 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/416 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/417 variables, 2/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/417 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 305 constraints, problems are : Problem set: 2 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 608ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 189/189 transitions.
Graph (trivial) has 54 edges and 228 vertex of which 2 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 227 transition count 178
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 218 transition count 178
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 19 place count 218 transition count 155
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 68 place count 192 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 185 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 185 transition count 148
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 166 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 165 transition count 146
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 165 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 162 transition count 143
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 162 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 161 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 161 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 159 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 157 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 157 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 156 transition count 139
Applied a total of 138 rules in 59 ms. Remains 156 /228 variables (removed 72) and now considering 139/189 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 156/228 places, 139/189 transitions.
RANDOM walk for 40000 steps (2146 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 719 steps (6 resets) in 6 ms. (102 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:38:34] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 100 out of 474 places (down from 105) after GAL structural reductions.
Computed a total of 459 stabilizing places and 404 stable transitions
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 472 transition count 362
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 417 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 415 transition count 360
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 115 place count 415 transition count 270
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 312 place count 308 transition count 270
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 334 place count 286 transition count 248
Iterating global reduction 3 with 22 rules applied. Total rules applied 356 place count 286 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 356 place count 286 transition count 247
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 358 place count 285 transition count 247
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 551 place count 187 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 557 place count 187 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 186 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 185 transition count 151
Applied a total of 559 rules in 92 ms. Remains 185 /474 variables (removed 289) and now considering 151/419 (removed 268) transitions.
// Phase 1: matrix 151 rows 185 cols
[2024-05-21 23:38:34] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:38:34] [INFO ] Implicit Places using invariants in 520 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 184/474 places, 151/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 620 ms. Remains : 184/474 places, 151/419 transitions.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:38:34] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:38:35] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:38:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11713077022683866193.gal : 7 ms
[2024-05-21 23:38:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8579325157133558507.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/CTLFireability11713077022683866193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8579325157133558507.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,2.33426e+06,0.270656,14396,2,8409,5,33859,6,0,887,31093,0


Converting to forward existential form...Done !
original formula: A((AF((A(((((p85==1)&&(p292==1))&&(p451==1))||(p176==1)) U ((p333==1)||(p141==1))) * !((((p395==1)||(((p103==1)&&(p292==1))&&(p542==1)))|...333
=> equivalent forward existential formula: [((Init * !(EG(!(((p528==1) + E(TRUE U (((!(EG(!((p268==1)))) * ((p213==1)||(p7==1))) * !(EG(!((p8==1))))) + (p6...764
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t14, t15, t17, t18, t23, t61, t66, t67, t69, t70, t84, t85, t86, t87, t88, t91, ...321
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,29.4734,891540,1,0,1483,4.86927e+06,333,803,6916,5.5792e+06,1597
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 71 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
// Phase 1: matrix 385 rows 440 cols
[2024-05-21 23:39:04] [INFO ] Computed 91 invariants in 8 ms
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-21 23:39:05] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-21 23:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 15 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/131 constraints. Problems are: Problem set: 14 solved, 370 unsolved
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/151 constraints. Problems are: Problem set: 24 solved, 360 unsolved
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/171 constraints. Problems are: Problem set: 32 solved, 352 unsolved
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
Problem TDEAD344 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/191 constraints. Problems are: Problem set: 33 solved, 351 unsolved
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/211 constraints. Problems are: Problem set: 33 solved, 351 unsolved
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 4 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 11 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 5 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 33 solved, 351 unsolved
Search for dead transitions found 33 dead transitions in 30180ms
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 : 440/474 places, 352/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 438 transition count 352
Applied a total of 2 rules in 9 ms. Remains 438 /440 variables (removed 2) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 438 cols
[2024-05-21 23:39:36] [INFO ] Computed 95 invariants in 3 ms
[2024-05-21 23:39:36] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-21 23:39:36] [INFO ] Invariant cache hit.
[2024-05-21 23:39:36] [INFO ] Implicit Places using invariants and state equation in 321 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 719 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/474 places, 352/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 437 /437 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32171 ms. Remains : 437/474 places, 352/419 transitions.
[2024-05-21 23:39:36] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:39:36] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:39:37] [INFO ] Input system was already deterministic with 352 transitions.
[2024-05-21 23:39:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:39:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:39:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14775158900303319345.gal : 4 ms
[2024-05-21 23:39:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4814907656608574752.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/CTLFireability14775158900303319345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4814907656608574752.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,4.1963e+22,21.6344,592452,2,260110,5,1.36745e+06,6,0,2101,3.28234e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:40:07] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:40:07] [INFO ] Applying decomposition
[2024-05-21 23:40:07] [INFO ] Flatten gal took : 21 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/graph17731496614068690960.txt' '-o' '/tmp/graph17731496614068690960.bin' '-w' '/tmp/graph17731496614068690960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17731496614068690960.bin' '-l' '-1' '-v' '-w' '/tmp/graph17731496614068690960.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:07] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:07] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-21 23:40:07] [INFO ] Flatten gal took : 126 ms
[2024-05-21 23:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 39 ms.
[2024-05-21 23:40:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4980216836276092012.gal : 35 ms
[2024-05-21 23:40:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4504555307638269441.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/CTLFireability4980216836276092012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4504555307638269441.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.09958,31572,4097,41,45891,449,893,147474,57,947,0


Converting to forward existential form...Done !
original formula: (EF((EG((i7.i0.u46.p134==1)) * A(((i4.u13.p32==1)||(i17.i0.u90.p261==1)) U (i2.u40.p117==1)))) + AG(EX((EX((i18.i0.u140.p525==1)) + (((i1...209
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U (EG((i7.i0.u46.p134==1)) * !((E(!((i2.u40.p117==1)) U (!(((i4.u13.p32==1)||(i17.i0.u90...333
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t150, t158, t162, t170, t174, t198, t206, t218, t222, t240, t344, t345, t347, i0...1181
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an 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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 227 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1039 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 467 transition count 349
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 405 transition count 349
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 126 place count 405 transition count 256
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 354 place count 270 transition count 232
Iterating global reduction 2 with 24 rules applied. Total rules applied 378 place count 270 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 270 transition count 230
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 382 place count 268 transition count 230
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 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 567 place count 174 transition count 139
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 573 place count 174 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 574 place count 173 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 172 transition count 138
Applied a total of 575 rules in 69 ms. Remains 172 /474 variables (removed 302) and now considering 138/419 (removed 281) transitions.
// Phase 1: matrix 138 rows 172 cols
[2024-05-21 23:40:37] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:40:38] [INFO ] Implicit Places using invariants in 173 ms returned [53, 54, 55, 56]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 174 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/474 places, 138/419 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 252 ms. Remains : 168/474 places, 138/419 transitions.
[2024-05-21 23:40:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:40:38] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:40:38] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-21 23:40:38] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:40:38] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:40:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8566683896622214760.gal : 1 ms
[2024-05-21 23:40:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10907410426262075603.ctl : 9 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/CTLFireability8566683896622214760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10907410426262075603.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,29400,0.173514,9400,2,4199,5,18648,6,0,809,15374,0


Converting to forward existential form...Done !
original formula: EF((!(E(((!((((p85==1)&&(p292==1))&&(p533==1))||(((p94==1)&&(p292==1))&&(p542==1))))||(((p85==1)&&(p292==1))&&(p533==1))) U (((EG((p490==...241
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(((!((((p85==1)&&(p292==1))&&(p533==1))||(((p94==1)&&(p292==1))&&(p542==1))))||(((p85==1...322
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t10, t13, t45, t46, t47, t49, t62, t63, t64, t65, t66, t88, t90, t91, t98, t99, t...290
Hit Full ! (commute/partial/dont) 136/0/2
(forward)formula 0,0,1.92951,65024,1,0,222,177536,276,108,6347,118853,290
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 28 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
// Phase 1: matrix 385 rows 440 cols
[2024-05-21 23:40:40] [INFO ] Computed 91 invariants in 3 ms
[2024-05-21 23:40:40] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 23:40:40] [INFO ] Invariant cache hit.
[2024-05-21 23:40:40] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-21 23:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/131 constraints. Problems are: Problem set: 14 solved, 370 unsolved
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/151 constraints. Problems are: Problem set: 26 solved, 358 unsolved
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/171 constraints. Problems are: Problem set: 30 solved, 354 unsolved
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/191 constraints. Problems are: Problem set: 30 solved, 354 unsolved
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 3 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 353 unsolved
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 20/231 constraints. Problems are: Problem set: 32 solved, 352 unsolved
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 32 solved, 352 unsolved
Search for dead transitions found 32 dead transitions in 30199ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/474 places, 353/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 438 transition count 353
Applied a total of 2 rules in 8 ms. Remains 438 /440 variables (removed 2) and now considering 353/353 (removed 0) transitions.
// Phase 1: matrix 353 rows 438 cols
[2024-05-21 23:41:11] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 23:41:11] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 23:41:11] [INFO ] Invariant cache hit.
[2024-05-21 23:41:11] [INFO ] Implicit Places using invariants and state equation in 453 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 600 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/474 places, 353/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 437 /437 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31686 ms. Remains : 437/474 places, 353/419 transitions.
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:41:11] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5378037424712273361.gal : 2 ms
[2024-05-21 23:41:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4401531341230520195.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/CTLFireability5378037424712273361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4401531341230520195.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:41:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:41] [INFO ] Applying decomposition
[2024-05-21 23:41:41] [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/graph10400523208594389716.txt' '-o' '/tmp/graph10400523208594389716.bin' '-w' '/tmp/graph10400523208594389716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10400523208594389716.bin' '-l' '-1' '-v' '-w' '/tmp/graph10400523208594389716.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:42] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:42] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-21 23:41:42] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16827125158108727101.gal : 5 ms
[2024-05-21 23:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7487896734087547303.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/CTLFireability16827125158108727101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7487896734087547303.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.58906e+22,1.122,47716,5911,43,92125,598,921,138666,61,1316,0


Converting to forward existential form...Done !
original formula: E((i13.i1.u85.p250==1) U E(E(!(EX((i4.i0.u30.p87==1))) U E((((i9.i2.u72.p209==1)&&(i9.i2.u115.p382==1))&&(i9.i2.u139.p514==1)) U (i2.u17....188
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(i13.i1.u85.p250==1)),E(!(EX((i4.i0.u30.p87==1))) U E((((i9.i2.u72.p209==1)&&(i9.i2.u115.p382==...235
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t150, t158, t174, t186, t194, t206, t214, t218, t222, t240, t248, t344, t345, t3...1195
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 439 transition count 384
Applied a total of 70 rules in 23 ms. Remains 439 /474 variables (removed 35) and now considering 384/419 (removed 35) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-21 23:42:12] [INFO ] Computed 91 invariants in 10 ms
[2024-05-21 23:42:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:42:12] [INFO ] Invariant cache hit.
[2024-05-21 23:42:12] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2024-05-21 23:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-21 23:42:18] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 25 solved, 358 unsolved
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/131 constraints. Problems are: Problem set: 25 solved, 358 unsolved
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/151 constraints. Problems are: Problem set: 25 solved, 358 unsolved
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/171 constraints. Problems are: Problem set: 33 solved, 350 unsolved
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 4 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/191 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 5 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/211 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/823 variables, and 221 constraints, problems are : Problem set: 34 solved, 349 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 34 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 34 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 34 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 34 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 34 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 130/221 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/241 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/261 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/281 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 5 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/301 constraints. Problems are: Problem set: 34 solved, 349 unsolved
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/321 constraints. Problems are: Problem set: 35 solved, 348 unsolved
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 20/341 constraints. Problems are: Problem set: 36 solved, 347 unsolved
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 4 ms to minimize.
SMT process timed out in 60212ms, After SMT, problems are : Problem set: 36 solved, 347 unsolved
Search for dead transitions found 36 dead transitions in 60216ms
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 : 439/474 places, 348/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 437 transition count 348
Applied a total of 2 rules in 9 ms. Remains 437 /439 variables (removed 2) and now considering 348/348 (removed 0) transitions.
// Phase 1: matrix 348 rows 437 cols
[2024-05-21 23:43:12] [INFO ] Computed 98 invariants in 4 ms
[2024-05-21 23:43:13] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 23:43:13] [INFO ] Invariant cache hit.
[2024-05-21 23:43:13] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/474 places, 348/419 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61514 ms. Remains : 437/474 places, 348/419 transitions.
[2024-05-21 23:43:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:43:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:43:13] [INFO ] Input system was already deterministic with 348 transitions.
[2024-05-21 23:43:13] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:43:13] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4381764927451105954.gal : 3 ms
[2024-05-21 23:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3985262203835612784.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/CTLFireability4381764927451105954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3985262203835612784.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:43:43] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:43:43] [INFO ] Applying decomposition
[2024-05-21 23:43:43] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7179681905499384175.txt' '-o' '/tmp/graph7179681905499384175.bin' '-w' '/tmp/graph7179681905499384175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7179681905499384175.bin' '-l' '-1' '-v' '-w' '/tmp/graph7179681905499384175.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:43] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:43] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-21 23:43:43] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 22 ms.
[2024-05-21 23:43:44] [INFO ] Time to serialize gal into /tmp/CTLFireability484244220816241579.gal : 15 ms
[2024-05-21 23:43:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5821833132206550081.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/CTLFireability484244220816241579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5821833132206550081.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,4.1963e+22,0.892941,31636,4369,52,58068,743,897,95974,68,1587,0


Converting to forward existential form...Done !
original formula: !(E((i16.i1.u112.p375!=1) U AF(((((i9.i1.u45.p140==1)&&(i9.i1.u46.p143==1))&&(i9.i1.u47.p146==1)) + E((i10.i3.u157.p566==1) U EX((((i18.i...222
=> equivalent forward existential formula: [(FwdU(Init,(i16.i1.u112.p375!=1)) * !(EG(!(((((i9.i1.u45.p140==1)&&(i9.i1.u46.p143==1))&&(i9.i1.u47.p146==1)) +...270
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t151, t159, t175, t179, t191, t199, t211, t215, t223, t249, t339, t341, t343, i0.i0....1228
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 16 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-21 23:44:14] [INFO ] Computed 91 invariants in 9 ms
[2024-05-21 23:44:14] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 23:44:14] [INFO ] Invariant cache hit.
[2024-05-21 23:44:14] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 23:44:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 17 solved, 365 unsolved
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 351 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 30095ms, After SMT, problems are : Problem set: 31 solved, 351 unsolved
Search for dead transitions found 31 dead transitions in 30099ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 438/474 places, 352/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 438 /438 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30901 ms. Remains : 438/474 places, 352/419 transitions.
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:44:45] [INFO ] Input system was already deterministic with 352 transitions.
[2024-05-21 23:44:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6781195229817454214.gal : 3 ms
[2024-05-21 23:44:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6578123657616614564.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/CTLFireability6781195229817454214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6578123657616614564.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,4.1963e+22,21.7934,594864,2,262799,5,1.37211e+06,6,0,2105,3.28844e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:45:15] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:45:15] [INFO ] Applying decomposition
[2024-05-21 23:45:15] [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/graph7906685214535244690.txt' '-o' '/tmp/graph7906685214535244690.bin' '-w' '/tmp/graph7906685214535244690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7906685214535244690.bin' '-l' '-1' '-v' '-w' '/tmp/graph7906685214535244690.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:15] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:15] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-21 23:45:15] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:45:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-21 23:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4437070682763763904.gal : 6 ms
[2024-05-21 23:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8746835069331253506.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/CTLFireability4437070682763763904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8746835069331253506.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.51983,41084,4359,46,62569,414,936,205878,56,1198,0


Converting to forward existential form...Done !
original formula: E(AF((i9.i0.u44.p135==1)) U AG(EF(EX((i15.u88.p260==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((i9.i0.u44.p135==1))))) * !(E(TRUE U !(E(TRUE U EX((i15.u88.p260==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t150, t154, t162, t174, t190, t198, t206, t210, t218, t222, t248, t343, t345, t347, ...1152
(forward)formula 0,0,7.02772,191036,1,0,335589,414,5728,822411,252,1231,906547
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 43 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
// Phase 1: matrix 385 rows 440 cols
[2024-05-21 23:45:22] [INFO ] Computed 91 invariants in 10 ms
[2024-05-21 23:45:22] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 23:45:22] [INFO ] Invariant cache hit.
[2024-05-21 23:45:23] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-21 23:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 11 solved, 373 unsolved
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 4 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/131 constraints. Problems are: Problem set: 28 solved, 356 unsolved
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/151 constraints. Problems are: Problem set: 28 solved, 356 unsolved
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 4 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/171 constraints. Problems are: Problem set: 28 solved, 356 unsolved
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 5 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/191 constraints. Problems are: Problem set: 28 solved, 356 unsolved
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/211 constraints. Problems are: Problem set: 28 solved, 356 unsolved
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 28 solved, 356 unsolved
Search for dead transitions found 28 dead transitions in 30114ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/474 places, 357/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 440 /440 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30963 ms. Remains : 440/474 places, 357/419 transitions.
[2024-05-21 23:45:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:45:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:45:53] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-21 23:45:53] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:45:53] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:45:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2269755185073500261.gal : 15 ms
[2024-05-21 23:45:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4897961998089339798.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/CTLFireability2269755185073500261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4897961998089339798.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,4.28824e+22,19.6546,516008,2,264371,5,1.37503e+06,6,0,2118,2.32436e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:46:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:46:23] [INFO ] Applying decomposition
[2024-05-21 23:46:23] [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/graph15820766124368562855.txt' '-o' '/tmp/graph15820766124368562855.bin' '-w' '/tmp/graph15820766124368562855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15820766124368562855.bin' '-l' '-1' '-v' '-w' '/tmp/graph15820766124368562855.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:23] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:23] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 23:46:23] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 16 ms.
[2024-05-21 23:46:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9689890341902519258.gal : 19 ms
[2024-05-21 23:46:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11329708281456680018.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/CTLFireability9689890341902519258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11329708281456680018.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.28824e+22,2.82262,83120,5081,51,105318,539,959,584819,59,1515,0


Converting to forward existential form...Done !
original formula: EF(EG((AG(AX((i17.u116.p425==1))) + AX(AX((i17.u116.p478==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !(!(EX(!((i17.u116.p425==1))))))) + !(EX(!(!(EX(!((i17.u116.p478==1)))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t10, t152, t156, t160, t172, t176, t188, t192, t208, t216, t224, t250, t348, t349...1205
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,8.81294,248384,1,0,369327,539,6471,1.4924e+06,290,1609,921187
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 16 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
// Phase 1: matrix 386 rows 441 cols
[2024-05-21 23:46:32] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:46:32] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 23:46:32] [INFO ] Invariant cache hit.
[2024-05-21 23:46:33] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-21 23:46:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 6 solved, 379 unsolved
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:46:41] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 6 solved, 379 unsolved
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 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 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 8 solved, 377 unsolved
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 5 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 8 solved, 377 unsolved
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 1 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/191 constraints. Problems are: Problem set: 8 solved, 377 unsolved
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 20/211 constraints. Problems are: Problem set: 8 solved, 377 unsolved
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 20/231 constraints. Problems are: Problem set: 29 solved, 356 unsolved
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 29 solved, 356 unsolved
Search for dead transitions found 29 dead transitions in 30186ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 441/474 places, 357/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 441 /441 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31070 ms. Remains : 441/474 places, 357/419 transitions.
[2024-05-21 23:47:03] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:03] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:03] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-21 23:47:03] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:03] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10179544851296364497.gal : 2 ms
[2024-05-21 23:47:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5054472617303608276.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/CTLFireability10179544851296364497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5054472617303608276.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,4.19748e+22,27.5968,679376,2,273725,5,1.54399e+06,6,0,2122,3.83588e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:47:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:33] [INFO ] Applying decomposition
[2024-05-21 23:47:33] [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/graph17186435538771417057.txt' '-o' '/tmp/graph17186435538771417057.bin' '-w' '/tmp/graph17186435538771417057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17186435538771417057.bin' '-l' '-1' '-v' '-w' '/tmp/graph17186435538771417057.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:33] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:33] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-21 23:47:33] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:47:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5606964016195900413.gal : 3 ms
[2024-05-21 23:47:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16200336806494400242.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/CTLFireability5606964016195900413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16200336806494400242.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.19748e+22,1.19051,36148,5102,55,59955,616,952,104274,71,1478,0


Converting to forward existential form...Done !
original formula: AX(E((EX((((i7.u15.p44==1)&&(i12.u93.p281==1))&&(i16.u119.p528==1))) + AG((i16.u131.p465!=1))) U ((i14.u102.p325!=1) * EF(((AX((((i17.i0....351
=> equivalent forward existential formula: [(EY(Init) * !(E((EX((((i7.u15.p44==1)&&(i12.u93.p281==1))&&(i16.u119.p528==1))) + !(E(TRUE U !((i16.u131.p465!=...422
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t153, t165, t173, t181, t193, t201, t213, t221, t225, t243, t251, t348, t350, t3...1183
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 224 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1039 edges and 469 vertex of which 468 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 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 467 transition count 351
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 352 place count 272 transition count 234
Iterating global reduction 3 with 22 rules applied. Total rules applied 374 place count 272 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 374 place count 272 transition count 233
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 376 place count 271 transition count 233
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 583 place count 166 transition count 131
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 589 place count 166 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 590 place count 165 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 164 transition count 130
Applied a total of 591 rules in 46 ms. Remains 164 /474 variables (removed 310) and now considering 130/419 (removed 289) transitions.
// Phase 1: matrix 130 rows 164 cols
[2024-05-21 23:48:03] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:48:04] [INFO ] Implicit Places using invariants in 182 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 47, 48, 49, 50, 51, 52]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 184 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/474 places, 130/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 148/474 places, 130/419 transitions.
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:48:04] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16743638350060296505.gal : 2 ms
[2024-05-21 23:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10022574179884104006.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/CTLFireability16743638350060296505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10022574179884104006.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.
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,47436,0.077776,6636,2,1942,5,10521,6,0,720,9256,0


Converting to forward existential form...Done !
original formula: (AG((EF(EG((p519==0))) + (p358==0))) * (AF((E((p182==1) U (p418==1)) + (p490==1))) + EG(AF((((p72==0)||(p267==0))||(p448==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p358==0))) * !(E(TRUE U EG((p519==0)))))] = FALSE * [FwdG((Init * !(EG(!(EG(!((((p72==0...239
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t8, t37, t38, t39, t40, t41, t42, t65, t66, t67, t68, t69, t91, t92, t93, t102, t...272
(forward)formula 0,1,1.98262,63908,1,0,510,304133,267,271,5415,319044,632
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 19 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
// Phase 1: matrix 386 rows 441 cols
[2024-05-21 23:48:06] [INFO ] Computed 91 invariants in 8 ms
[2024-05-21 23:48:06] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 23:48:06] [INFO ] Invariant cache hit.
[2024-05-21 23:48:07] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-21 23:48:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/191 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 20/211 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 33 solved, 352 unsolved
Search for dead transitions found 33 dead transitions in 30168ms
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 : 441/474 places, 353/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 439 transition count 353
Applied a total of 2 rules in 6 ms. Remains 439 /441 variables (removed 2) and now considering 353/353 (removed 0) transitions.
// Phase 1: matrix 353 rows 439 cols
[2024-05-21 23:48:37] [INFO ] Computed 95 invariants in 3 ms
[2024-05-21 23:48:37] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 23:48:37] [INFO ] Invariant cache hit.
[2024-05-21 23:48:37] [INFO ] Implicit Places using invariants and state equation in 396 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 536 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 438/474 places, 353/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 438 /438 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31572 ms. Remains : 438/474 places, 353/419 transitions.
[2024-05-21 23:48:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:37] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-21 23:48:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1062421132891489158.gal : 2 ms
[2024-05-21 23:48:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6067022504107437806.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/CTLFireability1062421132891489158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6067022504107437806.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,4.56596e+22,29.3956,673736,2,291583,5,1.65297e+06,6,0,2106,3.46175e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:49:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:07] [INFO ] Applying decomposition
[2024-05-21 23:49:07] [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/graph4712423583405214845.txt' '-o' '/tmp/graph4712423583405214845.bin' '-w' '/tmp/graph4712423583405214845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4712423583405214845.bin' '-l' '-1' '-v' '-w' '/tmp/graph4712423583405214845.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:07] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:07] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-21 23:49:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6517591294344213500.gal : 2 ms
[2024-05-21 23:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15502759752885121424.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/CTLFireability6517591294344213500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15502759752885121424.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.56596e+22,2.21378,70788,6132,41,103282,534,884,305529,59,1196,0


Converting to forward existential form...Done !
original formula: E(!(EX(E(AF((((i1.u65.p186==1)&&(i11.u116.p381==1))&&(i16.u122.p528==1))) U ((i12.u114.p369!=1)&&((i16.u122.p409==1)||(i15.u101.p308==1))...280
=> equivalent forward existential formula: [((FwdU(Init,!(EX(E(!(EG(!((((i1.u65.p186==1)&&(i11.u116.p381==1))&&(i16.u122.p528==1))))) U ((i12.u114.p369!=1)...547
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t152, t160, t172, t180, t192, t200, t212, t220, t224, t242, t250, t344, t345, t348, ...1170
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 15 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
// Phase 1: matrix 385 rows 440 cols
[2024-05-21 23:49:38] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:49:38] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 23:49:38] [INFO ] Invariant cache hit.
[2024-05-21 23:49:38] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-21 23:49:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 27 solved, 357 unsolved
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:48] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/131 constraints. Problems are: Problem set: 27 solved, 357 unsolved
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/151 constraints. Problems are: Problem set: 27 solved, 357 unsolved
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/171 constraints. Problems are: Problem set: 27 solved, 357 unsolved
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/191 constraints. Problems are: Problem set: 30 solved, 354 unsolved
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/211 constraints. Problems are: Problem set: 30 solved, 354 unsolved
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
SMT process timed out in 30070ms, After SMT, problems are : Problem set: 30 solved, 354 unsolved
Search for dead transitions found 30 dead transitions in 30073ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/474 places, 355/419 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 355
Applied a total of 1 rules in 7 ms. Remains 439 /440 variables (removed 1) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 439 cols
[2024-05-21 23:50:08] [INFO ] Computed 93 invariants in 2 ms
[2024-05-21 23:50:09] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 23:50:09] [INFO ] Invariant cache hit.
[2024-05-21 23:50:09] [INFO ] Implicit Places using invariants and state equation in 378 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/474 places, 355/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 437 /437 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31384 ms. Remains : 437/474 places, 355/419 transitions.
[2024-05-21 23:50:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:09] [INFO ] Input system was already deterministic with 355 transitions.
[2024-05-21 23:50:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:09] [INFO ] Time to serialize gal into /tmp/CTLFireability5809326614301890241.gal : 2 ms
[2024-05-21 23:50:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4688535624164114137.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/CTLFireability5809326614301890241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4688535624164114137.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:50:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:39] [INFO ] Applying decomposition
[2024-05-21 23:50:39] [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/graph10657547890394443738.txt' '-o' '/tmp/graph10657547890394443738.bin' '-w' '/tmp/graph10657547890394443738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10657547890394443738.bin' '-l' '-1' '-v' '-w' '/tmp/graph10657547890394443738.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:39] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-21 23:50:39] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:50:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2024-05-21 23:50:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6849936429549905884.gal : 3 ms
[2024-05-21 23:50:39] [INFO ] Time to serialize properties into /tmp/CTLFireability975892579571342590.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/CTLFireability6849936429549905884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability975892579571342590.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,4.1963e+22,1.4999,41684,3685,43,56676,565,951,194134,63,1244,0


Converting to forward existential form...Done !
original formula: EX((((AG(((i3.u124.p437==1)||(i16.u110.p360==1))) + AF((i10.i1.u68.p204==1))) + (AG(AF((i13.i1.u103.p333==0))) + (((i6.i2.u28.p91==1)&&(i...242
=> equivalent forward existential formula: ((([(EY(Init) * !(E(TRUE U !(((i3.u124.p437==1)||(i16.u110.p360==1))))))] != FALSE + [(EY(Init) * !(EG(!((i10.i1...419
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t152, t160, t180, t192, t200, t208, t220, t224, t246, t250, t347, t348, t350, i0.i1....1220
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 38 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-21 23:51:09] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:51:09] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 23:51:09] [INFO ] Invariant cache hit.
[2024-05-21 23:51:10] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 23:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 17 solved, 365 unsolved
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:34] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 351 unsolved
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:36] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:51:37] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:51:38] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/231 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:51:39] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:51:40] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 34 solved, 348 unsolved
Search for dead transitions found 34 dead transitions in 30186ms
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 : 438/474 places, 349/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 436 transition count 349
Applied a total of 2 rules in 6 ms. Remains 436 /438 variables (removed 2) and now considering 349/349 (removed 0) transitions.
// Phase 1: matrix 349 rows 436 cols
[2024-05-21 23:51:40] [INFO ] Computed 96 invariants in 3 ms
[2024-05-21 23:51:40] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 23:51:40] [INFO ] Invariant cache hit.
[2024-05-21 23:51:41] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 446 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/474 places, 349/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 435 /435 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31353 ms. Remains : 435/474 places, 349/419 transitions.
[2024-05-21 23:51:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:51:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:51:41] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-21 23:51:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:51:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3864841237584135071.gal : 1 ms
[2024-05-21 23:51:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15706056717415256078.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/CTLFireability3864841237584135071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15706056717415256078.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,4.1963e+22,26.1768,593456,2,260053,5,1.36735e+06,6,0,2090,3.28231e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:52:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:52:11] [INFO ] Applying decomposition
[2024-05-21 23:52:11] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5957963181894333855.txt' '-o' '/tmp/graph5957963181894333855.bin' '-w' '/tmp/graph5957963181894333855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5957963181894333855.bin' '-l' '-1' '-v' '-w' '/tmp/graph5957963181894333855.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:11] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-21 23:52:11] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-21 23:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3489399433405896450.gal : 4 ms
[2024-05-21 23:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15360247758137899995.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/CTLFireability3489399433405896450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15360247758137899995.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.1963e+22,1.08547,38660,5405,42,65962,596,888,100418,59,1178,0


Converting to forward existential form...Done !
original formula: AG(EF((EX((i5.i1.u102.p329==1)) + AG((((i5.i0.u41.p126==0)||(i5.i1.u99.p317==0))||(i5.i0.u127.p469==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (EX((i5.i1.u102.p329==1)) + !(E(TRUE U !((((i5.i0.u41.p126==0)||(i5.i1.u99.p317==...197
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t154, t158, t178, t194, t198, t210, t214, t222, t248, t341, t342, t344, i0.t150, i0....1172
(forward)formula 0,1,15.8937,489572,1,0,995703,682,5605,1.41159e+06,285,1483,2640494
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 41 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
// Phase 1: matrix 386 rows 441 cols
[2024-05-21 23:52:27] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:52:27] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 23:52:27] [INFO ] Invariant cache hit.
[2024-05-21 23:52:27] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-21 23:52:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 20 solved, 365 unsolved
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 27 solved, 358 unsolved
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 27 solved, 358 unsolved
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 30 solved, 355 unsolved
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:52:47] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:48] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:48] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:52:48] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/191 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:52:49] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 20/211 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:52:54] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 6 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 20/231 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:57] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 34 solved, 351 unsolved
Search for dead transitions found 34 dead transitions in 30119ms
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 : 441/474 places, 352/419 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 352
Applied a total of 1 rules in 6 ms. Remains 440 /441 variables (removed 1) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 440 cols
[2024-05-21 23:52:58] [INFO ] Computed 97 invariants in 5 ms
[2024-05-21 23:52:58] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 23:52:58] [INFO ] Invariant cache hit.
[2024-05-21 23:52:58] [INFO ] Implicit Places using invariants and state equation in 295 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 465 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 438/474 places, 352/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 438 /438 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31339 ms. Remains : 438/474 places, 352/419 transitions.
[2024-05-21 23:52:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:52:58] [INFO ] Input system was already deterministic with 352 transitions.
[2024-05-21 23:52:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3947909851738171525.gal : 2 ms
[2024-05-21 23:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2700518284969568835.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/CTLFireability3947909851738171525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2700518284969568835.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,4.34007e+22,24.8799,640748,2,274421,5,1.44673e+06,6,0,2105,3.60883e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:53:28] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:53:28] [INFO ] Applying decomposition
[2024-05-21 23:53:28] [INFO ] Flatten gal took : 6 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/graph7752051540377364232.txt' '-o' '/tmp/graph7752051540377364232.bin' '-w' '/tmp/graph7752051540377364232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7752051540377364232.bin' '-l' '-1' '-v' '-w' '/tmp/graph7752051540377364232.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:28] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-21 23:53:28] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9531229485340702918.gal : 9 ms
[2024-05-21 23:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15078735496509009096.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/CTLFireability9531229485340702918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15078735496509009096.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.34007e+22,0.737327,32704,4458,51,53059,1268,937,90589,63,2844,0


Converting to forward existential form...Done !
original formula: (EF((i8.i1.u72.p214==1)) * EX(AX(EG((i17.u121.p420==0)))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U (i8.i1.u72.p214==1)))) * !(EX(!(EG((i17.u121.p420==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t152, t161, t165, t177, t181, t193, t201, t217, t225, t251, t343, t345, i0.i0.u74.t1...1227
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 472 transition count 360
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 415 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 413 transition count 358
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 119 place count 413 transition count 260
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 333 place count 297 transition count 260
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 356 place count 274 transition count 237
Iterating global reduction 3 with 23 rules applied. Total rules applied 379 place count 274 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 379 place count 274 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 383 place count 272 transition count 235
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 584 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 590 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 168 transition count 135
Applied a total of 592 rules in 65 ms. Remains 168 /474 variables (removed 306) and now considering 135/419 (removed 284) transitions.
// Phase 1: matrix 135 rows 168 cols
[2024-05-21 23:53:58] [INFO ] Computed 69 invariants in 3 ms
[2024-05-21 23:53:59] [INFO ] Implicit Places using invariants in 120 ms returned [41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 121 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/474 places, 135/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 189 ms. Remains : 159/474 places, 135/419 transitions.
[2024-05-21 23:53:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:59] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-21 23:53:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12151485930415406722.gal : 1 ms
[2024-05-21 23:53:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18029065405241700732.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/CTLFireability12151485930415406722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18029065405241700732.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.
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,100572,0.162952,10136,2,4189,5,23196,6,0,769,20333,0


Converting to forward existential form...Done !
original formula: EF((EG((((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&(p445==1)))) * (p462==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p462==1)),(((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&...177
(forward)formula 0,0,0.778435,36492,1,0,9,124276,19,3,4387,39312,6
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 26 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-21 23:53:59] [INFO ] Computed 91 invariants in 3 ms
[2024-05-21 23:54:00] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 23:54:00] [INFO ] Invariant cache hit.
[2024-05-21 23:54:00] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 23:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:54:10] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 17 solved, 365 unsolved
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:54:16] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:54:16] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:16] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:54:16] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:17] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:54:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:21] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:54:22] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 351 unsolved
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/231 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 1 ms to minimize.
SMT process timed out in 30091ms, After SMT, problems are : Problem set: 34 solved, 348 unsolved
Search for dead transitions found 34 dead transitions in 30095ms
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 : 438/474 places, 349/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 436 transition count 349
Applied a total of 2 rules in 5 ms. Remains 436 /438 variables (removed 2) and now considering 349/349 (removed 0) transitions.
// Phase 1: matrix 349 rows 436 cols
[2024-05-21 23:54:30] [INFO ] Computed 96 invariants in 2 ms
[2024-05-21 23:54:30] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 23:54:30] [INFO ] Invariant cache hit.
[2024-05-21 23:54:31] [INFO ] Implicit Places using invariants and state equation in 296 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/474 places, 349/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 435 /435 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31238 ms. Remains : 435/474 places, 349/419 transitions.
[2024-05-21 23:54:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:31] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-21 23:54:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14874904829492087277.gal : 1 ms
[2024-05-21 23:54:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2666357923392471824.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/CTLFireability14874904829492087277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2666357923392471824.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,4.1963e+22,22.3353,593868,2,260053,5,1.36735e+06,6,0,2090,3.28231e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:55:01] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:55:01] [INFO ] Applying decomposition
[2024-05-21 23:55:01] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7134632751550084748.txt' '-o' '/tmp/graph7134632751550084748.bin' '-w' '/tmp/graph7134632751550084748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7134632751550084748.bin' '-l' '-1' '-v' '-w' '/tmp/graph7134632751550084748.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:01] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:01] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-21 23:55:01] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:55:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:55:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1515591267932302107.gal : 4 ms
[2024-05-21 23:55:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14438303481255492655.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/CTLFireability1515591267932302107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14438303481255492655.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.1963e+22,0.448325,20556,2969,40,33155,579,918,55505,61,1283,0


Converting to forward existential form...Done !
original formula: (AX((i9.i1.u47.p141==1)) + EF(EG((i2.u63.p185==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U EG((i2.u63.p185==1)))))) * !((i9.i1.u47.p141==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t150, t158, t178, t190, t198, t210, t218, t222, t240, t248, t340, t342, t344, i0.i0....1196
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 an 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 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
(forward)formula 0,0,4.00586,158892,1,0,362193,579,5467,450758,296,1283,793643
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 35 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-21 23:55:05] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:55:05] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 23:55:05] [INFO ] Invariant cache hit.
[2024-05-21 23:55:06] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 23:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 17 solved, 365 unsolved
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 4 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 359 unsolved
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 351 unsolved
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/231 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 27 places in 98 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 1.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 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.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 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.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 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.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 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(timeout
s206 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/821 variables, and 238 constraints, problems are : Problem set: 34 solved, 348 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 147/147 constraints]
Escalating to Integer solving :Problem set: 34 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 34 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 34 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 34 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 34 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 147/238 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:39] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:39] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:40] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:55:41] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:42] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/258 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:43] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:43] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:55:43] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:55:43] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:44] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:55:45] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/278 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:46] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:55:47] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:55:48] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:55:49] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:49] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:55:49] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:50] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:50] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/298 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:50] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:55:51] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:51] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 4 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/318 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:55:57] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:55:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:55:59] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/338 constraints. Problems are: Problem set: 34 solved, 348 unsolved
[2024-05-21 23:55:59] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:59] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:56:00] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:56:01] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:56:02] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/358 constraints. Problems are: Problem set: 34 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/821 variables, and 358 constraints, problems are : Problem set: 34 solved, 348 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 0/382 constraints, Known Traps: 267/267 constraints]
After SMT, in 60102ms problems are : Problem set: 34 solved, 348 unsolved
Search for dead transitions found 34 dead transitions in 60108ms
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 : 438/474 places, 349/419 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 436 transition count 349
Applied a total of 2 rules in 13 ms. Remains 436 /438 variables (removed 2) and now considering 349/349 (removed 0) transitions.
// Phase 1: matrix 349 rows 436 cols
[2024-05-21 23:56:06] [INFO ] Computed 96 invariants in 4 ms
[2024-05-21 23:56:06] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 23:56:06] [INFO ] Invariant cache hit.
[2024-05-21 23:56:06] [INFO ] Implicit Places using invariants and state equation in 481 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 723 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/474 places, 349/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 435 /435 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61524 ms. Remains : 435/474 places, 349/419 transitions.
[2024-05-21 23:56:06] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:06] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:56:06] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-21 23:56:06] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:56:06] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:56:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9627864096927816676.gal : 4 ms
[2024-05-21 23:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14514672172273357795.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/CTLFireability9627864096927816676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14514672172273357795.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,4.1963e+22,23.6314,592528,2,260053,5,1.36735e+06,6,0,2090,3.28231e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:56:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:56:37] [INFO ] Applying decomposition
[2024-05-21 23:56:37] [INFO ] Flatten gal took : 6 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/graph10650517941113976858.txt' '-o' '/tmp/graph10650517941113976858.bin' '-w' '/tmp/graph10650517941113976858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10650517941113976858.bin' '-l' '-1' '-v' '-w' '/tmp/graph10650517941113976858.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:56:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:56:37] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-21 23:56:37] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 18 ms.
[2024-05-21 23:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5932387423170111698.gal : 4 ms
[2024-05-21 23:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability189277811649252775.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/CTLFireability5932387423170111698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability189277811649252775.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,4.1963e+22,0.839425,26972,5590,30,50023,465,847,67583,47,1109,0


Converting to forward existential form...Done !
original formula: AG((!(E((i6.u13.p30==1) U (i11.i0.u59.p173==1))) + AX(FALSE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E((i6.u13.p30==1) U (i11.i0.u59.p173==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t158, t162, t174, t178, t194, t206, t214, t218, t222, t240, t248, t340, t342, t344, ...1129
(forward)formula 0,0,5.93514,226820,1,0,505551,465,5577,571014,216,1109,1639651
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 23:56:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:56:43] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:56:43] [INFO ] Applying decomposition
[2024-05-21 23:56:43] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11052774826632851894.txt' '-o' '/tmp/graph11052774826632851894.bin' '-w' '/tmp/graph11052774826632851894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11052774826632851894.bin' '-l' '-1' '-v' '-w' '/tmp/graph11052774826632851894.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:56:43] [INFO ] Decomposing Gal with order
[2024-05-21 23:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:56:43] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-21 23:56:43] [INFO ] Flatten gal took : 64 ms
[2024-05-21 23:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:56:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9216464628998209507.gal : 17 ms
[2024-05-21 23:56:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9918274336513667752.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/CTLFireability9216464628998209507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9918274336513667752.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 7 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,5.53973e+22,2.08723,67520,7412,81,117070,898,1057,365340,71,2337,0


Converting to forward existential form...Done !
original formula: (EF((EG((i13.i0.i0.u49.p134==1)) * A(((i11.u14.p32==1)||(i10.u95.p261==1)) U (i9.u43.p117==1)))) + AG(EX((EX((i15.u164.p525==1)) + (((i16...211
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U (EG((i13.i0.i0.u49.p134==1)) * !((E(!((i9.u43.p117==1)) U (!(((i11.u14.p32==1)||(i10.u...335
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t176, t180, t190, t198, t206, t214, t218, t226, t238, t246, t250, t270, t411,...1444
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,824.718,2952896,1,0,3.82484e+06,933,3443,2.0847e+07,178,3178,1481241
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((i13.i1.i0.u89.p250==1) U E(E(!(EX((i12.u31.p87==1))) U E((((i14.u75.p209==1)&&(i14.u128.p382==1))&&(i6.u161.p514==1)) U (i11.u16.p38==...187
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(i13.i1.i0.u89.p250==1)),E(!(EX((i12.u31.p87==1))) U E((((i14.u75.p209==1)&&(i14.u128.p382==1))...234
(forward)formula 1,1,940.204,3248272,1,0,5.23755e+06,933,2374,2.0847e+07,138,3178,372436
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-22 00:23:00] [INFO ] Applying decomposition
[2024-05-22 00:23:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:00] [INFO ] Decomposing Gal with order
[2024-05-22 00:23:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:23:00] [INFO ] Removed a total of 127 redundant transitions.
[2024-05-22 00:23:00] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:23:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 76 ms.
[2024-05-22 00:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10824285096116799958.gal : 5 ms
[2024-05-22 00:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8689103564369880339.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/CTLFireability10824285096116799958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8689103564369880339.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 5 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,5.53973e+22,525.697,10561000,132754,1895,4.44521e+06,11778,1694,1.33874e+08,450,42971,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-22 00:36:37] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:36:37] [INFO ] Input system was already deterministic with 419 transitions.
[2024-05-22 00:36:37] [INFO ] Transformed 474 places.
[2024-05-22 00:36:37] [INFO ] Transformed 419 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:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3105925235145744557.gal : 1 ms
[2024-05-22 00:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3494876835227848154.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/CTLFireability3105925235145744557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3494876835227848154.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 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-11"
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-11, 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-171620399700530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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