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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716335936547

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:58:57] [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:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:58:58] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-21 23:58:58] [INFO ] Transformed 624 places.
[2024-05-21 23:58:58] [INFO ] Transformed 564 transitions.
[2024-05-21 23:58:58] [INFO ] Found NUPN structural information;
[2024-05-21 23:58:58] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 135 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 73 place count 543 transition count 488
Iterating global reduction 1 with 68 rules applied. Total rules applied 141 place count 543 transition count 488
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 175 place count 509 transition count 454
Iterating global reduction 1 with 34 rules applied. Total rules applied 209 place count 509 transition count 454
Applied a total of 209 rules in 240 ms. Remains 509 /616 variables (removed 107) and now considering 454/556 (removed 102) transitions.
// Phase 1: matrix 454 rows 509 cols
[2024-05-21 23:58:58] [INFO ] Computed 94 invariants in 44 ms
[2024-05-21 23:58:59] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-21 23:58:59] [INFO ] Invariant cache hit.
[2024-05-21 23:59:02] [INFO ] Implicit Places using invariants and state equation in 3337 ms returned []
Implicit Place search using SMT with State Equation took 4278 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-21 23:59:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:13] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 27 ms to minimize.
[2024-05-21 23:59:13] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:59:13] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 113 places in 6640 ms of which 5 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:59:20] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:59:21] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:59:22] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:59:22] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:22] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:59:22] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:59:22] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:59:23] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 7 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:59:25] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:59:26] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:59:27] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 6 ms to minimize.
[2024-05-21 23:59:28] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:59:28] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:59:28] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 4 ms to minimize.
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:59:32] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:59:33] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:59:33] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:59:33] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/963 variables, and 163 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 69/163 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:37] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:59:38] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:59:39] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:59:40] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:59:41] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 114 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 118 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 102 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 4 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 116 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:47] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:49] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 116 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:59:52] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 118 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:59:54] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:59:54] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:54] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 115 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:59:56] [INFO ] Deduced a trap composed of 115 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:59:59] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:00:00] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 4 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 110 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/963 variables, and 343 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 249/249 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Starting structural reductions in LTL mode, iteration 1 : 509/616 places, 454/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64962 ms. Remains : 509/616 places, 454/556 transitions.
Support contains 135 out of 509 places after structural reductions.
[2024-05-22 00:00:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:00:03] [INFO ] Flatten gal took : 64 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:00:03] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:00:03] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 129 out of 509 places (down from 135) after GAL structural reductions.
RANDOM walk for 40000 steps (272 resets) in 1798 ms. (22 steps per ms) remains 46/76 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
[2024-05-22 00:00:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 296/391 variables, 50/50 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 16/407 variables, 5/55 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (OVERLAPS) 94/501 variables, 39/94 constraints. Problems are: Problem set: 3 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 449/950 variables, 501/595 constraints. Problems are: Problem set: 3 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 0/595 constraints. Problems are: Problem set: 3 solved, 43 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 9 (OVERLAPS) 12/962 variables, 7/602 constraints. Problems are: Problem set: 6 solved, 40 unsolved
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 6 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 5106ms, After SMT, problems are : Problem set: 6 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 508 transition count 413
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 88 place count 468 transition count 406
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 461 transition count 406
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 95 place count 461 transition count 330
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 256 place count 376 transition count 330
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 264 place count 368 transition count 322
Iterating global reduction 3 with 8 rules applied. Total rules applied 272 place count 368 transition count 322
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 472 place count 266 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 473 place count 266 transition count 223
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 478 place count 266 transition count 223
Applied a total of 478 rules in 74 ms. Remains 266 /509 variables (removed 243) and now considering 223/454 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 266/509 places, 223/454 transitions.
RANDOM walk for 40000 steps (1192 resets) in 754 ms. (52 steps per ms) remains 29/40 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (20 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (21 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (23 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (14 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (25 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
// Phase 1: matrix 223 rows 266 cols
[2024-05-22 00:00:10] [INFO ] Computed 81 invariants in 11 ms
[2024-05-22 00:00:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 134/188 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 20/208 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 54/262 variables, 26/81 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 222/484 variables, 262/343 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 5/489 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
Problem AtomicPropp56 is UNSAT
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 13/361 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/361 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/489 variables, 0/361 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 361 constraints, problems are : Problem set: 4 solved, 25 unsolved in 2920 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 266/266 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 4 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 92/135 variables, 17/17 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/23 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/25 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/26 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/26 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 71/206 variables, 38/64 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/67 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 20/87 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 3 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 20/107 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:00:16] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 2/109 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/109 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 56/262 variables, 26/135 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 5/140 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 5/145 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 4/149 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 3/152 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 0/152 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 222/484 variables, 262/414 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 1/415 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/484 variables, 24/439 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 20/459 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:00:23] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 20/479 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 20/499 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 9/508 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/508 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 27 (OVERLAPS) 5/489 variables, 4/512 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/489 variables, 2/514 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/489 variables, 11/525 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/489 variables, 2/527 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/489 variables, 1/528 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/489 variables, 4/532 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/489 variables, 0/532 constraints. Problems are: Problem set: 5 solved, 24 unsolved
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/489 variables, 3/535 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/489 variables, 0/535 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 36 (OVERLAPS) 0/489 variables, 0/535 constraints. Problems are: Problem set: 5 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 535 constraints, problems are : Problem set: 5 solved, 24 unsolved in 29977 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 266/266 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/29 constraints, Known Traps: 163/163 constraints]
After SMT, in 32926ms problems are : Problem set: 5 solved, 24 unsolved
Parikh walk visited 22 properties in 2451 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 223/223 transitions.
Graph (trivial) has 77 edges and 266 vertex of which 2 / 266 are part of one of the 1 SCC in 2 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 265 transition count 202
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 246 transition count 202
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 39 place count 246 transition count 181
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 89 place count 217 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 101 place count 205 transition count 169
Iterating global reduction 2 with 12 rules applied. Total rules applied 113 place count 205 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 113 place count 205 transition count 167
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 117 place count 203 transition count 167
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 67 rules applied. Total rules applied 184 place count 169 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 186 place count 168 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 168 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 166 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 165 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 164 transition count 134
Applied a total of 192 rules in 48 ms. Remains 164 /266 variables (removed 102) and now considering 134/223 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 164/266 places, 134/223 transitions.
RANDOM walk for 40000 steps (1593 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (772 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 11315 steps (72 resets) in 23 ms. (471 steps per ms) remains 0/2 properties
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:00:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:00:45] [INFO ] Flatten gal took : 26 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:00:45] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:00:45] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 81 out of 509 places (down from 90) after GAL structural reductions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 252 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 146 place count 429 transition count 278
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 352 place count 318 transition count 278
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 378 place count 292 transition count 252
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 405 place count 291 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 405 place count 291 transition count 249
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 411 place count 288 transition count 249
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 639 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 171 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 170 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 643 place count 169 transition count 135
Applied a total of 643 rules in 47 ms. Remains 169 /509 variables (removed 340) and now considering 135/454 (removed 319) transitions.
// Phase 1: matrix 135 rows 169 cols
[2024-05-22 00:00:46] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:00:46] [INFO ] Implicit Places using invariants in 278 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 25, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 280 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/509 places, 135/454 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 332 ms. Remains : 150/509 places, 135/454 transitions.
[2024-05-22 00:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:46] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-22 00:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:00:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:00:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7269404635481322353.gal : 12 ms
[2024-05-22 00:00:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17120318556629188633.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/CTLFireability7269404635481322353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17120318556629188633.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,153324,0.098226,8360,2,2473,5,16433,6,0,734,14732,0


Converting to forward existential form...Done !
original formula: !(E(!(EG(AF(((p155==1)||(p430==1))))) U !(EF(((EF((p578==1)) * (p572!=1)) * (p350==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(EG(!(((p155==1)||(p430==1)))))))) * !(E(TRUE U ((E(TRUE U (p578==1)) * (p572!=1)) * (p350==1)...168
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t22, t24, t27, t29, t30, t31, t32, t33, t34, t49, t50, t51, t52, t53, t91, t92, t...277
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.40685,93632,1,0,443,453822,274,304,5602,492109,611
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-00 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 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 468 transition count 413
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 39 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
// Phase 1: matrix 413 rows 468 cols
[2024-05-22 00:00:48] [INFO ] Computed 94 invariants in 10 ms
[2024-05-22 00:00:49] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 00:00:49] [INFO ] Invariant cache hit.
[2024-05-22 00:00:49] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:00:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/114 constraints. Problems are: Problem set: 10 solved, 402 unsolved
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:01:00] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/134 constraints. Problems are: Problem set: 24 solved, 388 unsolved
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:01:06] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:01:07] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/154 constraints. Problems are: Problem set: 24 solved, 388 unsolved
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:01:11] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:01:11] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:11] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:01:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:01:12] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:01:12] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:01:12] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/174 constraints. Problems are: Problem set: 24 solved, 388 unsolved
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 5 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/194 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 26 solved, 386 unsolved
Search for dead transitions found 26 dead transitions in 30189ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/509 places, 387/454 transitions.
Applied a total of 0 rules in 7 ms. Remains 468 /468 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30942 ms. Remains : 468/509 places, 387/454 transitions.
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:19] [INFO ] Input system was already deterministic with 387 transitions.
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14793427912416860783.gal : 5 ms
[2024-05-22 00:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1115513728873313169.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/CTLFireability14793427912416860783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1115513728873313169.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:01:50] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:01:50] [INFO ] Applying decomposition
[2024-05-22 00:01:50] [INFO ] Flatten gal took : 26 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/graph5362009120916629730.txt' '-o' '/tmp/graph5362009120916629730.bin' '-w' '/tmp/graph5362009120916629730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5362009120916629730.bin' '-l' '-1' '-v' '-w' '/tmp/graph5362009120916629730.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:01:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:01:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:01:50] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-22 00:01:50] [INFO ] Flatten gal took : 72 ms
[2024-05-22 00:01:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 19 ms.
[2024-05-22 00:01:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5588666502908401390.gal : 15 ms
[2024-05-22 00:01:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16851899743607750382.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/CTLFireability5588666502908401390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16851899743607750382.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,2.22484e+26,8.69454,247044,12785,72,442851,1384,995,705504,74,3419,0


Converting to forward existential form...Done !
original formula: E((i14.u87.p270==1) U (!(EF((EF((i17.u124.p430==1)) * AX((i16.i1.u105.p339==1))))) * (A((i7.i0.u19.p57!=1) U !((((i4.u33.p109==1)||(((i4....333
=> equivalent forward existential formula: ([(((FwdU(Init,(i14.u87.p270==1)) * !(E(TRUE U (E(TRUE U (i17.u124.p430==1)) * !(EX(!((i16.i1.u105.p339==1))))))...917
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t168, t240, t262, t267, t276, t356, t357, t366, t367, t374, t379, t380, i0.i0.u125.t...1260
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 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 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 18 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
// Phase 1: matrix 415 rows 470 cols
[2024-05-22 00:02:20] [INFO ] Computed 94 invariants in 11 ms
[2024-05-22 00:02:20] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-22 00:02:20] [INFO ] Invariant cache hit.
[2024-05-22 00:02:21] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 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
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 99 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 29 solved, 385 unsolved
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 27 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 99 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:02:41] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/194 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/214 constraints. Problems are: Problem set: 33 solved, 381 unsolved
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
SMT process timed out in 30092ms, After SMT, problems are : Problem set: 33 solved, 381 unsolved
Search for dead transitions found 33 dead transitions in 30097ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/509 places, 382/454 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 382
Applied a total of 2 rules in 8 ms. Remains 468 /470 variables (removed 2) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 468 cols
[2024-05-22 00:02:51] [INFO ] Computed 98 invariants in 3 ms
[2024-05-22 00:02:51] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 00:02:51] [INFO ] Invariant cache hit.
[2024-05-22 00:02:52] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 467/509 places, 382/454 transitions.
Applied a total of 0 rules in 5 ms. Remains 467 /467 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31652 ms. Remains : 467/509 places, 382/454 transitions.
[2024-05-22 00:02:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:02:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:02:52] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-22 00:02:52] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:02:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:02:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2746918687171833389.gal : 18 ms
[2024-05-22 00:02:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15775874125798498405.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/CTLFireability2746918687171833389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15775874125798498405.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:03:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:03:22] [INFO ] Applying decomposition
[2024-05-22 00:03:22] [INFO ] Flatten gal took : 8 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/graph16148159318321215948.txt' '-o' '/tmp/graph16148159318321215948.bin' '-w' '/tmp/graph16148159318321215948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16148159318321215948.bin' '-l' '-1' '-v' '-w' '/tmp/graph16148159318321215948.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:03:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:03:22] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-22 00:03:22] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 21 ms.
[2024-05-22 00:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12213731749633385736.gal : 6 ms
[2024-05-22 00:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11813886984526035809.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/CTLFireability12213731749633385736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11813886984526035809.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21552e+26,8.036,228912,24132,39,381803,601,929,673661,60,1402,0


Converting to forward existential form...Done !
original formula: EF((((i19.u136.p493==1) + EX((i18.u131.p469==1))) + (EX(EX((((i11.i1.i0.u54.p165==0)||(i0.u123.p421==0))||(i18.u128.p589==0)))) * (i16.u9...168
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (i19.u136.p493==1))] != FALSE + [(EY(FwdU(Init,TRUE)) * (i18.u131.p469==1))] != FALSE) + [...282
(forward)formula 0,1,8.05877,228912,1,0,381803,601,933,673661,63,1402,87
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 38 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-22 00:03:30] [INFO ] Computed 94 invariants in 5 ms
[2024-05-22 00:03:30] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 00:03:30] [INFO ] Invariant cache hit.
[2024-05-22 00:03:31] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/114 constraints. Problems are: Problem set: 14 solved, 401 unsolved
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 99 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 3 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/134 constraints. Problems are: Problem set: 28 solved, 387 unsolved
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:03:47] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:03:48] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/154 constraints. Problems are: Problem set: 28 solved, 387 unsolved
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/174 constraints. Problems are: Problem set: 28 solved, 387 unsolved
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/194 constraints. Problems are: Problem set: 28 solved, 387 unsolved
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 28 solved, 387 unsolved
Search for dead transitions found 28 dead transitions in 30146ms
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 : 471/509 places, 388/454 transitions.
Applied a total of 0 rules in 6 ms. Remains 471 /471 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30961 ms. Remains : 471/509 places, 388/454 transitions.
[2024-05-22 00:04:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:04:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:04:01] [INFO ] Input system was already deterministic with 388 transitions.
[2024-05-22 00:04:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:04:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13891395322216139594.gal : 2 ms
[2024-05-22 00:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1731170631068289168.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/CTLFireability13891395322216139594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1731170631068289168.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:04:31] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:04:31] [INFO ] Applying decomposition
[2024-05-22 00:04:31] [INFO ] Flatten gal took : 8 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/graph18190813935493817388.txt' '-o' '/tmp/graph18190813935493817388.bin' '-w' '/tmp/graph18190813935493817388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18190813935493817388.bin' '-l' '-1' '-v' '-w' '/tmp/graph18190813935493817388.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:04:31] [INFO ] Decomposing Gal with order
[2024-05-22 00:04:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:04:31] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-22 00:04:31] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:04:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2024-05-22 00:04:31] [INFO ] Time to serialize gal into /tmp/CTLFireability75042265732790766.gal : 5 ms
[2024-05-22 00:04:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18162101140513691056.ctl : 6 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/CTLFireability75042265732790766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18162101140513691056.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,2.3926e+26,5.55881,164828,11543,54,303982,730,1070,424948,72,1881,0


Converting to forward existential form...Done !
original formula: AX((A(((!(EF((i6.i0.u70.p220==1))) * EF((i18.i2.u122.p414==1))) + (!((((i15.i0.u112.p373==1)&&(i18.i2.u55.p183==1))&&(i18.i2.u148.p569==1...283
=> equivalent forward existential formula: ([((FwdU((EY(Init) * !((i12.i1.u97.p303==1))),!(E(E(TRUE U (i14.i1.u109.p355==1)) U (i18.i0.u54.p178==1)))) * !(...603
Reverse transition relation is NOT exact ! Due to transitions t7, t170, t243, t265, t270, t279, t359, t367, t368, t375, t380, t381, i0.u48.t212, i0.u50.t20...1321
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 37 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-22 00:05:02] [INFO ] Computed 94 invariants in 4 ms
[2024-05-22 00:05:02] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 00:05:02] [INFO ] Invariant cache hit.
[2024-05-22 00:05:02] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/114 constraints. Problems are: Problem set: 12 solved, 403 unsolved
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 102 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/134 constraints. Problems are: Problem set: 25 solved, 390 unsolved
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 96 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/154 constraints. Problems are: Problem set: 29 solved, 386 unsolved
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/174 constraints. Problems are: Problem set: 31 solved, 384 unsolved
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/194 constraints. Problems are: Problem set: 32 solved, 383 unsolved
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 20/214 constraints. Problems are: Problem set: 34 solved, 381 unsolved
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 34 solved, 381 unsolved
Search for dead transitions found 34 dead transitions in 30096ms
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 : 471/509 places, 382/454 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 382
Applied a total of 3 rules in 7 ms. Remains 468 /471 variables (removed 3) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 468 cols
[2024-05-22 00:05:32] [INFO ] Computed 98 invariants in 8 ms
[2024-05-22 00:05:32] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:05:32] [INFO ] Invariant cache hit.
[2024-05-22 00:05:33] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/509 places, 382/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31258 ms. Remains : 468/509 places, 382/454 transitions.
[2024-05-22 00:05:33] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:05:33] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:05:33] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-22 00:05:33] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:05:33] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11132584905414171051.gal : 2 ms
[2024-05-22 00:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10387542653629223600.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/CTLFireability11132584905414171051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10387542653629223600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:06:03] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:06:03] [INFO ] Applying decomposition
[2024-05-22 00:06:03] [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/graph17884682524588069118.txt' '-o' '/tmp/graph17884682524588069118.bin' '-w' '/tmp/graph17884682524588069118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17884682524588069118.bin' '-l' '-1' '-v' '-w' '/tmp/graph17884682524588069118.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:06:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:06:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:06:03] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-22 00:06:03] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:06:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2024-05-22 00:06:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2255336443390640883.gal : 6 ms
[2024-05-22 00:06:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7667486998689965567.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/CTLFireability2255336443390640883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7667486998689965567.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,2.59905e+26,6.40616,196928,11409,41,331072,935,971,587688,61,2497,0


Converting to forward existential form...Done !
original formula: EG(!(E((((EX((i6.u30.p105==1)) + !((((i12.i0.u25.p77==1)&&(i12.i2.u123.p427==1))&&(i12.i0.u135.p505==1)))) * ((i9.i1.u119.p410!=1) + AG((...252
=> equivalent forward existential formula: [FwdG(Init,!(E((((EX((i6.u30.p105==1)) + !((((i12.i0.u25.p77==1)&&(i12.i2.u123.p427==1))&&(i12.i0.u135.p505==1))...307
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t170, t242, t270, t279, t351, t352, t361, t362, t369, t374, t375, i0.i0.u76.t173, i0...1296
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 an SCC at level 9
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
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 : 509/509 places, 454/454 transitions.
Graph (trivial) has 250 edges and 509 vertex of which 4 / 509 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1121 edges and 506 vertex of which 505 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 504 transition count 378
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 433 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 432 transition count 377
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 146 place count 432 transition count 281
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 354 place count 320 transition count 281
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 382 place count 292 transition count 253
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 411 place count 291 transition count 253
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 411 place count 291 transition count 250
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 417 place count 288 transition count 250
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 643 place count 173 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 645 place count 172 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 171 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 170 transition count 137
Applied a total of 647 rules in 79 ms. Remains 170 /509 variables (removed 339) and now considering 137/454 (removed 317) transitions.
// Phase 1: matrix 137 rows 170 cols
[2024-05-22 00:06:33] [INFO ] Computed 72 invariants in 3 ms
[2024-05-22 00:06:33] [INFO ] Implicit Places using invariants in 124 ms returned [0, 1, 2, 8, 9, 10, 18, 19, 23, 24, 25, 26, 27, 28, 51, 52, 53, 54, 126]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 126 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 151/509 places, 137/454 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 210 ms. Remains : 151/509 places, 137/454 transitions.
[2024-05-22 00:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:06:33] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:06:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7833860618432329848.gal : 2 ms
[2024-05-22 00:06:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8277416207180077188.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/CTLFireability7833860618432329848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8277416207180077188.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,27228,0.621509,25820,2,6498,5,86391,6,0,740,58958,0


Converting to forward existential form...Done !
original formula: E((AG((p449==1)) * (p52!=1)) U (AF(!(EG((p57!=1)))) * (p599!=1)))
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !((p449==1)))) * (p52!=1))) * (p599!=1)) * !(EG(!(!(EG((p57!=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t24, t32, t33, t34, t35, t36, t51, t52, t53, t54, t55, t92, t93, t94, t129, t130, t131, ...254
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.92935,189544,1,0,252,1.05645e+06,278,150,5589,651742,370
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-05 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 : 509/509 places, 454/454 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 483 transition count 428
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 483 transition count 428
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 473 transition count 418
Applied a total of 72 rules in 53 ms. Remains 473 /509 variables (removed 36) and now considering 418/454 (removed 36) transitions.
// Phase 1: matrix 418 rows 473 cols
[2024-05-22 00:06:39] [INFO ] Computed 94 invariants in 10 ms
[2024-05-22 00:06:40] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 00:06:40] [INFO ] Invariant cache hit.
[2024-05-22 00:06:40] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 00:06:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:52] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/134 constraints. Problems are: Problem set: 9 solved, 408 unsolved
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 108 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/154 constraints. Problems are: Problem set: 9 solved, 408 unsolved
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:07:00] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/174 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:07:01] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:07:02] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:07:03] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/194 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:06] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/214 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:07:09] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:07:10] [INFO ] Deduced a trap composed of 109 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 28 solved, 389 unsolved
Search for dead transitions found 28 dead transitions in 30155ms
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 : 473/509 places, 390/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 473 /473 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30970 ms. Remains : 473/509 places, 390/454 transitions.
[2024-05-22 00:07:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:07:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:07:10] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-22 00:07:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:07:10] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:07:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6770058834687569453.gal : 2 ms
[2024-05-22 00:07:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14300182343324045067.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/CTLFireability6770058834687569453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14300182343324045067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:07:40] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:07:40] [INFO ] Applying decomposition
[2024-05-22 00:07:41] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5521915904942418269.txt' '-o' '/tmp/graph5521915904942418269.bin' '-w' '/tmp/graph5521915904942418269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5521915904942418269.bin' '-l' '-1' '-v' '-w' '/tmp/graph5521915904942418269.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:07:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:07:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:07:41] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-22 00:07:41] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:07:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-22 00:07:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6363834434776573487.gal : 6 ms
[2024-05-22 00:07:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3731452569584904795.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/CTLFireability6363834434776573487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3731452569584904795.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,2.21571e+26,1.00886,34132,3787,55,55283,665,1047,129087,63,2180,0


Converting to forward existential form...Done !
original formula: EX(EF((((AX((i15.i0.u115.p388==1)) + (i15.i2.u118.p395==1)) + ((EF((i16.u145.p545==1)) * (EX((i9.u82.p260==1)) + (((i17.i1.u152.p179==1)&...426
=> equivalent forward existential formula: ((([(FwdU(EY(Init),TRUE) * !(EX(!((i15.i0.u115.p388==1)))))] != FALSE + [(FwdU(EY(Init),TRUE) * (i15.i2.u118.p39...698
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t173, t245, t267, t276, t359, t360, t361, t369, t370, t377, t382, t383, i0.u46.t218, ...1365
(forward)formula 0,1,5.26223,200716,1,0,378755,766,6844,809333,294,2787,844736
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 467 transition count 412
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 467 transition count 412
Applied a total of 84 rules in 42 ms. Remains 467 /509 variables (removed 42) and now considering 412/454 (removed 42) transitions.
// Phase 1: matrix 412 rows 467 cols
[2024-05-22 00:07:46] [INFO ] Computed 94 invariants in 7 ms
[2024-05-22 00:07:46] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 00:07:46] [INFO ] Invariant cache hit.
[2024-05-22 00:07:47] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-05-22 00:07:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/114 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/134 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/154 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 4 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/174 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/194 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/214 constraints. Problems are: Problem set: 22 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/879 variables, and 214 constraints, problems are : Problem set: 22 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 22 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 22 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 22 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 22 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 22 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 120/214 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:08:22] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:08:23] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/234 constraints. Problems are: Problem set: 28 solved, 383 unsolved
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:24] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:08:26] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/254 constraints. Problems are: Problem set: 28 solved, 383 unsolved
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:08:27] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 99 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:28] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 3 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:29] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/274 constraints. Problems are: Problem set: 31 solved, 380 unsolved
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:08:31] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:08:34] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:35] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/294 constraints. Problems are: Problem set: 31 solved, 380 unsolved
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/314 constraints. Problems are: Problem set: 31 solved, 380 unsolved
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/334 constraints. Problems are: Problem set: 33 solved, 378 unsolved
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/879 variables, and 346 constraints, problems are : Problem set: 33 solved, 378 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/411 constraints, Known Traps: 252/252 constraints]
After SMT, in 60106ms problems are : Problem set: 33 solved, 378 unsolved
Search for dead transitions found 33 dead transitions in 60111ms
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 : 467/509 places, 379/454 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 379
Applied a total of 1 rules in 17 ms. Remains 466 /467 variables (removed 1) and now considering 379/379 (removed 0) transitions.
// Phase 1: matrix 379 rows 466 cols
[2024-05-22 00:08:47] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:08:47] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 00:08:47] [INFO ] Invariant cache hit.
[2024-05-22 00:08:47] [INFO ] Implicit Places using invariants and state equation in 406 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 619 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/509 places, 379/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61413 ms. Remains : 464/509 places, 379/454 transitions.
[2024-05-22 00:08:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:08:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:08:47] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-22 00:08:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:08:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:08:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3120546910842474177.gal : 2 ms
[2024-05-22 00:08:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10296396689160051045.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/CTLFireability3120546910842474177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10296396689160051045.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:09:18] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:09:18] [INFO ] Applying decomposition
[2024-05-22 00:09:18] [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/graph4158612797291004169.txt' '-o' '/tmp/graph4158612797291004169.bin' '-w' '/tmp/graph4158612797291004169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4158612797291004169.bin' '-l' '-1' '-v' '-w' '/tmp/graph4158612797291004169.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:09:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:09:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:09:18] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 00:09:18] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:09:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2024-05-22 00:09:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12975093328330143168.gal : 5 ms
[2024-05-22 00:09:18] [INFO ] Time to serialize properties into /tmp/CTLFireability113623841530222585.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/CTLFireability12975093328330143168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability113623841530222585.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,2.25203e+26,3.01089,95800,10447,29,165053,503,993,285526,51,1144,0


Converting to forward existential form...Done !
original formula: EF((EX(AX((i19.u127.p449==1))) + (i19.u126.p533==1)))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(!((i19.u127.p449==1)))))] != FALSE + [(FwdU(Init,TRUE) * (i19.u126.p533==1))] != F...160
Reverse transition relation is NOT exact ! Due to transitions t7, t167, t239, t261, t266, t270, t275, t348, t349, t358, t359, t366, t371, t372, i0.t171, i0...1283
(forward)formula 0,1,16.6556,553780,1,0,1.22716e+06,503,5448,1.44723e+06,212,1144,3618730
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 470 transition count 415
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 47 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
// Phase 1: matrix 415 rows 470 cols
[2024-05-22 00:09:35] [INFO ] Computed 94 invariants in 7 ms
[2024-05-22 00:09:35] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 00:09:35] [INFO ] Invariant cache hit.
[2024-05-22 00:09:35] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem 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
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 27 solved, 387 unsolved
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 27 solved, 387 unsolved
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 30 solved, 384 unsolved
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 30 solved, 384 unsolved
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/194 constraints. Problems are: Problem set: 30 solved, 384 unsolved
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/214 constraints. Problems are: Problem set: 34 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/885 variables, and 214 constraints, problems are : Problem set: 34 solved, 380 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 34 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 34 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 120/214 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/234 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/254 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/274 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:10:21] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/294 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 123 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/314 constraints. Problems are: Problem set: 34 solved, 380 unsolved
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 20/334 constraints. Problems are: Problem set: 36 solved, 378 unsolved
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/885 variables, and 340 constraints, problems are : Problem set: 36 solved, 378 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 0/414 constraints, Known Traps: 246/246 constraints]
After SMT, in 60113ms problems are : Problem set: 36 solved, 378 unsolved
Search for dead transitions found 36 dead transitions in 60118ms
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 : 470/509 places, 379/454 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 467 transition count 379
Applied a total of 3 rules in 7 ms. Remains 467 /470 variables (removed 3) and now considering 379/379 (removed 0) transitions.
// Phase 1: matrix 379 rows 467 cols
[2024-05-22 00:10:35] [INFO ] Computed 100 invariants in 4 ms
[2024-05-22 00:10:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:10:36] [INFO ] Invariant cache hit.
[2024-05-22 00:10:36] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 467/509 places, 379/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61443 ms. Remains : 467/509 places, 379/454 transitions.
[2024-05-22 00:10:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:10:36] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:10:36] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-22 00:10:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:10:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3283853501646966381.gal : 2 ms
[2024-05-22 00:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16140429406730167502.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/CTLFireability3283853501646966381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16140429406730167502.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:11:06] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:11:06] [INFO ] Applying decomposition
[2024-05-22 00:11:06] [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/graph11466913837348297443.txt' '-o' '/tmp/graph11466913837348297443.bin' '-w' '/tmp/graph11466913837348297443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11466913837348297443.bin' '-l' '-1' '-v' '-w' '/tmp/graph11466913837348297443.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:11:06] [INFO ] Decomposing Gal with order
[2024-05-22 00:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:11:06] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 00:11:06] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:11:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 00:11:06] [INFO ] Time to serialize gal into /tmp/CTLFireability18028006953104035968.gal : 4 ms
[2024-05-22 00:11:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14982996033244856172.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/CTLFireability18028006953104035968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14982996033244856172.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57561e+26,11.8793,351936,7442,30,599680,439,893,945139,46,1027,0


Converting to forward existential form...Done !
original formula: EF(((EG((EX((i11.i0.i0.u66.p203==1)) + ((i21.u115.p375==1)&&(i8.u33.p104==1)))) * AG((i20.u98.p294==1))) * ((AG((((i2.u51.p156==1)&&(i19....262
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (EG((EX((i11.i0.i0.u66.p203==1)) + ((i21.u115.p375==1)&&(i8.u33.p104==1)))) * !(E(TRUE U ...634
Reverse transition relation is NOT exact ! Due to transitions t7, t168, t172, t240, t264, t269, t273, t349, t358, t359, t366, t371, t372, i0.u128.t68, i0.u...1209
(forward)formula 0,0,18.7825,367776,1,0,776841,439,5912,945139,207,1027,2157923
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-08 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 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 468 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 45 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
// Phase 1: matrix 413 rows 468 cols
[2024-05-22 00:11:25] [INFO ] Computed 94 invariants in 4 ms
[2024-05-22 00:11:25] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 00:11:25] [INFO ] Invariant cache hit.
[2024-05-22 00:11:26] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:11:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/114 constraints. Problems are: Problem set: 19 solved, 393 unsolved
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/134 constraints. Problems are: Problem set: 27 solved, 385 unsolved
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/154 constraints. Problems are: Problem set: 27 solved, 385 unsolved
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 99 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/174 constraints. Problems are: Problem set: 27 solved, 385 unsolved
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 100 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/194 constraints. Problems are: Problem set: 29 solved, 383 unsolved
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:55] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:11:55] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:11:55] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:55] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/214 constraints. Problems are: Problem set: 29 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/881 variables, and 214 constraints, problems are : Problem set: 29 solved, 383 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 29 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 29 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 29 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 29 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 120/214 constraints. Problems are: Problem set: 29 solved, 383 unsolved
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/234 constraints. Problems are: Problem set: 29 solved, 383 unsolved
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 5 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/254 constraints. Problems are: Problem set: 29 solved, 383 unsolved
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/274 constraints. Problems are: Problem set: 34 solved, 378 unsolved
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:12:09] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:12:10] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:12:11] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/294 constraints. Problems are: Problem set: 34 solved, 378 unsolved
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/314 constraints. Problems are: Problem set: 34 solved, 378 unsolved
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 20/334 constraints. Problems are: Problem set: 35 solved, 377 unsolved
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 20/354 constraints. Problems are: Problem set: 35 solved, 377 unsolved
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/881 variables, and 356 constraints, problems are : Problem set: 35 solved, 377 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 262/262 constraints]
After SMT, in 60110ms problems are : Problem set: 35 solved, 377 unsolved
Search for dead transitions found 35 dead transitions in 60114ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/509 places, 378/454 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 378
Applied a total of 2 rules in 11 ms. Remains 466 /468 variables (removed 2) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 466 cols
[2024-05-22 00:12:26] [INFO ] Computed 100 invariants in 4 ms
[2024-05-22 00:12:26] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 00:12:26] [INFO ] Invariant cache hit.
[2024-05-22 00:12:27] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 682 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 465/509 places, 378/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 465 /465 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61469 ms. Remains : 465/509 places, 378/454 transitions.
[2024-05-22 00:12:27] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:12:27] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-22 00:12:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:12:27] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13578150540689915907.gal : 2 ms
[2024-05-22 00:12:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17549955718464104220.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/CTLFireability13578150540689915907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17549955718464104220.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:12:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:57] [INFO ] Applying decomposition
[2024-05-22 00:12:57] [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/graph10254069577431590690.txt' '-o' '/tmp/graph10254069577431590690.bin' '-w' '/tmp/graph10254069577431590690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10254069577431590690.bin' '-l' '-1' '-v' '-w' '/tmp/graph10254069577431590690.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:57] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:57] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-22 00:12:57] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:12:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:12:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6476505457126963330.gal : 8 ms
[2024-05-22 00:12:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5486818392961776187.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/CTLFireability6476505457126963330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5486818392961776187.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,2.32626e+26,2.52648,85592,10104,46,147068,742,938,369451,67,1680,0


Converting to forward existential form...Done !
original formula: EF((EX((EX((i7.i0.u129.p487==1)) + EF((i17.u83.p264==1)))) + A(!(AG((i4.u44.p142==1))) U AX((i22.u133.p511==1)))))
=> equivalent forward existential formula: (([(EY(EY(FwdU(Init,TRUE))) * (i7.i0.u129.p487==1))] != FALSE + [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (i17.u83.p264...363
(forward)formula 0,1,3.81983,85856,1,0,147068,742,1349,438494,87,1680,218499
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 257 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 501 transition count 373
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 146 place count 429 transition count 275
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 359 place count 314 transition count 275
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 388 place count 285 transition count 246
Ensure Unique test removed 1 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 418 place count 284 transition count 246
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 418 place count 284 transition count 243
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 424 place count 281 transition count 243
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 74 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
// Phase 1: matrix 132 rows 165 cols
[2024-05-22 00:13:01] [INFO ] Computed 71 invariants in 1 ms
[2024-05-22 00:13:01] [INFO ] Implicit Places using invariants in 205 ms returned [24, 25, 26, 49, 50, 51, 52]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 207 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 158/509 places, 132/454 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 285 ms. Remains : 158/509 places, 132/454 transitions.
[2024-05-22 00:13:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:13:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:13:01] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-22 00:13:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:13:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:13:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16206860373244348034.gal : 1 ms
[2024-05-22 00:13:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10637294629417682635.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/CTLFireability16206860373244348034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10637294629417682635.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,19468,0.21892,14612,2,4406,5,42587,6,0,762,32901,0


Converting to forward existential form...Done !
original formula: AF(AG(AF((p15==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((p15==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t28, t29, t30, t45, t46, t47, t48, t49, t72, t87, t88, t89, t124, t125, t126, t131,...256
(forward)formula 0,0,1.18742,50692,1,0,178,172274,259,103,5705,97503,267
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 477 transition count 422
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 466 transition count 411
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 466 transition count 411
Applied a total of 86 rules in 48 ms. Remains 466 /509 variables (removed 43) and now considering 411/454 (removed 43) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-22 00:13:02] [INFO ] Computed 94 invariants in 4 ms
[2024-05-22 00:13:02] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 00:13:02] [INFO ] Invariant cache hit.
[2024-05-22 00:13:03] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-22 00:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 105 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 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 TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 25 solved, 385 unsolved
[2024-05-22 00:13:28] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:13:28] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:28] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 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 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.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 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.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 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 20/214 constraints. Problems are: Problem set: 26 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/877 variables, and 214 constraints, problems are : Problem set: 26 solved, 384 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 26 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 26 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 26 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 26 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 120/214 constraints. Problems are: Problem set: 26 solved, 384 unsolved
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/234 constraints. Problems are: Problem set: 29 solved, 381 unsolved
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/254 constraints. Problems are: Problem set: 29 solved, 381 unsolved
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/274 constraints. Problems are: Problem set: 30 solved, 380 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/294 constraints. Problems are: Problem set: 30 solved, 380 unsolved
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 20/314 constraints. Problems are: Problem set: 30 solved, 380 unsolved
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 20/334 constraints. Problems are: Problem set: 30 solved, 380 unsolved
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 3 ms to minimize.
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/877 variables, and 353 constraints, problems are : Problem set: 30 solved, 380 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 0/410 constraints, Known Traps: 259/259 constraints]
After SMT, in 60105ms problems are : Problem set: 30 solved, 380 unsolved
Search for dead transitions found 30 dead transitions in 60109ms
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 : 466/509 places, 381/454 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 381
Applied a total of 1 rules in 8 ms. Remains 465 /466 variables (removed 1) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 465 cols
[2024-05-22 00:14:03] [INFO ] Computed 97 invariants in 2 ms
[2024-05-22 00:14:03] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 00:14:03] [INFO ] Invariant cache hit.
[2024-05-22 00:14:04] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 679 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/509 places, 381/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61442 ms. Remains : 464/509 places, 381/454 transitions.
[2024-05-22 00:14:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:14:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:14:04] [INFO ] Input system was already deterministic with 381 transitions.
[2024-05-22 00:14:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:14:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16728326279124199280.gal : 4 ms
[2024-05-22 00:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12205422072698935179.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/CTLFireability16728326279124199280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12205422072698935179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:14:34] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:14:34] [INFO ] Applying decomposition
[2024-05-22 00:14:34] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12341429296760711854.txt' '-o' '/tmp/graph12341429296760711854.bin' '-w' '/tmp/graph12341429296760711854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12341429296760711854.bin' '-l' '-1' '-v' '-w' '/tmp/graph12341429296760711854.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:14:34] [INFO ] Decomposing Gal with order
[2024-05-22 00:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:14:34] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:14:34] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-22 00:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability425122618708502075.gal : 5 ms
[2024-05-22 00:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1916904150993600957.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/CTLFireability425122618708502075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1916904150993600957.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 255 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 146 place count 429 transition count 276
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 357 place count 315 transition count 276
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 386 place count 286 transition count 247
Ensure Unique test removed 1 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 416 place count 285 transition count 247
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 416 place count 285 transition count 244
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 422 place count 282 transition count 244
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 70 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
// Phase 1: matrix 132 rows 165 cols
[2024-05-22 00:15:04] [INFO ] Computed 71 invariants in 3 ms
[2024-05-22 00:15:04] [INFO ] Implicit Places using invariants in 148 ms returned [0, 1, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 149 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/509 places, 132/454 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 224 ms. Remains : 147/509 places, 132/454 transitions.
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:04] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9392215283484985157.gal : 2 ms
[2024-05-22 00:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8367126955378376294.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/CTLFireability9392215283484985157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8367126955378376294.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,52632,0.927433,39164,2,5908,5,166609,6,0,719,90618,0


Converting to forward existential form...Done !
original formula: E((p46!=1) U (p188==1))
=> equivalent forward existential formula: [(FwdU(Init,(p46!=1)) * (p188==1))] != FALSE
Hit Full ! (commute/partial/dont) 130/0/2
(forward)formula 0,1,1.11225,39164,1,0,10,166609,15,1,1433,90618,4
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 00:15:05] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:15:05] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:15:05] [INFO ] Applying decomposition
[2024-05-22 00:15:05] [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/graph3385856810472285089.txt' '-o' '/tmp/graph3385856810472285089.bin' '-w' '/tmp/graph3385856810472285089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3385856810472285089.bin' '-l' '-1' '-v' '-w' '/tmp/graph3385856810472285089.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:15:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:05] [INFO ] Removed a total of 280 redundant transitions.
[2024-05-22 00:15:05] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:15:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 00:15:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5885787021475142854.gal : 4 ms
[2024-05-22 00:15:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17260667583642048615.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5885787021475142854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17260667583642048615.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53605e+26,23.3429,603896,17848,82,1.00133e+06,1144,1040,2.53429e+06,77,3334,0


Converting to forward existential form...Done !
original formula: E((i10.u93.p270==1) U (!(EF((EF((i16.u139.p430==1)) * AX((i13.u112.p339==1))))) * (A((i13.u21.p57!=1) U !((((i4.u38.p109==1)||(((i5.u41.p...317
=> equivalent forward existential formula: ([(((FwdU(Init,(i10.u93.p270==1)) * !(E(TRUE U (E(TRUE U (i16.u139.p430==1)) * !(EX(!((i13.u112.p339==1)))))))) ...876
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t195, t300, t305, t316, t433, t441, t446, i0.u52.t245, i0.u54.t241, i0.u76.t...1484
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,327.1,2429444,1,0,3.85659e+06,1144,3603,8.36723e+06,205,3334,951063
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-22 00:40:28] [INFO ] Applying decomposition
[2024-05-22 00:40:28] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:40:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:28] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-22 00:40:28] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 95 ms.
[2024-05-22 00:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8212494785676674574.gal : 6 ms
[2024-05-22 00:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10519666254342936993.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/CTLFireability8212494785676674574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10519666254342936993.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 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:46:15] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:46:15] [INFO ] Input system was already deterministic with 454 transitions.
[2024-05-22 00:46:15] [INFO ] Transformed 509 places.
[2024-05-22 00:46:15] [INFO ] Transformed 454 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:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17025967000470723391.gal : 4 ms
[2024-05-22 00:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10262357580444287482.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/CTLFireability17025967000470723391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10262357580444287482.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3432862 ms.

BK_STOP 1716339370914

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
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-14, 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-171620399800554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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