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-171620399700538.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716335004026

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:43:25] [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:43:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:43:25] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-21 23:43:25] [INFO ] Transformed 586 places.
[2024-05-21 23:43:25] [INFO ] Transformed 525 transitions.
[2024-05-21 23:43:25] [INFO ] Found NUPN structural information;
[2024-05-21 23:43:25] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Support contains 125 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 64 place count 518 transition count 460
Iterating global reduction 1 with 61 rules applied. Total rules applied 125 place count 518 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 151 place count 492 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 177 place count 492 transition count 434
Applied a total of 177 rules in 124 ms. Remains 492 /582 variables (removed 90) and now considering 434/521 (removed 87) transitions.
// Phase 1: matrix 434 rows 492 cols
[2024-05-21 23:43:25] [INFO ] Computed 95 invariants in 24 ms
[2024-05-21 23:43:26] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-21 23:43:26] [INFO ] Invariant cache hit.
[2024-05-21 23:43:26] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 23:43:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/492 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 29 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 4 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 4 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 116 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 7 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/926 variables, and 210 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/492 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/492 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 115/210 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 8 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 4 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 5 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 4 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 5 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 4 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 5 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 60250ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 492/582 places, 434/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61132 ms. Remains : 492/582 places, 434/521 transitions.
Support contains 125 out of 492 places after structural reductions.
[2024-05-21 23:44:26] [INFO ] Flatten gal took : 69 ms
[2024-05-21 23:44:27] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:44:27] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 124 out of 492 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (288 resets) in 1771 ms. (22 steps per ms) remains 38/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
[2024-05-21 23:44:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 234/316 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 68/384 variables, 18/52 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 5 (OVERLAPS) 101/485 variables, 42/94 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/486 variables, 1/95 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 430/916 variables, 486/581 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/916 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 36 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/925 variables, 5/586 constraints. Problems are: Problem set: 5 solved, 33 unsolved
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
Problem AtomicPropp51 is UNSAT
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/925 variables, 17/603 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 925/926 variables, and 604 constraints, problems are : Problem set: 6 solved, 32 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 491/492 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 6 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 212/276 variables, 25/25 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/46 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 5/51 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 13/64 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 3 ms to minimize.
SMT process timed out in 10066ms, After SMT, problems are : Problem set: 6 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (complete) has 1083 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 491 transition count 391
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 449 transition count 387
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 445 transition count 387
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 93 place count 445 transition count 306
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 267 place count 352 transition count 306
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 282 place count 337 transition count 291
Iterating global reduction 3 with 15 rules applied. Total rules applied 297 place count 337 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 297 place count 337 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 299 place count 336 transition count 290
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 504 place count 233 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 505 place count 233 transition count 187
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 233 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 507 place count 232 transition count 186
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 514 place count 232 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 231 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 516 place count 230 transition count 185
Applied a total of 516 rules in 136 ms. Remains 230 /492 variables (removed 262) and now considering 185/434 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 230/492 places, 185/434 transitions.
RANDOM walk for 40000 steps (2230 resets) in 1027 ms. (38 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (47 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (48 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (48 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (46 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 597570 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :23 out of 30
Probabilistic random walk after 597570 steps, saw 99038 distinct states, run finished after 3005 ms. (steps per millisecond=198 ) properties seen :23
// Phase 1: matrix 185 rows 230 cols
[2024-05-21 23:44:41] [INFO ] Computed 81 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 92/108 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 25/133 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 60/193 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/199 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/200 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 180/380 variables, 200/319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 34/414 variables, 29/348 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/414 variables, 11/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/415 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/415 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/415 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/415 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 367 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 92/108 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/133 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 60/193 variables, 27/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 43/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 6/119 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/199 variables, 6/126 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 5/131 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/200 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 180/380 variables, 200/332 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 5/337 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/380 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 34/414 variables, 29/366 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 11/377 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 6/384 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 1/385 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/414 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 1/415 variables, 1/386 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/415 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/415 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/415 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 387 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 70/70 constraints]
After SMT, in 6914ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 1 properties in 1085 ms.
Support contains 11 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 185/185 transitions.
Graph (trivial) has 41 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 3 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 229 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 223 transition count 177
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 223 transition count 160
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 52 place count 201 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 197 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 197 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 197 transition count 154
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 64 place count 195 transition count 154
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 95 place count 178 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
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 99 place count 176 transition count 156
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 176 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 106 place count 172 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 172 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 171 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 170 transition count 151
Applied a total of 109 rules in 86 ms. Remains 170 /230 variables (removed 60) and now considering 151/185 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 170/230 places, 151/185 transitions.
RANDOM walk for 40000 steps (2688 resets) in 200 ms. (199 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (958 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (988 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
// Phase 1: matrix 151 rows 170 cols
[2024-05-21 23:44:50] [INFO ] Computed 72 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/75 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/117 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/123 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/268 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/320 variables, 46/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/321 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/321 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/75 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/117 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/123 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/268 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/320 variables, 46/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/321 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/321 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/321 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 20 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:44:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 35 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:44:51] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 86 out of 492 places (down from 98) after GAL structural reductions.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1083 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 241 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 485 transition count 361
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 420 transition count 361
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 420 transition count 266
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 307 transition count 266
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 282 transition count 241
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 282 transition count 241
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 390 place count 282 transition count 237
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 398 place count 278 transition count 237
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 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 620 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 621 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 622 place count 163 transition count 127
Applied a total of 622 rules in 57 ms. Remains 163 /492 variables (removed 329) and now considering 127/434 (removed 307) transitions.
// Phase 1: matrix 127 rows 163 cols
[2024-05-21 23:44:51] [INFO ] Computed 72 invariants in 4 ms
[2024-05-21 23:44:51] [INFO ] Implicit Places using invariants in 122 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 125 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/492 places, 127/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 191 ms. Remains : 145/492 places, 127/434 transitions.
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:51] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:51] [INFO ] Time to serialize gal into /tmp/CTLFireability648855554841066810.gal : 4 ms
[2024-05-21 23:44:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8817405282425525360.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/CTLFireability648855554841066810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8817405282425525360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,28242,0.102714,6460,2,1719,5,10040,6,0,706,7878,0


Converting to forward existential form...Done !
original formula: EG(EF((p280==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p280==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t35, t36, t37, t38, t45, t46, t47, t48, t49, t86, t87, t97, t100, t101, t102, t120, ...261
(forward)formula 0,1,1.03702,48248,1,0,295,211323,244,219,5294,217942,365
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 233 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 485 transition count 363
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 422 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 128 place count 422 transition count 272
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 326 place count 315 transition count 272
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 350 place count 291 transition count 248
Iterating global reduction 2 with 24 rules applied. Total rules applied 374 place count 291 transition count 248
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 374 place count 291 transition count 245
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 380 place count 288 transition count 245
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 600 place count 176 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 601 place count 175 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 602 place count 174 transition count 136
Applied a total of 602 rules in 70 ms. Remains 174 /492 variables (removed 318) and now considering 136/434 (removed 298) transitions.
// Phase 1: matrix 136 rows 174 cols
[2024-05-21 23:44:52] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 23:44:52] [INFO ] Implicit Places using invariants in 125 ms returned [0, 1, 7, 8, 33, 34, 35, 36, 43, 44, 45, 50, 51, 54, 55, 56, 57, 58]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 125 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/492 places, 136/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 156/492 places, 136/434 transitions.
[2024-05-21 23:44:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:52] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-21 23:44:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:52] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9526076383519338727.gal : 3 ms
[2024-05-21 23:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10905471066984510353.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/CTLFireability9526076383519338727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10905471066984510353.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,41878,0.081618,7696,2,2482,5,12288,6,0,760,9281,0


Converting to forward existential form...Done !
original formula: AF(AG(((AG((p275==0)) + EF((p336==0))) + ((p46==1)||(((p87==1)&&(p474==1))&&(((p197==0)||(p389==0))||(p521==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(E(TRUE U !((p275==0)))) + E(TRUE U (p336==0))) + ((p46==1)||(((p87==1)&&(p474==1))...209
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t12, t35, t36, t37, t38, t39, t44, t45, t46, t47, t48, t88, t104, t105, t106, t110, t...272
(forward)formula 0,1,0.798358,39932,1,0,199,145086,265,102,5712,96873,263
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 457 transition count 399
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 457 transition count 399
Applied a total of 70 rules in 96 ms. Remains 457 /492 variables (removed 35) and now considering 399/434 (removed 35) transitions.
// Phase 1: matrix 399 rows 457 cols
[2024-05-21 23:44:53] [INFO ] Computed 95 invariants in 13 ms
[2024-05-21 23:44:54] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 23:44:54] [INFO ] Invariant cache hit.
[2024-05-21 23:44:54] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-21 23:44:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 72 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 4 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 20/195 constraints. Problems are: Problem set: 6 solved, 392 unsolved
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 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 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.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 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 20/215 constraints. Problems are: Problem set: 25 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/856 variables, and 215 constraints, problems are : Problem set: 25 solved, 373 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/457 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 25 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 39/39 constraints. Problems are: Problem set: 25 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 25 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 52/91 constraints. Problems are: Problem set: 25 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 4/95 constraints. Problems are: Problem set: 25 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 120/215 constraints. Problems are: Problem set: 25 solved, 373 unsolved
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 4 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 20/235 constraints. Problems are: Problem set: 27 solved, 371 unsolved
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/255 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/275 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 20/295 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:45:43] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 4 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 20/315 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:45:51] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 20/335 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-05-21 23:45:52] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:53] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:54] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
SMT process timed out in 60156ms, After SMT, problems are : Problem set: 32 solved, 366 unsolved
Search for dead transitions found 32 dead transitions in 60163ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 457/492 places, 367/434 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 367
Applied a total of 1 rules in 9 ms. Remains 456 /457 variables (removed 1) and now considering 367/367 (removed 0) transitions.
// Phase 1: matrix 367 rows 456 cols
[2024-05-21 23:45:54] [INFO ] Computed 99 invariants in 6 ms
[2024-05-21 23:45:54] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 23:45:54] [INFO ] Invariant cache hit.
[2024-05-21 23:45:55] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [67, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 525 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 454/492 places, 367/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 454 /454 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61539 ms. Remains : 454/492 places, 367/434 transitions.
[2024-05-21 23:45:55] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:45:55] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:45:55] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 23:45:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:45:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4592784437052921179.gal : 4 ms
[2024-05-21 23:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17498110015761623856.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/CTLFireability4592784437052921179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17498110015761623856.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.76364e+23,1.07264,37508,3867,43,56791,649,941,153421,63,1475,0


Converting to forward existential form...Done !
original formula: EF(((EG(E(EF(((i8.i1.u33.p100==1)&&(i8.i1.u34.p103==1))) U EF((((i9.u41.p120==1)&&(i17.i0.u104.p319==1))&&(i9.u133.p478==1))))) + AG(E(AX...257
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),E(E(TRUE U ((i8.i1.u33.p100==1)&&(i8.i1.u34.p103==1))) U E(TRUE U (((i9.u41.p120==1)&&(i...399
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t156, t168, t254, t355, t357, t359, t360, i0.i0.u122.t67, i0.i0.u123.t64, i0.i1.u77....1179
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 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,1,9.20202,340316,1,0,685757,713,6544,1.1774e+06,317,1638,1482922
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 16 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-21 23:46:35] [INFO ] Computed 95 invariants in 5 ms
[2024-05-21 23:46:35] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 23:46:35] [INFO ] Invariant cache hit.
[2024-05-21 23:46:35] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-21 23:46:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:46:42] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 23 solved, 373 unsolved
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/135 constraints. Problems are: Problem set: 23 solved, 373 unsolved
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 5 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/155 constraints. Problems are: Problem set: 23 solved, 373 unsolved
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/175 constraints. Problems are: Problem set: 23 solved, 373 unsolved
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 4 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/195 constraints. Problems are: Problem set: 25 solved, 371 unsolved
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/215 constraints. Problems are: Problem set: 26 solved, 370 unsolved
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 30128ms, After SMT, problems are : Problem set: 26 solved, 370 unsolved
Search for dead transitions found 26 dead transitions in 30132ms
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 : 455/492 places, 371/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 455 /455 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30837 ms. Remains : 455/492 places, 371/434 transitions.
[2024-05-21 23:47:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:05] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-21 23:47:05] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2969928530871551162.gal : 2 ms
[2024-05-21 23:47:05] [INFO ] Time to serialize properties into /tmp/CTLFireability404967279943194286.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/CTLFireability2969928530871551162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability404967279943194286.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:47:36] [INFO ] Applying decomposition
[2024-05-21 23:47:36] [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/graph17950327114466020674.txt' '-o' '/tmp/graph17950327114466020674.bin' '-w' '/tmp/graph17950327114466020674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17950327114466020674.bin' '-l' '-1' '-v' '-w' '/tmp/graph17950327114466020674.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:36] [INFO ] Removed a total of 133 redundant transitions.
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2024-05-21 23:47:36] [INFO ] Time to serialize gal into /tmp/CTLFireability6133770843460826280.gal : 6 ms
[2024-05-21 23:47:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3184267099139214872.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/CTLFireability6133770843460826280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3184267099139214872.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,3.46732e+23,0.345615,16336,2795,57,24033,1052,1035,50892,66,2311,0


Converting to forward existential form...Done !
original formula: A(AG(((i5.i1.u25.p88==1)||(i4.i1.u21.p64==1))) U AG(EF(((EX((i8.i1.u80.p241==1)) + (i8.i1.u2.p4!=1)) + (EF((i7.i3.u117.p395==1)) * (i0.u1...171
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U ((EX((i8.i1.u80.p241==1)) + (i8.i1.u2.p4!=1)) + (E(TRUE U (i7.i3.u117.p39...538
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t156, t160, t168, t176, t262, t359, t361, t363, t364, i0.t164, i0.u70.t171, ...1180
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,1.63158,82600,1,0,166624,1150,6918,323086,342,2469,441153
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-05 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 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 35 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-21 23:47:37] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:47:38] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:47:38] [INFO ] Invariant cache hit.
[2024-05-21 23:47:38] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:47:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/115 constraints. Problems are: Problem set: 11 solved, 384 unsolved
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/135 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:47:50] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:47:51] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:47:52] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/155 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:55] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/175 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 12 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/195 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 5 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/215 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 17 solved, 378 unsolved
Search for dead transitions found 17 dead transitions in 30137ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 454/492 places, 379/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 454 /454 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30777 ms. Remains : 454/492 places, 379/434 transitions.
[2024-05-21 23:48:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:48:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:48:08] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-21 23:48:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:48:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability715122642770859799.gal : 2 ms
[2024-05-21 23:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2792896017141272243.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/CTLFireability715122642770859799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2792896017141272243.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:48:38] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:48:38] [INFO ] Applying decomposition
[2024-05-21 23:48:38] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6582367372873311337.txt' '-o' '/tmp/graph6582367372873311337.bin' '-w' '/tmp/graph6582367372873311337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6582367372873311337.bin' '-l' '-1' '-v' '-w' '/tmp/graph6582367372873311337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:38] [INFO ] Removed a total of 175 redundant transitions.
[2024-05-21 23:48:38] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-21 23:48:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14460312656480573284.gal : 5 ms
[2024-05-21 23:48:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5571987107499396257.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/CTLFireability14460312656480573284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5571987107499396257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40929e+23,0.56954,22940,2835,49,40781,638,1011,63446,61,1531,0


Converting to forward existential form...Done !
original formula: EF((EG((i14.i0.u8.p19==1)) + AX((((i0.i2.u77.p228==1)&&(i0.i2.u120.p409==1))&&(i0.i0.u146.p543==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(i14.i0.u8.p19==1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!((((i0.i2.u77.p228==1)&&(i0.i2....207
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,0.954121,35876,1,0,60903,638,4263,174194,222,1538,88675
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 236 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 485 transition count 362
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 421 transition count 362
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 130 place count 421 transition count 269
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 334 place count 310 transition count 269
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 359 place count 285 transition count 244
Iterating global reduction 2 with 25 rules applied. Total rules applied 384 place count 285 transition count 244
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 384 place count 285 transition count 240
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 281 transition count 240
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 610 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 611 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 612 place count 168 transition count 132
Applied a total of 612 rules in 65 ms. Remains 168 /492 variables (removed 324) and now considering 132/434 (removed 302) transitions.
// Phase 1: matrix 132 rows 168 cols
[2024-05-21 23:48:40] [INFO ] Computed 72 invariants in 3 ms
[2024-05-21 23:48:40] [INFO ] Implicit Places using invariants in 105 ms returned [0, 1, 5, 6, 33, 34, 35, 42, 43, 44, 50, 54, 55, 56, 57, 58]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 107 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/492 places, 132/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 177 ms. Remains : 152/492 places, 132/434 transitions.
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:40] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16443425327850302323.gal : 2 ms
[2024-05-21 23:48:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7123212004474032190.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/CTLFireability16443425327850302323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7123212004474032190.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,209616,0.080706,7148,2,1944,5,11825,6,0,740,10215,0


Converting to forward existential form...Done !
original formula: EF(AG(E(AG((p307==1)) U (((p113==1)&&(p195==1))&&((p187==1)||(p118==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(!(E(TRUE U !((p307==1)))) U (((p113==1)&&(p195==1))&&((p187==1)||(p118==1))))...169
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t39, t40, t41, t42, t43, t50, t51, t52, t53, t54, t75, t91, t92, t93, t105, t108,...274
(forward)formula 0,0,0.588626,31536,1,0,188,116359,253,93,5444,78391,249
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 457 transition count 399
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 457 transition count 399
Applied a total of 70 rules in 35 ms. Remains 457 /492 variables (removed 35) and now considering 399/434 (removed 35) transitions.
// Phase 1: matrix 399 rows 457 cols
[2024-05-21 23:48:40] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:48:41] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 23:48:41] [INFO ] Invariant cache hit.
[2024-05-21 23:48:41] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-21 23:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 389 unsolved
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 20/135 constraints. Problems are: Problem set: 22 solved, 376 unsolved
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/155 constraints. Problems are: Problem set: 22 solved, 376 unsolved
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 4 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
Problem TDEAD344 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/175 constraints. Problems are: Problem set: 23 solved, 375 unsolved
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 20/195 constraints. Problems are: Problem set: 27 solved, 371 unsolved
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 20/215 constraints. Problems are: Problem set: 27 solved, 371 unsolved
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 27 solved, 371 unsolved
Search for dead transitions found 27 dead transitions in 30188ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 457/492 places, 372/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 457 /457 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30954 ms. Remains : 457/492 places, 372/434 transitions.
[2024-05-21 23:49:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:49:11] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 23:49:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:49:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5730347028794888824.gal : 2 ms
[2024-05-21 23:49:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15738601865239902307.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/CTLFireability5730347028794888824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15738601865239902307.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:49:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:49:41] [INFO ] Applying decomposition
[2024-05-21 23:49:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9982204888553256448.txt' '-o' '/tmp/graph9982204888553256448.bin' '-w' '/tmp/graph9982204888553256448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9982204888553256448.bin' '-l' '-1' '-v' '-w' '/tmp/graph9982204888553256448.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:41] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-21 23:49:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:49:41] [INFO ] Time to serialize gal into /tmp/CTLFireability370070030006644251.gal : 3 ms
[2024-05-21 23:49:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17707259337655404995.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/CTLFireability370070030006644251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17707259337655404995.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,3.63193e+23,0.345104,19804,3325,42,32342,436,956,52403,53,1091,0


Converting to forward existential form...Done !
original formula: (AG((EF((i12.u81.p239==1)) + (EF(AG((i4.u44.p131==0))) * A(AF((i6.u16.p55==1)) U (((i4.u43.p126==1)&&(i19.u101.p314==1))&&(i4.u135.p482==...471
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!(E(TRUE U !((E(TRUE U (i12.u81.p239==1)) + (E(TRUE U !(E(TRUE U !((i4.u44.p131==0))))) * ...718
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t10, t156, t164, t255, t360, t362, t364, t365, i0.u73.t167, i0.u116.t80, i0.u117.t77,...1140
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 39 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-21 23:50:12] [INFO ] Computed 95 invariants in 7 ms
[2024-05-21 23:50:12] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 23:50:12] [INFO ] Invariant cache hit.
[2024-05-21 23:50:12] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-21 23:50:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 17 solved, 379 unsolved
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/135 constraints. Problems are: Problem set: 17 solved, 379 unsolved
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/155 constraints. Problems are: Problem set: 17 solved, 379 unsolved
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 3 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/175 constraints. Problems are: Problem set: 20 solved, 376 unsolved
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/195 constraints. Problems are: Problem set: 28 solved, 368 unsolved
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/215 constraints. Problems are: Problem set: 28 solved, 368 unsolved
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/852 variables, and 226 constraints, problems are : Problem set: 28 solved, 368 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 28 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 28 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 28 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 28 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 28 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 131/226 constraints. Problems are: Problem set: 28 solved, 368 unsolved
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/246 constraints. Problems are: Problem set: 29 solved, 367 unsolved
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 4 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 3 ms to minimize.
Problem TDEAD374 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/266 constraints. Problems are: Problem set: 30 solved, 366 unsolved
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/286 constraints. Problems are: Problem set: 30 solved, 366 unsolved
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 4 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/306 constraints. Problems are: Problem set: 30 solved, 366 unsolved
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/326 constraints. Problems are: Problem set: 30 solved, 366 unsolved
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 20/346 constraints. Problems are: Problem set: 30 solved, 366 unsolved
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 60182ms, After SMT, problems are : Problem set: 30 solved, 366 unsolved
Search for dead transitions found 30 dead transitions in 60186ms
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 : 455/492 places, 367/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 455 /455 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61005 ms. Remains : 455/492 places, 367/434 transitions.
[2024-05-21 23:51:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:51:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:51:13] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 23:51:13] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:51:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:51:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14052435828381203950.gal : 2 ms
[2024-05-21 23:51:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1027186792776925182.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/CTLFireability14052435828381203950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1027186792776925182.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:51:43] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:51:43] [INFO ] Applying decomposition
[2024-05-21 23:51:43] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5431915349937481783.txt' '-o' '/tmp/graph5431915349937481783.bin' '-w' '/tmp/graph5431915349937481783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5431915349937481783.bin' '-l' '-1' '-v' '-w' '/tmp/graph5431915349937481783.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:43] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:43] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-21 23:51:43] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:51:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4913924651881744912.gal : 6 ms
[2024-05-21 23:51:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6351516922275452353.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/CTLFireability4913924651881744912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6351516922275452353.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,3.40929e+23,1.13713,37800,4960,49,53510,508,973,165108,64,1176,0


Converting to forward existential form...Done !
original formula: AX(AG((i10.i1.u111.p372==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((i10.i1.u111.p372==0)))] = FALSE
(forward)formula 0,0,1.86027,42024,1,0,57734,508,2306,195349,110,1176,153763
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 35 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-21 23:51:45] [INFO ] Computed 95 invariants in 5 ms
[2024-05-21 23:51:45] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 23:51:45] [INFO ] Invariant cache hit.
[2024-05-21 23:51:45] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-21 23:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:52] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:51:57] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:58] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 136 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:51:59] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:00] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:01] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:52:02] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/155 constraints. Problems are: Problem set: 3 solved, 393 unsolved
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 2 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/175 constraints. Problems are: Problem set: 15 solved, 381 unsolved
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 4 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/195 constraints. Problems are: Problem set: 15 solved, 381 unsolved
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:11] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:12] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
Problem TDEAD333 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 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/215 constraints. Problems are: Problem set: 16 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/852 variables, and 215 constraints, problems are : Problem set: 16 solved, 380 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 16 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 16 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 16 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 16 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 16 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 120/215 constraints. Problems are: Problem set: 16 solved, 380 unsolved
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:52:18] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:19] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/235 constraints. Problems are: Problem set: 16 solved, 380 unsolved
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/255 constraints. Problems are: Problem set: 16 solved, 380 unsolved
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/275 constraints. Problems are: Problem set: 16 solved, 380 unsolved
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/295 constraints. Problems are: Problem set: 19 solved, 377 unsolved
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/315 constraints. Problems are: Problem set: 22 solved, 374 unsolved
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 20/335 constraints. Problems are: Problem set: 25 solved, 371 unsolved
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 20/355 constraints. Problems are: Problem set: 25 solved, 371 unsolved
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 60163ms, After SMT, problems are : Problem set: 25 solved, 371 unsolved
Search for dead transitions found 25 dead transitions in 60169ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/492 places, 372/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60931 ms. Remains : 455/492 places, 372/434 transitions.
[2024-05-21 23:52:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:52:46] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:52:46] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 23:52:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4961353735667491811.gal : 2 ms
[2024-05-21 23:52:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9957617192463072204.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/CTLFireability4961353735667491811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9957617192463072204.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41396e+23,0.58155,21492,3035,42,35369,558,949,63122,55,1423,0


Converting to forward existential form...Done !
original formula: E(EX(EG(E((((i4.u18.p52==1)&&(i20.i1.u95.p278==1))&&(i19.u125.p547==1)) U (i19.u125.p431==1)))) U !(EF(((i6.i1.u107.p336==1)||(i5.i0.u41....167
=> equivalent forward existential formula: [(FwdU(Init,EX(EG(E((((i4.u18.p52==1)&&(i20.i1.u95.p278==1))&&(i19.u125.p547==1)) U (i19.u125.p431==1))))) * !(E...219
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t156, t160, t168, t176, t254, t360, t361, t362, t364, t365, i0.i0.u76.t159, i...1155
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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
(forward)formula 0,0,6.02918,221340,1,0,432611,558,6759,744223,298,1423,920266
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 33 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-21 23:53:22] [INFO ] Computed 95 invariants in 3 ms
[2024-05-21 23:53:22] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 23:53:22] [INFO ] Invariant cache hit.
[2024-05-21 23:53:23] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:53:29] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:53:30] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:53:31] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 3 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/115 constraints. Problems are: Problem set: 11 solved, 384 unsolved
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:53:32] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:53:34] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/135 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:53:35] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:36] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:53:37] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/155 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:53:40] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:53:40] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:53:40] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:53:41] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:53:42] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/175 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:53:43] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:44] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:53:45] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:46] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/195 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:53:47] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:53:48] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:53:49] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/215 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:52] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:53:53] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:53:53] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:53:53] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
SMT process timed out in 30088ms, After SMT, problems are : Problem set: 17 solved, 378 unsolved
Search for dead transitions found 17 dead transitions in 30092ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 454/492 places, 379/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 454 /454 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30971 ms. Remains : 454/492 places, 379/434 transitions.
[2024-05-21 23:53:53] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:53:53] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:53:53] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-21 23:53:53] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:53:53] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:53:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13614773577162185726.gal : 3 ms
[2024-05-21 23:53:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16487318964704211796.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/CTLFireability13614773577162185726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16487318964704211796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40929e+23,0.606507,22620,3048,58,35412,588,991,73580,60,1371,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.610886,22620,1,0,35412,588,1402,73580,69,1371,1479
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 458 transition count 400
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 458 transition count 400
Applied a total of 68 rules in 19 ms. Remains 458 /492 variables (removed 34) and now considering 400/434 (removed 34) transitions.
// Phase 1: matrix 400 rows 458 cols
[2024-05-21 23:54:24] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:54:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 23:54:24] [INFO ] Invariant cache hit.
[2024-05-21 23:54:24] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-21 23:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/458 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 4 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 20/115 constraints. Problems are: Problem set: 10 solved, 389 unsolved
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 20/135 constraints. Problems are: Problem set: 10 solved, 389 unsolved
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 5 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 20/155 constraints. Problems are: Problem set: 10 solved, 389 unsolved
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 20/175 constraints. Problems are: Problem set: 10 solved, 389 unsolved
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 3 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 20/195 constraints. Problems are: Problem set: 26 solved, 373 unsolved
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 4 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 20/215 constraints. Problems are: Problem set: 26 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/858 variables, and 215 constraints, problems are : Problem set: 26 solved, 373 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/458 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/458 variables, 52/91 constraints. Problems are: Problem set: 26 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 4/95 constraints. Problems are: Problem set: 26 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 120/215 constraints. Problems are: Problem set: 26 solved, 373 unsolved
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 20/235 constraints. Problems are: Problem set: 26 solved, 373 unsolved
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
Problem TDEAD350 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 20/255 constraints. Problems are: Problem set: 28 solved, 371 unsolved
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 20/275 constraints. Problems are: Problem set: 28 solved, 371 unsolved
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 20/295 constraints. Problems are: Problem set: 28 solved, 371 unsolved
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 20/315 constraints. Problems are: Problem set: 28 solved, 371 unsolved
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 20/335 constraints. Problems are: Problem set: 28 solved, 371 unsolved
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 20/355 constraints. Problems are: Problem set: 28 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/858 variables, and 355 constraints, problems are : Problem set: 28 solved, 371 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/458 constraints, PredecessorRefiner: 0/399 constraints, Known Traps: 260/260 constraints]
After SMT, in 60104ms problems are : Problem set: 28 solved, 371 unsolved
Search for dead transitions found 28 dead transitions in 60113ms
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 : 458/492 places, 372/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 458 /458 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60799 ms. Remains : 458/492 places, 372/434 transitions.
[2024-05-21 23:55:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:55:25] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:55:25] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 23:55:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:55:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:55:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7225062974193097775.gal : 2 ms
[2024-05-21 23:55:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17568367000738299100.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/CTLFireability7225062974193097775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17568367000738299100.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53443e+23,3.02592,86492,6429,44,143740,648,996,275544,63,1611,0


Converting to forward existential form...Done !
original formula: A(((i17.u123.p424==1) * (((i4.u19.p59==1) + EF(!((((i7.i1.u26.p80==1)&&(i7.i0.u94.p279==1))&&(i7.i1.u132.p467==1))))) + ((i17.u141.p515==...449
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U (((i9.i0.u47.p153==1)&&(i14.u109.p353==1))&&(i17.u122.p547==1))) + !(E(TRUE U !((((i...1137
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t10, t159, t163, t171, t257, t360, t361, t362, t364, t365, i0.i0.u121.t68, i0.i1....1180
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 469 transition count 411
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 469 transition count 411
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 459 transition count 401
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 459 transition count 401
Applied a total of 66 rules in 22 ms. Remains 459 /492 variables (removed 33) and now considering 401/434 (removed 33) transitions.
// Phase 1: matrix 401 rows 459 cols
[2024-05-21 23:56:25] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:56:25] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:56:25] [INFO ] Invariant cache hit.
[2024-05-21 23:56:26] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-21 23:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 5 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/115 constraints. Problems are: Problem set: 10 solved, 390 unsolved
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/135 constraints. Problems are: Problem set: 10 solved, 390 unsolved
[2024-05-21 23:56:38] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/155 constraints. Problems are: Problem set: 19 solved, 381 unsolved
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 371 unsolved
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/195 constraints. Problems are: Problem set: 29 solved, 371 unsolved
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/215 constraints. Problems are: Problem set: 29 solved, 371 unsolved
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30097ms, After SMT, problems are : Problem set: 29 solved, 371 unsolved
Search for dead transitions found 29 dead transitions in 30101ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 459/492 places, 372/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 459 /459 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30804 ms. Remains : 459/492 places, 372/434 transitions.
[2024-05-21 23:56:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:56] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:56] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 23:56:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10496559113457804093.gal : 2 ms
[2024-05-21 23:56:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13130764615365686749.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/CTLFireability10496559113457804093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13130764615365686749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47088e+23,0.526965,19532,2758,48,28209,549,988,60088,59,1203,0


Converting to forward existential form...Done !
original formula: AG(EX(!(E((AX((i3.i1.u94.p269==1)) + ((i0.i2.u121.p402==1)&&(i14.i0.u91.p262==1))) U ((i17.i2.u135.p471!=1) * AF((i4.i2.u128.p437==1)))))...157
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((!(EX(!((i3.i1.u94.p269==1)))) + ((i0.i2.u121.p402==1)&&(i14.i0.u91.p262==1))) U ((...223
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t35, t160, t168, t180, t258, t266, t361, t362, t364, i0.t172, i0.i0.u71.t175, i0.i1....1223
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 243 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 485 transition count 360
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 419 transition count 360
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 134 place count 419 transition count 265
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 342 place count 306 transition count 265
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 368 place count 280 transition count 239
Iterating global reduction 2 with 26 rules applied. Total rules applied 394 place count 280 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 394 place count 280 transition count 234
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 404 place count 275 transition count 234
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 620 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 621 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 622 place count 163 transition count 127
Applied a total of 622 rules in 24 ms. Remains 163 /492 variables (removed 329) and now considering 127/434 (removed 307) transitions.
// Phase 1: matrix 127 rows 163 cols
[2024-05-21 23:57:56] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 23:57:56] [INFO ] Implicit Places using invariants in 125 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 126 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/492 places, 127/434 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 153 ms. Remains : 145/492 places, 127/434 transitions.
[2024-05-21 23:57:56] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:56] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:57:56] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-12-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:57:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:57:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:57:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1380833373054779436.gal : 2 ms
[2024-05-21 23:57:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17602264917068557533.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1380833373054779436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17602264917068557533.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 22 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-21 23:57:56] [INFO ] Computed 95 invariants in 3 ms
[2024-05-21 23:57:56] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:57:56] [INFO ] Invariant cache hit.
[2024-05-21 23:57:57] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:57:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:03] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/115 constraints. Problems are: Problem set: 11 solved, 384 unsolved
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/135 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/155 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/175 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/195 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/215 constraints. Problems are: Problem set: 17 solved, 378 unsolved
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 17 solved, 378 unsolved
Search for dead transitions found 17 dead transitions in 30180ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 454/492 places, 379/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 454 /454 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30862 ms. Remains : 454/492 places, 379/434 transitions.
[2024-05-21 23:58:27] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:58:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:58:27] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-21 23:58:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:58:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:58:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3795060881291597400.gal : 2 ms
[2024-05-21 23:58:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2914731951215705367.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/CTLFireability3795060881291597400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2914731951215705367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:58:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:58:57] [INFO ] Applying decomposition
[2024-05-21 23:58:57] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1475637027142855481.txt' '-o' '/tmp/graph1475637027142855481.bin' '-w' '/tmp/graph1475637027142855481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1475637027142855481.bin' '-l' '-1' '-v' '-w' '/tmp/graph1475637027142855481.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:58:57] [INFO ] Decomposing Gal with order
[2024-05-21 23:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:58:57] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-21 23:58:57] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-21 23:58:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14717143634165452056.gal : 2 ms
[2024-05-21 23:58:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12357827497759831384.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/CTLFireability14717143634165452056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12357827497759831384.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40929e+23,0.629262,23996,3450,38,43532,485,976,68062,55,1112,0


Converting to forward existential form...Done !
original formula: E(((((i9.u69.p206==1)&&(i9.u117.p403==1))&&(i14.u120.p547==1))||(((i1.u68.p203==1)&&(i1.u112.p379==1))&&(i1.u140.p525==1))) U EF(AX(((i7....196
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((((i9.u69.p206==1)&&(i9.u117.p403==1))&&(i14.u120.p547==1))||(((i1.u68.p203==1)&&(i1.u112.p379...255
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t167, t253, t261, t367, t368, t369, t371, t372, i0.u77.t153, i0.u78.t15...1080
(forward)formula 0,1,2.82062,120356,1,0,231443,535,6545,516579,243,1625,613220
FORMULA BusinessProcesses-PT-12-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 23:59:00] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:59:00] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:59:00] [INFO ] Applying decomposition
[2024-05-21 23:59:00] [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/graph14002105161769911229.txt' '-o' '/tmp/graph14002105161769911229.bin' '-w' '/tmp/graph14002105161769911229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14002105161769911229.bin' '-l' '-1' '-v' '-w' '/tmp/graph14002105161769911229.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:00] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:00] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-21 23:59:00] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12242280540969280783.gal : 4 ms
[2024-05-21 23:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability18321812937222792379.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/CTLFireability12242280540969280783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18321812937222792379.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.99989e+23,2.54305,104532,6722,46,187376,902,1020,700771,61,2447,0


Converting to forward existential form...Done !
original formula: (AG((EF((i12.u83.p239==1)) + (EF(AG((i0.u46.p131==0))) * A(AF((i3.u16.p55==1)) U (((i9.u45.p126==1)&&(i9.u107.p314==1))&&(i9.u150.p482==1...433
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!(E(TRUE U !((E(TRUE U (i12.u83.p239==1)) + (E(TRUE U !(E(TRUE U !((i0.u46.p131==0))))) * ...678
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t46, t187, t199, t207, t286, i0.u46.t249, i0.u46.t250, i0.u46.t251, i0.u...1342
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,244.062,2319336,1,0,2.61129e+06,902,3360,1.82473e+07,152,2447,1151570
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i13.u136.p424==1) * (((i1.u22.p59==1) + EF(!((((i8.u26.p80==1)&&(i8.u97.p279==1))&&(i8.u97.p467==1))))) + ((i13.u160.p515==1) * A((i1...427
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U (((i4.i0.i0.u50.p153==1)&&(i4.i1.i0.u116.p353==1))&&(i13.u134.p547==1))) + !(E(TRUE ...1091
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 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
(forward)formula 1,1,394.672,2554032,1,0,2.69219e+06,902,2235,1.88229e+07,116,2447,675014
FORMULA BusinessProcesses-PT-12-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EX(!(E((AX((i7.u94.p269==1)) + ((i11.u129.p402==1)&&(i9.u91.p262==1))) U ((i8.u147.p471!=1) * AF((i2.u139.p437==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((!(EX(!((i7.u94.p269==1)))) + ((i11.u129.p402==1)&&(i9.u91.p262==1))) U ((i8.u147.p...207
(forward)formula 2,0,477.794,2554032,1,0,2.69219e+06,902,3241,1.88229e+07,141,2447,1349334
FORMULA BusinessProcesses-PT-12-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1716336419100

--------------------
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-12"
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-12, 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-171620399700538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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