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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716335798549

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:56:40] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 23:56:40] [INFO ] Transformed 624 places.
[2024-05-21 23:56:40] [INFO ] Transformed 564 transitions.
[2024-05-21 23:56:40] [INFO ] Found NUPN structural information;
[2024-05-21 23:56:40] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 106 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 613 transition count 556
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 538 transition count 481
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 538 transition count 481
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 507 transition count 450
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 507 transition count 450
Applied a total of 215 rules in 112 ms. Remains 507 /616 variables (removed 109) and now considering 450/556 (removed 106) transitions.
// Phase 1: matrix 450 rows 507 cols
[2024-05-21 23:56:40] [INFO ] Computed 96 invariants in 34 ms
[2024-05-21 23:56:40] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-21 23:56:40] [INFO ] Invariant cache hit.
[2024-05-21 23:56:41] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 23:56:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 3/507 variables, 59/93 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 22 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:56:52] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:53] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 5 ms to minimize.
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:56:55] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 4 ms to minimize.
[2024-05-21 23:56:56] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 23:56:57] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 117 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 105 places in 261 ms of which 6 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 103 places in 197 ms of which 4 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 6 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 105 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Starting structural reductions in LTL mode, iteration 1 : 507/616 places, 450/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31399 ms. Remains : 507/616 places, 450/556 transitions.
Support contains 106 out of 507 places after structural reductions.
[2024-05-21 23:57:11] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:57:11] [INFO ] Flatten gal took : 113 ms
[2024-05-21 23:57:11] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-14-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:57:11] [INFO ] Flatten gal took : 47 ms
[2024-05-21 23:57:12] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 91 out of 507 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (271 resets) in 1892 ms. (21 steps per ms) remains 30/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
[2024-05-21 23:57:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 315/375 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 36/411 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 90/501 variables, 37/96 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 446/947 variables, 501/597 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 9/956 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 94 places in 308 ms of which 3 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 6 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 956/957 variables, and 618 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 506/507 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 315/375 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 4/54 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 6 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 4 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 102 places in 212 ms of which 6 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 96 places in 3940 ms of which 2 ms to minimize.
SMT process timed out in 13527ms, After SMT, problems are : Problem set: 1 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 201 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1128 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 499 transition count 398
Reduce places removed 44 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 455 transition count 392
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 449 transition count 392
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 102 place count 449 transition count 309
Deduced a syphon composed of 83 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 278 place count 356 transition count 309
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 284 place count 350 transition count 303
Iterating global reduction 3 with 6 rules applied. Total rules applied 290 place count 350 transition count 303
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 514 place count 237 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 516 place count 236 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 518 place count 236 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 520 place count 234 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 234 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 233 transition count 193
Applied a total of 522 rules in 180 ms. Remains 233 /507 variables (removed 274) and now considering 193/450 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 233/507 places, 193/450 transitions.
RANDOM walk for 40000 steps (760 resets) in 1771 ms. (22 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40003 steps (228 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (215 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (251 resets) in 358 ms. (111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (187 resets) in 205 ms. (194 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (219 resets) in 365 ms. (109 steps per ms) remains 4/4 properties
// Phase 1: matrix 193 rows 233 cols
[2024-05-21 23:57:27] [INFO ] Computed 82 invariants in 13 ms
[2024-05-21 23:57:27] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/157 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 49/206 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/209 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 189/398 variables, 209/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 26/424 variables, 22/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/425 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/426 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 319 constraints, problems are : Problem set: 0 solved, 4 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 73/157 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/206 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/209 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 189/398 variables, 209/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 26/424 variables, 22/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/424 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/425 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 1/426 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 3 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/426 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/426 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 334 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 2570ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 482 ms.
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 193/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 233 transition count 184
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 224 transition count 184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 224 transition count 171
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 50 place count 205 transition count 171
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 199 transition count 165
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 199 transition count 165
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 114 place count 172 transition count 140
Applied a total of 114 rules in 20 ms. Remains 172 /233 variables (removed 61) and now considering 140/193 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 172/233 places, 140/193 transitions.
RANDOM walk for 40000 steps (1530 resets) in 754 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (774 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (691 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (739 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
Probably explored full state space saw : 20288 states, properties seen :2
Probabilistic random walk after 86157 steps, saw 20288 distinct states, run finished after 437 ms. (steps per millisecond=197 ) properties seen :2
Explored full state space saw : 20288 states, properties seen :0
Exhaustive walk after 86157 steps, saw 20288 distinct states, run finished after 238 ms. (steps per millisecond=362 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-21 23:57:32] [INFO ] Flatten gal took : 58 ms
[2024-05-21 23:57:32] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:57:32] [INFO ] Input system was already deterministic with 450 transitions.
Computed a total of 134 stabilizing places and 125 stable transitions
Graph (complete) has 1135 edges and 507 vertex of which 504 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.66 ms
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 450
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 488 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 488 transition count 432
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 481 transition count 425
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 481 transition count 425
Applied a total of 51 rules in 53 ms. Remains 481 /507 variables (removed 26) and now considering 425/450 (removed 25) transitions.
// Phase 1: matrix 425 rows 481 cols
[2024-05-21 23:57:32] [INFO ] Computed 95 invariants in 12 ms
[2024-05-21 23:57:33] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-21 23:57:33] [INFO ] Invariant cache hit.
[2024-05-21 23:57:33] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-21 23:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 2/481 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-21 23:57:43] [INFO ] Deduced a trap composed of 87 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:57:43] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 102 places in 210 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 3 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 89 places in 225 ms of which 3 ms to minimize.
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 90 places in 6899 ms of which 4 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 5 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 3 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 5 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 101 places in 261 ms of which 5 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 3 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:57:53] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 4 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 20/115 constraints. Problems are: Problem set: 8 solved, 416 unsolved
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 106 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 4 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:57:55] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 2 ms to minimize.
[2024-05-21 23:57:56] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:57:57] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/135 constraints. Problems are: Problem set: 13 solved, 411 unsolved
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:57:58] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 4 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:58:00] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
Problem TDEAD346 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/155 constraints. Problems are: Problem set: 14 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/906 variables, and 155 constraints, problems are : Problem set: 14 solved, 410 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 14 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 37/37 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/37 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 2/481 variables, 56/93 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 60/155 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/175 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 6 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 4 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 6 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 5 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 6 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 88 places in 188 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 4 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 4 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 6 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/195 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 4 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 16 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 6 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 90 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/215 constraints. Problems are: Problem set: 17 solved, 407 unsolved
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 5 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/235 constraints. Problems are: Problem set: 17 solved, 407 unsolved
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 2 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 94 places in 203 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:58:25] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 5 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 4 ms to minimize.
[2024-05-21 23:58:26] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/255 constraints. Problems are: Problem set: 17 solved, 407 unsolved
[2024-05-21 23:58:27] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 5 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:58:28] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 7 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:58:29] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 3 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 20/275 constraints. Problems are: Problem set: 24 solved, 400 unsolved
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 1 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 60213ms, After SMT, problems are : Problem set: 24 solved, 400 unsolved
Search for dead transitions found 24 dead transitions in 60221ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 481/507 places, 401/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 481 /481 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61281 ms. Remains : 481/507 places, 401/450 transitions.
[2024-05-21 23:58:33] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:58:33] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:58:34] [INFO ] Input system was already deterministic with 401 transitions.
[2024-05-21 23:58:34] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:58:34] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:58:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2845857489149528475.gal : 20 ms
[2024-05-21 23:58:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality9093910971695824142.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2845857489149528475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9093910971695824142.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:59:04] [INFO ] Flatten gal took : 59 ms
[2024-05-21 23:59:04] [INFO ] Applying decomposition
[2024-05-21 23:59:04] [INFO ] Flatten gal took : 49 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/graph7160360137046818431.txt' '-o' '/tmp/graph7160360137046818431.bin' '-w' '/tmp/graph7160360137046818431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7160360137046818431.bin' '-l' '-1' '-v' '-w' '/tmp/graph7160360137046818431.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:04] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:04] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-21 23:59:04] [INFO ] Flatten gal took : 150 ms
[2024-05-21 23:59:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-21 23:59:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2092223114907544884.gal : 21 ms
[2024-05-21 23:59:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9389386379481462403.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/CTLCardinality2092223114907544884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9389386379481462403.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 SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 130 place count 434 transition count 280
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 341 place count 321 transition count 280
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 365 place count 297 transition count 256
Iterating global reduction 2 with 24 rules applied. Total rules applied 389 place count 297 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 389 place count 297 transition count 253
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 396 place count 293 transition count 253
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 636 place count 171 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 170 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 134
Applied a total of 638 rules in 156 ms. Remains 169 /507 variables (removed 338) and now considering 134/450 (removed 316) transitions.
// Phase 1: matrix 134 rows 169 cols
[2024-05-21 23:59:35] [INFO ] Computed 73 invariants in 13 ms
[2024-05-21 23:59:35] [INFO ] Implicit Places using invariants in 552 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 25, 48, 49, 52, 53, 143]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 554 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/507 places, 134/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 721 ms. Remains : 148/507 places, 134/450 transitions.
[2024-05-21 23:59:35] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:59:35] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:59:35] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-21 23:59:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:35] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:59:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality253867636247649737.gal : 2 ms
[2024-05-21 23:59:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15402499449952236987.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/CTLCardinality253867636247649737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15402499449952236987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20700,0.564057,24480,2,8717,5,84241,6,0,726,51000,0


Converting to forward existential form...Done !
original formula: E(((p339==0)||(p222==1)) U AG((p534==1)))
=> equivalent forward existential formula: [(FwdU(Init,((p339==0)||(p222==1))) * !(E(TRUE U !((p534==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t27, t28, t29, t30, t31, t56, t57, t58, t59, t60, t73, t84, t85, t86, t100, t107, t121, t...266
(forward)formula 0,0,3.37313,107700,1,0,170,423507,253,89,5387,201461,241
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 251 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 434 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 132 place count 433 transition count 279
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 345 place count 318 transition count 279
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 368 place count 295 transition count 256
Iterating global reduction 3 with 23 rules applied. Total rules applied 391 place count 295 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 391 place count 295 transition count 253
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 398 place count 291 transition count 253
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 643 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 644 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 645 place count 165 transition count 131
Applied a total of 645 rules in 62 ms. Remains 165 /507 variables (removed 342) and now considering 131/450 (removed 319) transitions.
// Phase 1: matrix 131 rows 165 cols
[2024-05-21 23:59:39] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 23:59:39] [INFO ] Implicit Places using invariants in 259 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 260 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/507 places, 131/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 328 ms. Remains : 145/507 places, 131/450 transitions.
[2024-05-21 23:59:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:59:39] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-21 23:59:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:39] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:59:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17802094212088890051.gal : 2 ms
[2024-05-21 23:59:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10251321713822839194.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/CTLCardinality17802094212088890051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10251321713822839194.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,19446,0.330902,15596,2,4639,5,54584,6,0,710,28761,0


Converting to forward existential form...Done !
original formula: AF(AG((p489==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p489==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t27, t28, t29, t53, t54, t55, t56, t57, t80, t81, t82, t117, t118, t119, Intersect...245
(forward)formula 0,0,1.1757,45584,1,0,199,178212,253,130,5264,95117,284
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 251 edges and 507 vertex of which 6 / 507 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 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 434 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 132 place count 433 transition count 279
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 344 place count 319 transition count 279
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 368 place count 295 transition count 255
Iterating global reduction 3 with 24 rules applied. Total rules applied 392 place count 295 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 392 place count 295 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 399 place count 291 transition count 252
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 639 place count 169 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 168 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Applied a total of 641 rules in 53 ms. Remains 167 /507 variables (removed 340) and now considering 133/450 (removed 317) transitions.
// Phase 1: matrix 133 rows 167 cols
[2024-05-21 23:59:40] [INFO ] Computed 72 invariants in 1 ms
[2024-05-21 23:59:41] [INFO ] Implicit Places using invariants in 190 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 22, 23, 24, 25, 26, 49, 50, 51, 52, 130]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 193 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/507 places, 133/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 251 ms. Remains : 147/507 places, 133/450 transitions.
[2024-05-21 23:59:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:41] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 23:59:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:59:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:59:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16493665590569553525.gal : 2 ms
[2024-05-21 23:59:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10515510980480235974.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/CTLCardinality16493665590569553525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10515510980480235974.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,20430,0.535487,24512,2,7720,5,93376,6,0,721,44079,0


Converting to forward existential form...Done !
original formula: AF(EG(EF(AG(((p270==0)&&(p134==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U !(E(TRUE U !(((p270==0)&&(p134==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t28, t29, t30, t31, t55, t56, t57, t58, t59, t82, t83, t84, t85, t99, t106, t120, t121, ...261
(forward)formula 0,0,3.85282,106604,1,0,168,429583,260,92,5539,215052,244
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 248 edges and 507 vertex of which 6 / 507 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 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 130 place count 434 transition count 281
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 340 place count 321 transition count 281
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 364 place count 297 transition count 257
Iterating global reduction 2 with 24 rules applied. Total rules applied 388 place count 297 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 388 place count 297 transition count 254
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 395 place count 293 transition count 254
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 637 place count 170 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 639 place count 168 transition count 134
Applied a total of 639 rules in 98 ms. Remains 168 /507 variables (removed 339) and now considering 134/450 (removed 316) transitions.
// Phase 1: matrix 134 rows 168 cols
[2024-05-21 23:59:45] [INFO ] Computed 72 invariants in 3 ms
[2024-05-21 23:59:45] [INFO ] Implicit Places using invariants in 273 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 18, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 274 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 149/507 places, 134/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 378 ms. Remains : 149/507 places, 134/450 transitions.
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:59:45] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:59:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality3959905085383941494.gal : 1 ms
[2024-05-21 23:59:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality266715554436328046.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/CTLCardinality3959905085383941494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality266715554436328046.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,109380,0.715456,17856,2,5272,5,65743,6,0,729,35515,0


Converting to forward existential form...Done !
original formula: EG(EF(((p108==1)&&((p506==0)||(p442==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p108==1)&&((p506==0)||(p442==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t29, t30, t31, t32, t33, t57, t58, t59, t60, t61, t84, t85, t86, t121, t122, t123, Inter...249
(forward)formula 0,1,6.30879,157172,1,0,285,732578,258,209,5398,640395,366
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 450
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 481 transition count 425
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 481 transition count 425
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 471 transition count 415
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 471 transition count 415
Applied a total of 71 rules in 21 ms. Remains 471 /507 variables (removed 36) and now considering 415/450 (removed 35) transitions.
// Phase 1: matrix 415 rows 471 cols
[2024-05-21 23:59:51] [INFO ] Computed 95 invariants in 10 ms
[2024-05-21 23:59:52] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 23:59:52] [INFO ] Invariant cache hit.
[2024-05-21 23:59:52] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-21 23:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 2/471 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 26 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 5 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 4 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 3 solved, 411 unsolved
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 5 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 5 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:00:08] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 20 solved, 394 unsolved
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:00:11] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:12] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 1 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 1 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 2 ms to minimize.
[2024-05-22 00:00:14] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 29 solved, 385 unsolved
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 5 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 5 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 5 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 5 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 5 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 385 unsolved
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:00:22] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/886 variables, and 184 constraints, problems are : Problem set: 29 solved, 385 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 29 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 29 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 2/471 variables, 56/93 constraints. Problems are: Problem set: 29 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 2/95 constraints. Problems are: Problem set: 29 solved, 385 unsolved
Problem TDEAD323 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 89/184 constraints. Problems are: Problem set: 30 solved, 384 unsolved
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
Problem TDEAD336 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/204 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 104 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 4 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 2 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/224 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 1 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:36] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/244 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 100 places in 179 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/264 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:00:43] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 5 ms to minimize.
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 5 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 20/284 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 20/304 constraints. Problems are: Problem set: 31 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/886 variables, and 304 constraints, problems are : Problem set: 31 solved, 383 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 0/414 constraints, Known Traps: 209/209 constraints]
After SMT, in 60153ms problems are : Problem set: 31 solved, 383 unsolved
Search for dead transitions found 31 dead transitions in 60157ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/507 places, 384/450 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 384
Applied a total of 1 rules in 8 ms. Remains 470 /471 variables (removed 1) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 470 cols
[2024-05-22 00:00:53] [INFO ] Computed 98 invariants in 2 ms
[2024-05-22 00:00:53] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 00:00:53] [INFO ] Invariant cache hit.
[2024-05-22 00:00:53] [INFO ] Implicit Places using invariants and state equation in 481 ms returned [150, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 716 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/507 places, 384/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 468 /468 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61835 ms. Remains : 468/507 places, 384/450 transitions.
[2024-05-22 00:00:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:00:53] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:00:53] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-22 00:00:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:00:53] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:00:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2730598367762239487.gal : 15 ms
[2024-05-22 00:00:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5661228933697631197.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/CTLCardinality2730598367762239487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5661228933697631197.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:01:24] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:01:24] [INFO ] Applying decomposition
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph371771572399754616.txt' '-o' '/tmp/graph371771572399754616.bin' '-w' '/tmp/graph371771572399754616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph371771572399754616.bin' '-l' '-1' '-v' '-w' '/tmp/graph371771572399754616.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:01:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:01:24] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2024-05-22 00:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16154294501509493258.gal : 8 ms
[2024-05-22 00:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2412276843181755940.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/CTLCardinality16154294501509493258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2412276843181755940.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21553e+26,14.3987,295868,17625,32,462334,511,968,995750,55,1312,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 247 edges and 507 vertex of which 6 / 507 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 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 498 transition count 381
Reduce places removed 61 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 437 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 130 place count 434 transition count 280
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 342 place count 320 transition count 280
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 364 place count 298 transition count 258
Iterating global reduction 3 with 22 rules applied. Total rules applied 386 place count 298 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 386 place count 298 transition count 255
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 393 place count 294 transition count 255
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 627 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 628 place count 174 transition count 139
Applied a total of 628 rules in 90 ms. Remains 174 /507 variables (removed 333) and now considering 139/450 (removed 311) transitions.
// Phase 1: matrix 139 rows 174 cols
[2024-05-22 00:01:54] [INFO ] Computed 73 invariants in 6 ms
[2024-05-22 00:02:03] [INFO ] Implicit Places using invariants in 8842 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8848 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 173/507 places, 139/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8945 ms. Remains : 173/507 places, 139/450 transitions.
[2024-05-22 00:02:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:02:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:02:03] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-22 00:02:03] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:02:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:02:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1107953229664136260.gal : 3 ms
[2024-05-22 00:02:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2842011172551314137.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/CTLCardinality1107953229664136260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2842011172551314137.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20952,0.16753,12308,2,4603,5,33920,6,0,827,27533,0


Converting to forward existential form...Done !
original formula: EF(((A((p463==1) U ((p195!=1) * EF(((p361==0)||(p595==1))))) * (p572==0)) * ((p216==1)&&((p283==0)||(p4==1)))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p216==1)&&((p283==0)||(p4==1)))) * (p572==0)) * !(EG(!(((p195!=1) * E(TRUE U ((p361==0)...311
Reverse transition relation is NOT exact ! Due to transitions t29, t30, t31, t32, t33, t34, t35, t60, t61, t62, t63, t64, t79, t90, t91, t92, t93, t106, t1...277
Using saturation style SCC detection
(forward)formula 0,1,5.19251,113160,1,0,251,523016,275,149,6292,415619,329
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 450
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 481 transition count 426
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 472 transition count 417
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 472 transition count 417
Applied a total of 68 rules in 50 ms. Remains 472 /507 variables (removed 35) and now considering 417/450 (removed 33) transitions.
// Phase 1: matrix 417 rows 472 cols
[2024-05-22 00:02:08] [INFO ] Computed 94 invariants in 5 ms
[2024-05-22 00:02:09] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-22 00:02:09] [INFO ] Invariant cache hit.
[2024-05-22 00:02:09] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 00:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 6 ms to minimize.
[2024-05-22 00:02:21] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 96 places in 216 ms of which 6 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 87 places in 668 ms of which 4 ms to minimize.
[2024-05-22 00:02:23] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 4 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 5 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 6 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 4 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 2 ms to minimize.
[2024-05-22 00:02:24] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 3 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 5 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 5 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 5 ms to minimize.
[2024-05-22 00:02:25] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 93 places in 211 ms of which 5 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 105 places in 174 ms of which 5 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 5 ms to minimize.
[2024-05-22 00:02:26] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 98 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 5 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 92 places in 199 ms of which 16 ms to minimize.
[2024-05-22 00:02:27] [INFO ] Deduced a trap composed of 100 places in 197 ms of which 4 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 6 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 2 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:02:28] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 15 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 2 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 6 ms to minimize.
[2024-05-22 00:02:29] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 6 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:02:30] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 1 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 5 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 3 ms to minimize.
[2024-05-22 00:02:31] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 86 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:02:32] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 6 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 84 places in 209 ms of which 3 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/154 constraints. Problems are: Problem set: 8 solved, 408 unsolved
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 89 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 14 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 5 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 5 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 85 places in 251 ms of which 6 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 4 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/889 variables, and 171 constraints, problems are : Problem set: 8 solved, 408 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/472 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 8 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 8 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 8 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 55/92 constraints. Problems are: Problem set: 8 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/94 constraints. Problems are: Problem set: 8 solved, 408 unsolved
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 77/171 constraints. Problems are: Problem set: 27 solved, 389 unsolved
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:02:44] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 18 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:02:45] [INFO ] Deduced a trap composed of 88 places in 204 ms of which 2 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 90 places in 220 ms of which 5 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 2 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 88 places in 227 ms of which 2 ms to minimize.
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/191 constraints. Problems are: Problem set: 27 solved, 389 unsolved
[2024-05-22 00:02:47] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 4 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 6 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 99 places in 198 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 5 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 97 places in 245 ms of which 4 ms to minimize.
[2024-05-22 00:02:49] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 4 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:02:50] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:02:51] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/211 constraints. Problems are: Problem set: 31 solved, 385 unsolved
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 7 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 14 ms to minimize.
[2024-05-22 00:02:52] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:02:53] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/231 constraints. Problems are: Problem set: 33 solved, 383 unsolved
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 2 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:02:59] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:03:01] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/251 constraints. Problems are: Problem set: 33 solved, 383 unsolved
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 2 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:03:02] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 2 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 86 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 20/271 constraints. Problems are: Problem set: 33 solved, 383 unsolved
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:03:08] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 20/291 constraints. Problems are: Problem set: 33 solved, 383 unsolved
[2024-05-22 00:03:09] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:03:10] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 60258ms, After SMT, problems are : Problem set: 33 solved, 383 unsolved
Search for dead transitions found 33 dead transitions in 60269ms
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 : 472/507 places, 384/450 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 384
Applied a total of 1 rules in 22 ms. Remains 471 /472 variables (removed 1) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 471 cols
[2024-05-22 00:03:10] [INFO ] Computed 99 invariants in 6 ms
[2024-05-22 00:03:10] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:03:10] [INFO ] Invariant cache hit.
[2024-05-22 00:03:10] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [153, 154]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 673 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 469/507 places, 384/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 469 /469 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62201 ms. Remains : 469/507 places, 384/450 transitions.
[2024-05-22 00:03:10] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:03:10] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-22 00:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:03:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality11303051674814363162.gal : 2 ms
[2024-05-22 00:03:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9245864422434538958.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/CTLCardinality11303051674814363162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9245864422434538958.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.24013e+26,3.63406,63032,5079,60,101841,1235,949,208644,70,2724,0


Converting to forward existential form...Done !
original formula: AG(AX(((i20.i1.u121.p412==1) + ((AX((i5.i1.u103.p319==0)) * ((i7.i0.u24.p73==0)||(i9.u34.p106==1))) * ((i12.i0.u56.p192==0)||(i19.u130.p4...166
=> equivalent forward existential formula: (([(EY((EY(FwdU(Init,TRUE)) * !((i20.i1.u121.p412==1)))) * !((i5.i1.u103.p319==0)))] = FALSE * [((EY(FwdU(Init,T...355
(forward)formula 0,0,4.18987,63296,1,0,101841,1235,1388,208644,96,2724,95328
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 450
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 480 transition count 425
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 480 transition count 425
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 468 transition count 413
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 468 transition count 413
Applied a total of 76 rules in 26 ms. Remains 468 /507 variables (removed 39) and now considering 413/450 (removed 37) transitions.
// Phase 1: matrix 413 rows 468 cols
[2024-05-22 00:03:45] [INFO ] Computed 94 invariants in 12 ms
[2024-05-22 00:03:45] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-22 00:03:45] [INFO ] Invariant cache hit.
[2024-05-22 00:03:46] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 103 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 2 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 2 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 4 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/134 constraints. Problems are: Problem set: 7 solved, 405 unsolved
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 5 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/154 constraints. Problems are: Problem set: 19 solved, 393 unsolved
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 5 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/881 variables, and 156 constraints, problems are : Problem set: 19 solved, 393 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 19 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 19 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 19 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 19 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 19 solved, 393 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 62/156 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 5 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 5 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 5 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 6 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 6 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 9 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 6 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 6 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/176 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/196 constraints. Problems are: Problem set: 31 solved, 381 unsolved
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 4 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 5 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
Problem TDEAD327 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/216 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 89 places in 3939 ms of which 5 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 93 places in 189 ms of which 7 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/236 constraints. Problems are: Problem set: 32 solved, 380 unsolved
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 5 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/881 variables, and 242 constraints, problems are : Problem set: 32 solved, 380 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 148/148 constraints]
After SMT, in 60124ms problems are : Problem set: 32 solved, 380 unsolved
Search for dead transitions found 32 dead transitions in 60155ms
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 : 468/507 places, 381/450 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 381
Applied a total of 1 rules in 8 ms. Remains 467 /468 variables (removed 1) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 467 cols
[2024-05-22 00:04:46] [INFO ] Computed 98 invariants in 2 ms
[2024-05-22 00:04:46] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 00:04:46] [INFO ] Invariant cache hit.
[2024-05-22 00:04:47] [INFO ] Implicit Places using invariants and state equation in 502 ms returned [150, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 763 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 465/507 places, 381/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 465 /465 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62005 ms. Remains : 465/507 places, 381/450 transitions.
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:04:47] [INFO ] Input system was already deterministic with 381 transitions.
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality582219217906208585.gal : 2 ms
[2024-05-22 00:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4379825046513207639.ctl : 12 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/CTLCardinality582219217906208585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4379825046513207639.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:05:17] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:05:17] [INFO ] Applying decomposition
[2024-05-22 00:05:17] [INFO ] Flatten gal took : 15 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/graph1106445092140164578.txt' '-o' '/tmp/graph1106445092140164578.bin' '-w' '/tmp/graph1106445092140164578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1106445092140164578.bin' '-l' '-1' '-v' '-w' '/tmp/graph1106445092140164578.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:05:17] [INFO ] Decomposing Gal with order
[2024-05-22 00:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:05:17] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-22 00:05:17] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:05:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2024-05-22 00:05:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality18328087447492732748.gal : 17 ms
[2024-05-22 00:05:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9610739436810550830.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/CTLCardinality18328087447492732748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9610739436810550830.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31342e+26,10.3693,223840,5031,44,358269,704,1000,611735,67,1437,0


Converting to forward existential form...Done !
original formula: EX((EF(((i6.i1.u111.p367==0)&&(i10.i3.u153.p596==1))) * ((i12.i1.u78.p247==0) + (EG(AG(((i10.i2.u52.p198==0)&&(i7.i1.u84.p262==1)))) * (A...255
=> equivalent forward existential formula: ([((EY(Init) * E(TRUE U ((i6.i1.u111.p367==0)&&(i10.i3.u153.p596==1)))) * (i12.i1.u78.p247==0))] != FALSE + ([((...632
Reverse transition relation is NOT exact ! Due to transitions t7, t167, t240, t262, t267, t276, t352, t360, t361, t368, t373, t374, i0.u50.t205, i1.u40.t22...1286
(forward)formula 0,1,24.6804,387256,1,0,704086,704,6486,1.38127e+06,317,1437,1650506
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 498 transition count 377
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 132 place count 433 transition count 280
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 342 place count 320 transition count 280
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 365 place count 297 transition count 257
Iterating global reduction 2 with 23 rules applied. Total rules applied 388 place count 297 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 388 place count 297 transition count 254
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 395 place count 293 transition count 254
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 639 place count 169 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 640 place count 168 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Applied a total of 641 rules in 107 ms. Remains 167 /507 variables (removed 340) and now considering 133/450 (removed 317) transitions.
// Phase 1: matrix 133 rows 167 cols
[2024-05-22 00:05:42] [INFO ] Computed 72 invariants in 3 ms
[2024-05-22 00:05:42] [INFO ] Implicit Places using invariants in 264 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 265 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/507 places, 133/450 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 376 ms. Remains : 147/507 places, 133/450 transitions.
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:05:43] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3603809851063702893.gal : 2 ms
[2024-05-22 00:05:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12687879593994351872.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/CTLCardinality3603809851063702893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12687879593994351872.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,22680,0.111676,7412,2,2149,5,12562,6,0,720,10025,0


Converting to forward existential form...Done !
original formula: (EF((p514==1)) * AG(((p581==0)||(p197==1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p514==1))))] = FALSE * [(FwdU(Init,TRUE) * !(((p581==0)||(p197==1))))] = FALSE)
(forward)formula 0,0,0.117906,7676,1,0,8,12562,9,2,731,10025,1
FORMULA BusinessProcesses-PT-14-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 239 edges and 507 vertex of which 6 / 507 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 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 498 transition count 384
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 440 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 438 transition count 382
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 122 place count 438 transition count 282
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 339 place count 321 transition count 282
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 359 place count 301 transition count 262
Iterating global reduction 3 with 20 rules applied. Total rules applied 379 place count 301 transition count 262
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 622 place count 178 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 177 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 624 place count 176 transition count 141
Applied a total of 624 rules in 54 ms. Remains 176 /507 variables (removed 331) and now considering 141/450 (removed 309) transitions.
// Phase 1: matrix 141 rows 176 cols
[2024-05-22 00:05:43] [INFO ] Computed 73 invariants in 2 ms
[2024-05-22 00:05:43] [INFO ] Implicit Places using invariants in 199 ms returned [2, 5, 20, 24, 25, 26, 27, 28, 29, 52, 53, 54, 55]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 200 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 163/507 places, 141/450 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 259 ms. Remains : 163/507 places, 141/450 transitions.
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:43] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:05:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:05:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6371305871784437677.gal : 3 ms
[2024-05-22 00:05:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14254858550087314711.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/CTLCardinality6371305871784437677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14254858550087314711.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,145058,0.281394,13844,2,4800,5,39618,6,0,791,32811,0


Converting to forward existential form...Done !
original formula: EF(AG(((AG((p103==0)) + (p477==1)) + ((EF(((p411==0)||(p360==1))) * (A((p470==0) U (p617==1)) + !(A((p600==1) U (p405==1))))) + ((p107==0...172
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(E(TRUE U !((p103==0)))) + (p477==1)) + ((E(TRUE U ((p411==0)||(p360==1))) *...348
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t42, t44, t45, t46, t47, t48, t49, t74, t75, t76, t77, t78, t81, t94, t95, t96, t127,...268
(forward)formula 0,1,11.15,252192,1,0,561,1.33148e+06,292,317,5877,1.17626e+06,742
FORMULA BusinessProcesses-PT-14-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 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 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 130 place count 434 transition count 279
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 345 place count 318 transition count 279
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 368 place count 295 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 391 place count 295 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 391 place count 295 transition count 253
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 398 place count 291 transition count 253
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 640 place count 168 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 166 transition count 133
Applied a total of 642 rules in 39 ms. Remains 166 /507 variables (removed 341) and now considering 133/450 (removed 317) transitions.
// Phase 1: matrix 133 rows 166 cols
[2024-05-22 00:05:54] [INFO ] Computed 71 invariants in 2 ms
[2024-05-22 00:05:54] [INFO ] Implicit Places using invariants in 183 ms returned [0, 1, 2, 3, 7, 8, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 185 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/507 places, 133/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 235 ms. Remains : 148/507 places, 133/450 transitions.
[2024-05-22 00:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:05:54] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 00:05:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:05:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:05:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17441600063739417143.gal : 1 ms
[2024-05-22 00:05:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality18075249678496692578.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/CTLCardinality17441600063739417143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18075249678496692578.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,58110,0.296106,18800,2,5731,5,69555,6,0,724,36381,0


Converting to forward existential form...Done !
original formula: A(!(((p564==0)||(p416==1))) U EF((p61==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p61==1)))))) * !(E(!(E(TRUE U (p61==1))) U (!(!(((p564==0)||(p416==1)))) * !(E(TRUE U...180
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t28, t29, t30, t31, t32, t59, t60, t61, t62, t63, t87, t88, t89, t121, t122, Interse...247
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.17531,154988,1,0,246,938733,259,147,5583,535388,321
FORMULA BusinessProcesses-PT-14-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 00:06:00] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:06:00] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:06:00] [INFO ] Applying decomposition
[2024-05-22 00:06:00] [INFO ] Flatten gal took : 28 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/graph16380844575888539916.txt' '-o' '/tmp/graph16380844575888539916.bin' '-w' '/tmp/graph16380844575888539916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16380844575888539916.bin' '-l' '-1' '-v' '-w' '/tmp/graph16380844575888539916.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:06:00] [INFO ] Decomposing Gal with order
[2024-05-22 00:06:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:06:00] [INFO ] Removed a total of 250 redundant transitions.
[2024-05-22 00:06:00] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-22 00:06:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4527811592185088201.gal : 6 ms
[2024-05-22 00:06:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1311327139141699804.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/CTLCardinality4527811592185088201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1311327139141699804.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12358e+26,7.45308,177312,7261,129,255632,1255,1266,880917,101,4069,0


Converting to forward existential form...Done !
original formula: EF((((EX(E((i7.i1.u149.p505!=1) U E((i3.u37.p96==1) U (i6.i0.u82.p247==1)))) * EX(((i2.i1.u25.p301==1)&&((i20.i1.u150.p558==0)||(i0.u56.p...541
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((EX(E((i7.i1.u149.p505!=1) U E((i3.u37.p96==1) U (i6.i0.u82.p247==1)))) * EX(((i2.i1.u25...1072
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t20, t112, t302, t419, t442, i0.u54.t237, i0.u56.t233, i0.u73.t210, i1.i0.t307, i1.i0...1685
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,41.0397,974896,1,0,1.42466e+06,1368,8662,5.35496e+06,500,4614,2564677
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF((((!(A((i5.i0.u6.p15==0) U ((i20.i1.u165.p571==0)||(i11.i1.u106.p329==1)))) + ((i0.u54.p153==0)&&(i7.i1.u27.p76==1))) * ((EG((i2.i0.u...471
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U EX((!(EG(!((i20.i0.u146.p491==0)))) * (i8.i1.u122.p394==0)))))),!((((!(!((E(!(((i20.i1....767
(forward)formula 1,1,49.1994,1089736,1,0,1.60945e+06,1374,8759,5.95973e+06,502,4626,2772044
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 610165 ms.

BK_STOP 1716336410079

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, examination is CTLCardinality"
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-171620399700553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;