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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716337961742

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:32:43] [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-22 00:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:32:43] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-22 00:32:43] [INFO ] Transformed 782 places.
[2024-05-22 00:32:43] [INFO ] Transformed 697 transitions.
[2024-05-22 00:32:43] [INFO ] Found NUPN structural information;
[2024-05-22 00:32:43] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 11 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 107 place count 612 transition count 545
Iterating global reduction 1 with 93 rules applied. Total rules applied 200 place count 612 transition count 545
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 243 place count 569 transition count 502
Iterating global reduction 1 with 43 rules applied. Total rules applied 286 place count 569 transition count 502
Applied a total of 286 rules in 140 ms. Remains 569 /719 variables (removed 150) and now considering 502/638 (removed 136) transitions.
// Phase 1: matrix 502 rows 569 cols
[2024-05-22 00:32:43] [INFO ] Computed 107 invariants in 32 ms
[2024-05-22 00:32:43] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-22 00:32:43] [INFO ] Invariant cache hit.
[2024-05-22 00:32:44] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-22 00:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 95 places in 232 ms of which 66 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 4 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 83 places in 279 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 6 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 90 places in 463 ms of which 4 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 6 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 91 places in 196 ms of which 6 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 90 places in 203 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 98 places in 605 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 96 places in 189 ms of which 5 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 4 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 95 places in 260 ms of which 3 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 5 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 5 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 80 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 5 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 97 places in 311 ms of which 30 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 3 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 6 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 569/719 places, 502/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31269 ms. Remains : 569/719 places, 502/638 transitions.
Support contains 95 out of 569 places after structural reductions.
[2024-05-22 00:33:14] [INFO ] Flatten gal took : 72 ms
[2024-05-22 00:33:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:33:14] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:33:14] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 89 out of 569 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (195 resets) in 2223 ms. (17 steps per ms) remains 15/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-05-22 00:33:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 407/436 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 124/560 variables, 41/106 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/561 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 117 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 4 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 99 places in 279 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 94 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 496/1057 variables, 561/688 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 10 (OVERLAPS) 13/1070 variables, 7/695 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 0/695 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/1071 variables, 1/696 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-22 00:33:20] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
SMT process timed out in 5086ms, After SMT, problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (complete) has 1250 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 566 transition count 427
Reduce places removed 72 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 494 transition count 424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 151 place count 491 transition count 424
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 151 place count 491 transition count 313
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 394 place count 359 transition count 313
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 408 place count 345 transition count 299
Iterating global reduction 3 with 14 rules applied. Total rules applied 422 place count 345 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 422 place count 345 transition count 297
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 426 place count 343 transition count 297
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 681 place count 214 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 214 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 684 place count 213 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 685 place count 213 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 686 place count 212 transition count 172
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 692 place count 212 transition count 172
Applied a total of 692 rules in 134 ms. Remains 212 /569 variables (removed 357) and now considering 172/502 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 212/569 places, 172/502 transitions.
RANDOM walk for 40000 steps (1932 resets) in 675 ms. (59 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40002 steps (658 resets) in 199 ms. (200 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (565 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (677 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (563 resets) in 171 ms. (232 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (570 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
// Phase 1: matrix 172 rows 212 cols
[2024-05-22 00:33:21] [INFO ] Computed 83 invariants in 5 ms
[2024-05-22 00:33:21] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 172/179 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/210 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 172/382 variables, 210/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/384 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 212/212 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 172/179 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:33:21] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 31/210 variables, 19/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 4/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/382 variables, 210/322 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 5/327 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/384 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 330 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 212/212 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 29/29 constraints]
After SMT, in 2156ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-22 00:33:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:33:23] [INFO ] Flatten gal took : 30 ms
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:33:23] [INFO ] Flatten gal took : 43 ms
[2024-05-22 00:33:23] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 65 out of 569 places (down from 80) after GAL structural reductions.
Computed a total of 496 stabilizing places and 439 stable transitions
Graph (complete) has 1250 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.29 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 164 place count 479 transition count 298
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 464 place count 318 transition count 272
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 109 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
// Phase 1: matrix 142 rows 183 cols
[2024-05-22 00:33:24] [INFO ] Computed 80 invariants in 2 ms
[2024-05-22 00:33:24] [INFO ] Implicit Places using invariants in 615 ms returned [33, 34, 39, 40, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 631 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 163/569 places, 142/502 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 748 ms. Remains : 163/569 places, 142/502 transitions.
[2024-05-22 00:33:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:24] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:33:24] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:33:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:33:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:33:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10892687137794304373.gal : 10 ms
[2024-05-22 00:33:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9479912020856682214.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10892687137794304373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9479912020856682214.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 : 569/569 places, 502/502 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 479
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 472
Applied a total of 60 rules in 44 ms. Remains 539 /569 variables (removed 30) and now considering 472/502 (removed 30) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-22 00:33:25] [INFO ] Computed 107 invariants in 5 ms
[2024-05-22 00:33:25] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:33:25] [INFO ] Invariant cache hit.
[2024-05-22 00:33:26] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-22 00:33:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 4 solved, 467 unsolved
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 15 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 26 solved, 445 unsolved
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 26 solved, 445 unsolved
[2024-05-22 00:33:46] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:48] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:33:49] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:49] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:33:49] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:49] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 26 solved, 445 unsolved
[2024-05-22 00:33:49] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:50] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:33:51] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:52] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:33:52] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:33:52] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
Problem TDEAD424 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 27 solved, 444 unsolved
[2024-05-22 00:33:52] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:33:53] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:54] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:55] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:55] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:33:55] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 14 ms to minimize.
[2024-05-22 00:33:55] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 27 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1011 variables, and 227 constraints, problems are : Problem set: 27 solved, 444 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 27 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 27 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 27 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 27 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 27 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 120/227 constraints. Problems are: Problem set: 27 solved, 444 unsolved
[2024-05-22 00:33:59] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:33:59] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 5 ms to minimize.
[2024-05-22 00:33:59] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:01] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:34:01] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:34:01] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:34:01] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:34:01] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:02] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 4 ms to minimize.
[2024-05-22 00:34:02] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:34:02] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:02] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:34:02] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 27 solved, 444 unsolved
[2024-05-22 00:34:03] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:34:03] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:34:03] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 7 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:34:04] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
Problem TDEAD408 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 28 solved, 443 unsolved
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 32 solved, 439 unsolved
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 5 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 87 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 90 places in 279 ms of which 20 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/307 constraints. Problems are: Problem set: 32 solved, 439 unsolved
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:17] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:17] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:34:17] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:17] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:34:17] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 101 places in 245 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 89 places in 207 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 94 places in 251 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 5 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/327 constraints. Problems are: Problem set: 32 solved, 439 unsolved
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 96 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/347 constraints. Problems are: Problem set: 34 solved, 437 unsolved
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 60281ms, After SMT, problems are : Problem set: 34 solved, 437 unsolved
Search for dead transitions found 34 dead transitions in 60288ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/569 places, 438/502 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 538 transition count 438
Applied a total of 1 rules in 13 ms. Remains 538 /539 variables (removed 1) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 538 cols
[2024-05-22 00:34:26] [INFO ] Computed 113 invariants in 7 ms
[2024-05-22 00:34:26] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 00:34:26] [INFO ] Invariant cache hit.
[2024-05-22 00:34:27] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 754 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/569 places, 438/502 transitions.
Applied a total of 0 rules in 21 ms. Remains 536 /536 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62059 ms. Remains : 536/569 places, 438/502 transitions.
[2024-05-22 00:34:27] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:34:27] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:34:27] [INFO ] Input system was already deterministic with 438 transitions.
[2024-05-22 00:34:27] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:34:27] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:34:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4267442171233223501.gal : 6 ms
[2024-05-22 00:34:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16724861111166022624.ctl : 4 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/CTLFireability4267442171233223501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16724861111166022624.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 278 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 560 transition count 412
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 480 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 164 place count 479 transition count 302
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 403 place count 349 transition count 302
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 424 place count 328 transition count 281
Iterating global reduction 3 with 21 rules applied. Total rules applied 445 place count 328 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 445 place count 328 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 451 place count 325 transition count 278
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 710 place count 194 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 193 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 712 place count 192 transition count 149
Applied a total of 712 rules in 86 ms. Remains 192 /569 variables (removed 377) and now considering 149/502 (removed 353) transitions.
// Phase 1: matrix 149 rows 192 cols
[2024-05-22 00:35:27] [INFO ] Computed 82 invariants in 1 ms
[2024-05-22 00:35:28] [INFO ] Implicit Places using invariants in 208 ms returned [28, 29, 30, 31, 32, 37, 38, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 150]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 210 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 167/569 places, 149/502 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 301 ms. Remains : 167/569 places, 149/502 transitions.
[2024-05-22 00:35:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:35:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:35:28] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 00:35:28] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:35:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10076650973332712215.gal : 25 ms
[2024-05-22 00:35:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3889396946894222473.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/CTLFireability10076650973332712215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3889396946894222473.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,5.88318e+10,0.785699,29248,2,6075,5,101643,6,0,817,125395,0


Converting to forward existential form...Done !
original formula: AG(((p197==0) * ((!(A((p781==1) U (p609==1))) + (p725==0)) + ((p355==0)||(p333==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p197==0)))] = FALSE * [((((FwdU(Init,TRUE) * !(((p355==0)||(p333==1)))) * !((p725==0))) ...241
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t35, t36, t37, t38, t39, t66, t67, t68, t69, t70, t96, t97, t100, t101, t102, t113, t...362
(forward)formula 0,0,10.0628,305204,1,0,349,1.75257e+06,294,166,6129,1.72803e+06,391
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 410
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 298
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
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 464 place count 318 transition count 272
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 125 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
// Phase 1: matrix 142 rows 183 cols
[2024-05-22 00:35:38] [INFO ] Computed 80 invariants in 2 ms
[2024-05-22 00:35:38] [INFO ] Implicit Places using invariants in 245 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 246 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/569 places, 142/502 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 375 ms. Remains : 160/569 places, 142/502 transitions.
[2024-05-22 00:35:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:35:38] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:35:38] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:35:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:38] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:35:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7654825683093245198.gal : 4 ms
[2024-05-22 00:35:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16423395752476156398.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7654825683093245198.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16423395752476156398.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 : 569/569 places, 502/502 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 478
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 471
Applied a total of 62 rules in 47 ms. Remains 538 /569 variables (removed 31) and now considering 471/502 (removed 31) transitions.
// Phase 1: matrix 471 rows 538 cols
[2024-05-22 00:35:39] [INFO ] Computed 107 invariants in 5 ms
[2024-05-22 00:35:39] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-22 00:35:39] [INFO ] Invariant cache hit.
[2024-05-22 00:35:40] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-22 00:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 15 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 3 solved, 467 unsolved
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 1 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 467 unsolved
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 27 solved, 443 unsolved
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 5 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 28 solved, 442 unsolved
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 29 solved, 441 unsolved
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 29 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 227 constraints, problems are : Problem set: 29 solved, 441 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 29 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 29 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 29 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 29 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 29 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 120/227 constraints. Problems are: Problem set: 29 solved, 441 unsolved
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 91 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 29 solved, 441 unsolved
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
Problem TDEAD447 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 30 solved, 440 unsolved
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 30 solved, 440 unsolved
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/307 constraints. Problems are: Problem set: 30 solved, 440 unsolved
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/327 constraints. Problems are: Problem set: 30 solved, 440 unsolved
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/347 constraints. Problems are: Problem set: 30 solved, 440 unsolved
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
Problem TDEAD440 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 20/367 constraints. Problems are: Problem set: 32 solved, 438 unsolved
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1009 variables, and 378 constraints, problems are : Problem set: 32 solved, 438 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 271/271 constraints]
After SMT, in 60152ms problems are : Problem set: 32 solved, 438 unsolved
Search for dead transitions found 32 dead transitions in 60157ms
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 : 538/569 places, 439/502 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 439
Applied a total of 1 rules in 11 ms. Remains 537 /538 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 537 cols
[2024-05-22 00:36:40] [INFO ] Computed 111 invariants in 7 ms
[2024-05-22 00:36:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 00:36:40] [INFO ] Invariant cache hit.
[2024-05-22 00:36:40] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 557 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/569 places, 439/502 transitions.
Applied a total of 0 rules in 27 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61971 ms. Remains : 535/569 places, 439/502 transitions.
[2024-05-22 00:36:40] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:36:40] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:36:40] [INFO ] Input system was already deterministic with 439 transitions.
[2024-05-22 00:36:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:36:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:36:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9835907568465661154.gal : 2 ms
[2024-05-22 00:36:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14198342333976355655.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/CTLFireability9835907568465661154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14198342333976355655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 479
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 472
Applied a total of 60 rules in 55 ms. Remains 539 /569 variables (removed 30) and now considering 472/502 (removed 30) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-22 00:37:41] [INFO ] Computed 107 invariants in 11 ms
[2024-05-22 00:37:41] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-22 00:37:41] [INFO ] Invariant cache hit.
[2024-05-22 00:37:42] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-22 00:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 4 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 8 solved, 463 unsolved
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:37:59] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 91 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:00] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 11 solved, 460 unsolved
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 5 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 15 solved, 456 unsolved
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 21 solved, 450 unsolved
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 21 solved, 450 unsolved
Search for dead transitions found 21 dead transitions in 30218ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/569 places, 451/502 transitions.
Applied a total of 0 rules in 10 ms. Remains 539 /539 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31158 ms. Remains : 539/569 places, 451/502 transitions.
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:38:12] [INFO ] Input system was already deterministic with 451 transitions.
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:38:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7557324567713819192.gal : 3 ms
[2024-05-22 00:38:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8415217901717140884.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/CTLFireability7557324567713819192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8415217901717140884.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 478
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 471
Applied a total of 62 rules in 35 ms. Remains 538 /569 variables (removed 31) and now considering 471/502 (removed 31) transitions.
// Phase 1: matrix 471 rows 538 cols
[2024-05-22 00:39:13] [INFO ] Computed 107 invariants in 8 ms
[2024-05-22 00:39:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 00:39:13] [INFO ] Invariant cache hit.
[2024-05-22 00:39:14] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-22 00:39:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 3 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 3 solved, 467 unsolved
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 467 unsolved
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 95 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 27 solved, 443 unsolved
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 94 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 4 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 28 solved, 442 unsolved
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 124 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 29 solved, 441 unsolved
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 4 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 4 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 30178ms, After SMT, problems are : Problem set: 29 solved, 441 unsolved
Search for dead transitions found 29 dead transitions in 30184ms
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 : 538/569 places, 442/502 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 442
Applied a total of 1 rules in 9 ms. Remains 537 /538 variables (removed 1) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 537 cols
[2024-05-22 00:39:44] [INFO ] Computed 110 invariants in 8 ms
[2024-05-22 00:39:44] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-22 00:39:44] [INFO ] Invariant cache hit.
[2024-05-22 00:39:45] [INFO ] Implicit Places using invariants and state equation in 543 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 781 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/569 places, 442/502 transitions.
Applied a total of 0 rules in 8 ms. Remains 536 /536 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31867 ms. Remains : 536/569 places, 442/502 transitions.
[2024-05-22 00:39:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:45] [INFO ] Input system was already deterministic with 442 transitions.
[2024-05-22 00:39:45] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:39:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4054954224436846093.gal : 2 ms
[2024-05-22 00:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4585549708065192507.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/CTLFireability4054954224436846093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4585549708065192507.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 276 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 164 place count 479 transition count 305
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 397 place count 352 transition count 305
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 418 place count 331 transition count 284
Iterating global reduction 2 with 21 rules applied. Total rules applied 439 place count 331 transition count 284
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 439 place count 331 transition count 281
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 445 place count 328 transition count 281
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 711 place count 193 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 192 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 713 place count 191 transition count 149
Applied a total of 713 rules in 53 ms. Remains 191 /569 variables (removed 378) and now considering 149/502 (removed 353) transitions.
// Phase 1: matrix 149 rows 191 cols
[2024-05-22 00:40:45] [INFO ] Computed 81 invariants in 2 ms
[2024-05-22 00:40:45] [INFO ] Implicit Places using invariants in 223 ms returned [28, 29, 30, 31, 32, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 224 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/569 places, 149/502 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 283 ms. Remains : 168/569 places, 149/502 transitions.
[2024-05-22 00:40:45] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:40:45] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:40:45] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 00:40:45] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:40:45] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16972233078410863532.gal : 1 ms
[2024-05-22 00:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability18016182920270359129.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/CTLFireability16972233078410863532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18016182920270359129.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.60716e+11,1.17133,47248,2,10355,5,182736,6,0,821,104867,0


Converting to forward existential form...Done !
original formula: EF((AG((p413==1)) * (AG((((p306==0)||(p562==0))||(p743==0))) + ((p365==1)&&((p356==0)||(p185==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((p413==1))))) * !(E(TRUE U !((((p306==0)||(p562==0))||(p743==0))))))] != FALS...256
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t37, t38, t39, t40, t41, t65, t66, t67, t68, t69, t94, t97, t98, t112, t113, t114, t1...361
(forward)formula 0,0,6.75406,163580,1,0,262,850443,286,115,5932,479704,291
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 281 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 410
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 166 place count 478 transition count 300
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 408 place count 346 transition count 300
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 431 place count 323 transition count 277
Iterating global reduction 2 with 23 rules applied. Total rules applied 454 place count 323 transition count 277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 454 place count 323 transition count 274
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 460 place count 320 transition count 274
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 31 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
// Phase 1: matrix 142 rows 183 cols
[2024-05-22 00:40:52] [INFO ] Computed 80 invariants in 1 ms
[2024-05-22 00:40:52] [INFO ] Implicit Places using invariants in 115 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 115 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/569 places, 142/502 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 150 ms. Remains : 160/569 places, 142/502 transitions.
[2024-05-22 00:40:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:40:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:40:52] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-22 00:40:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:40:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:40:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality563791391788671167.gal : 2 ms
[2024-05-22 00:40:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12194920816518516699.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/ReachabilityCardinality563791391788671167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12194920816518516699.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality12194920816518516699.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 3024
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3024 after 57024
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :57024 after 516096
SDD proceeding with computation,1 properties remain. new max is 512
RANDOM walk for 40000 steps (5213 resets) in 387 ms. (103 steps per ms) remains 1/1 properties
SDD size :516096 after 4.23807e+06
Invariant property BusinessProcesses-PT-20-CTLFireability-2024-10 does not hold.
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
BEST_FIRST walk for 40003 steps (1177 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.73607e+08,0.165174,9516,2,2098,15,19481,6,0,782,17184,0
Total reachable state count : 373607136

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-20-CTLFireability-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-20-CTLFireability-2024-10,6.63552e+06,0.166244,9516,2,833,15,19481,7,0,788,17184,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 1008 steps, run visited all 1 properties in 21 ms. (steps per millisecond=48 )
Probabilistic random walk after 1008 steps, saw 460 distinct states, run finished after 30 ms. (steps per millisecond=33 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 548 transition count 481
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 548 transition count 481
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 543 transition count 476
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 543 transition count 476
Applied a total of 52 rules in 23 ms. Remains 543 /569 variables (removed 26) and now considering 476/502 (removed 26) transitions.
// Phase 1: matrix 476 rows 543 cols
[2024-05-22 00:40:53] [INFO ] Computed 107 invariants in 9 ms
[2024-05-22 00:40:53] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 00:40:53] [INFO ] Invariant cache hit.
[2024-05-22 00:40:53] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-05-22 00:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/543 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:41:04] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:05] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:06] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:41:06] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:06] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:41:06] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:41:06] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:07] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:08] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:09] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 20/147 constraints. Problems are: Problem set: 4 solved, 471 unsolved
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 8 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 1 ms to minimize.
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 468 unsolved
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 20/187 constraints. Problems are: Problem set: 10 solved, 465 unsolved
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:41:20] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 4 ms to minimize.
[2024-05-22 00:41:21] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:41:21] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 20/207 constraints. Problems are: Problem set: 14 solved, 461 unsolved
[2024-05-22 00:41:21] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:21] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:22] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:22] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:41:22] [INFO ] Deduced a trap composed of 101 places in 205 ms of which 3 ms to minimize.
[2024-05-22 00:41:22] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:41:22] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1019 variables, and 220 constraints, problems are : Problem set: 14 solved, 461 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/543 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 14 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 41/41 constraints. Problems are: Problem set: 14 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/41 constraints. Problems are: Problem set: 14 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 1/543 variables, 65/106 constraints. Problems are: Problem set: 14 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 1/107 constraints. Problems are: Problem set: 14 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 113/220 constraints. Problems are: Problem set: 14 solved, 461 unsolved
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 20/240 constraints. Problems are: Problem set: 29 solved, 446 unsolved
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 20/260 constraints. Problems are: Problem set: 29 solved, 446 unsolved
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 20/280 constraints. Problems are: Problem set: 29 solved, 446 unsolved
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 20/300 constraints. Problems are: Problem set: 29 solved, 446 unsolved
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:41:40] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:41:42] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 3 ms to minimize.
[2024-05-22 00:41:42] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:41:42] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:41:43] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:41:43] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:44] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:41:44] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:41:45] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 20/320 constraints. Problems are: Problem set: 35 solved, 440 unsolved
[2024-05-22 00:41:45] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:41:45] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:41:46] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:41:46] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:41:46] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:41:46] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:41:47] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:41:47] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:48] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 20/340 constraints. Problems are: Problem set: 35 solved, 440 unsolved
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 10 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 20/360 constraints. Problems are: Problem set: 35 solved, 440 unsolved
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 4 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/1019 variables, and 363 constraints, problems are : Problem set: 35 solved, 440 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/543 constraints, PredecessorRefiner: 0/475 constraints, Known Traps: 256/256 constraints]
After SMT, in 60115ms problems are : Problem set: 35 solved, 440 unsolved
Search for dead transitions found 35 dead transitions in 60119ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 543/569 places, 441/502 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 541 transition count 441
Applied a total of 2 rules in 15 ms. Remains 541 /543 variables (removed 2) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 541 cols
[2024-05-22 00:41:53] [INFO ] Computed 113 invariants in 7 ms
[2024-05-22 00:41:54] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 00:41:54] [INFO ] Invariant cache hit.
[2024-05-22 00:41:54] [INFO ] Implicit Places using invariants and state equation in 455 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 713 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 540/569 places, 441/502 transitions.
Applied a total of 0 rules in 8 ms. Remains 540 /540 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61540 ms. Remains : 540/569 places, 441/502 transitions.
[2024-05-22 00:41:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:41:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:41:54] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-22 00:41:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:41:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:41:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10114549135545707108.gal : 3 ms
[2024-05-22 00:41:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12528672718401833339.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/CTLFireability10114549135545707108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12528672718401833339.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 282 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 479 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 298
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 3 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 464 place count 318 transition count 272
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 728 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 182 transition count 141
Applied a total of 730 rules in 73 ms. Remains 182 /569 variables (removed 387) and now considering 141/502 (removed 361) transitions.
// Phase 1: matrix 141 rows 182 cols
[2024-05-22 00:42:55] [INFO ] Computed 80 invariants in 2 ms
[2024-05-22 00:42:55] [INFO ] Implicit Places using invariants in 199 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 200 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/569 places, 141/502 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 277 ms. Remains : 160/569 places, 141/502 transitions.
[2024-05-22 00:42:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:42:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:42:55] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 00:42:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:42:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:42:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15641749005656559900.gal : 13 ms
[2024-05-22 00:42:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7737310544441840041.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/ReachabilityCardinality15641749005656559900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7737310544441840041.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7737310544441840041.prop.
RANDOM walk for 31191 steps (4133 resets) in 151 ms. (205 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 549 transition count 482
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 549 transition count 482
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 542 transition count 475
Applied a total of 54 rules in 21 ms. Remains 542 /569 variables (removed 27) and now considering 475/502 (removed 27) transitions.
// Phase 1: matrix 475 rows 542 cols
[2024-05-22 00:42:55] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:42:55] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-22 00:42:55] [INFO ] Invariant cache hit.
[2024-05-22 00:42:56] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-05-22 00:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/542 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:05] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:06] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/127 constraints. Problems are: Problem set: 4 solved, 470 unsolved
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:43:08] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/147 constraints. Problems are: Problem set: 14 solved, 460 unsolved
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 20/167 constraints. Problems are: Problem set: 14 solved, 460 unsolved
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 20/187 constraints. Problems are: Problem set: 14 solved, 460 unsolved
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 20/207 constraints. Problems are: Problem set: 14 solved, 460 unsolved
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 1 ms to minimize.
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 20/227 constraints. Problems are: Problem set: 14 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/1017 variables, and 227 constraints, problems are : Problem set: 14 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/542 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 14 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 41/41 constraints. Problems are: Problem set: 14 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 0/41 constraints. Problems are: Problem set: 14 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/542 variables, 64/105 constraints. Problems are: Problem set: 14 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 2/107 constraints. Problems are: Problem set: 14 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 120/227 constraints. Problems are: Problem set: 14 solved, 460 unsolved
[2024-05-22 00:43:30] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:43:30] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:43:30] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:43:30] [INFO ] Deduced a trap composed of 88 places in 205 ms of which 3 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
Problem TDEAD459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/247 constraints. Problems are: Problem set: 15 solved, 459 unsolved
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 4 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 20/267 constraints. Problems are: Problem set: 21 solved, 453 unsolved
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 20/287 constraints. Problems are: Problem set: 26 solved, 448 unsolved
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:39] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:40] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:42] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:42] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 20/307 constraints. Problems are: Problem set: 31 solved, 443 unsolved
[2024-05-22 00:43:42] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:42] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:42] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 62 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:44] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:45] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:43:45] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 20/327 constraints. Problems are: Problem set: 31 solved, 443 unsolved
[2024-05-22 00:43:45] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 11 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 20/347 constraints. Problems are: Problem set: 33 solved, 441 unsolved
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:43:53] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:43:53] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:43:53] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:43:53] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:43:54] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:43:54] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:43:54] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 20/367 constraints. Problems are: Problem set: 33 solved, 441 unsolved
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 60210ms, After SMT, problems are : Problem set: 33 solved, 441 unsolved
Search for dead transitions found 33 dead transitions in 60219ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 542/569 places, 442/502 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 541 transition count 442
Applied a total of 1 rules in 12 ms. Remains 541 /542 variables (removed 1) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 541 cols
[2024-05-22 00:43:56] [INFO ] Computed 112 invariants in 2 ms
[2024-05-22 00:43:56] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 00:43:56] [INFO ] Invariant cache hit.
[2024-05-22 00:43:57] [INFO ] Implicit Places using invariants and state equation in 378 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 565 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 539/569 places, 442/502 transitions.
Applied a total of 0 rules in 18 ms. Remains 539 /539 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61635 ms. Remains : 539/569 places, 442/502 transitions.
[2024-05-22 00:43:57] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:43:57] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:43:57] [INFO ] Input system was already deterministic with 442 transitions.
[2024-05-22 00:43:57] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:43:57] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:43:57] [INFO ] Time to serialize gal into /tmp/CTLFireability479875376505777249.gal : 2 ms
[2024-05-22 00:43:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7701135866896158623.ctl : 14 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/CTLFireability479875376505777249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7701135866896158623.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-22 00:44:27] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:44:27] [INFO ] Applying decomposition
[2024-05-22 00:44:27] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14827135904533916241.txt' '-o' '/tmp/graph14827135904533916241.bin' '-w' '/tmp/graph14827135904533916241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14827135904533916241.bin' '-l' '-1' '-v' '-w' '/tmp/graph14827135904533916241.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:44:27] [INFO ] Decomposing Gal with order
[2024-05-22 00:44:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:44:27] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 00:44:27] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:44:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 19 ms.
[2024-05-22 00:44:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10254681552132945361.gal : 4 ms
[2024-05-22 00:44:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6584295815711749101.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/CTLFireability10254681552132945361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6584295815711749101.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 547 transition count 480
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 547 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 540 transition count 473
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 540 transition count 473
Applied a total of 58 rules in 45 ms. Remains 540 /569 variables (removed 29) and now considering 473/502 (removed 29) transitions.
// Phase 1: matrix 473 rows 540 cols
[2024-05-22 00:44:57] [INFO ] Computed 107 invariants in 5 ms
[2024-05-22 00:44:57] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-22 00:44:57] [INFO ] Invariant cache hit.
[2024-05-22 00:44:58] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-22 00:44:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:45:11] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 15 solved, 457 unsolved
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 21 solved, 451 unsolved
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 28 solved, 444 unsolved
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 1 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 30 solved, 442 unsolved
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:45:26] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:45:26] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:45:26] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:45:26] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:45:26] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:45:28] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:45:28] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:45:28] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:45:28] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 30 solved, 442 unsolved
Search for dead transitions found 30 dead transitions in 30185ms
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 : 540/569 places, 443/502 transitions.
Applied a total of 0 rules in 7 ms. Remains 540 /540 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31057 ms. Remains : 540/569 places, 443/502 transitions.
[2024-05-22 00:45:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:45:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:45:28] [INFO ] Input system was already deterministic with 443 transitions.
[2024-05-22 00:45:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:45:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:45:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12995212676336221227.gal : 2 ms
[2024-05-22 00:45:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3750536301309230210.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/CTLFireability12995212676336221227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3750536301309230210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:46:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:46:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:46:28] [INFO ] Applying decomposition
[2024-05-22 00:46:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14652209452558990060.txt' '-o' '/tmp/graph14652209452558990060.bin' '-w' '/tmp/graph14652209452558990060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14652209452558990060.bin' '-l' '-1' '-v' '-w' '/tmp/graph14652209452558990060.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:46:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:46:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:46:29] [INFO ] Removed a total of 275 redundant transitions.
[2024-05-22 00:46:29] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:46:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 00:46:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11381669378153860122.gal : 4 ms
[2024-05-22 00:46:29] [INFO ] Time to serialize properties into /tmp/CTLFireability3643120340123211466.ctl : 4 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/CTLFireability11381669378153860122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3643120340123211466.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15334e+34,991.415,7317504,56410,170,1.17083e+07,2264,1335,2.11274e+07,88,10822,0


Converting to forward existential form...Done !
original formula: EF(((i2.i0.u55.p188==1) + AX((EX((i0.i1.u196.p744==1)) + EF((i5.i2.u133.p433==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i2.i0.u55.p188==1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!((EX((i0.i1.u196.p744==1)) + E(T...198
(forward)formula 0,1,995.033,7317504,1,0,1.17083e+07,2264,1340,2.11274e+07,91,10822,47985
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX(((i14.i0.u201.p757==1)&&(((i4.u25.p64==0)||(i11.i2.u127.p411==0))||(i18.u161.p747==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((i14.i0.u201.p757==1)&&(((i4.u25.p64==0)||(i11.i2.u127.p411==0))||(i18.u161.p747==0))))...165
(forward)formula 1,1,1007.28,7317504,1,0,1.17083e+07,2264,1974,2.11274e+07,125,10822,1571270
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-22 01:11:04] [INFO ] Applying decomposition
[2024-05-22 01:11:04] [INFO ] Flatten gal took : 23 ms
[2024-05-22 01:11:04] [INFO ] Decomposing Gal with order
[2024-05-22 01:11:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:11:04] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-22 01:11:04] [INFO ] Flatten gal took : 32 ms
[2024-05-22 01:11:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 145 ms.
[2024-05-22 01:11:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8932949780246303542.gal : 7 ms
[2024-05-22 01:11:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13756776914437247722.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/CTLFireability8932949780246303542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13756776914437247722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 01:16:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:16:42] [INFO ] Input system was already deterministic with 502 transitions.
[2024-05-22 01:16:42] [INFO ] Transformed 569 places.
[2024-05-22 01:16:42] [INFO ] Transformed 502 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:17:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7973299268917358975.gal : 2 ms
[2024-05-22 01:17:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16971539770805317513.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/CTLFireability7973299268917358975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16971539770805317513.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3244023 ms.

BK_STOP 1716341207203

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

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