About the Execution of ITS-Tools for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15984.644 | 3600000.00 | 3794070.00 | 11296.20 | ?TT?TT???FFT???? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100137
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717376702888
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 01:05:05] [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-06-03 01:05:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 01:05:05] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-03 01:05:05] [INFO ] Transformed 252 places.
[2024-06-03 01:05:05] [INFO ] Transformed 543 transitions.
[2024-06-03 01:05:05] [INFO ] Found NUPN structural information;
[2024-06-03 01:05:06] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 161 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 106 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 228 transition count 501
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 228 transition count 501
Applied a total of 48 rules in 79 ms. Remains 228 /252 variables (removed 24) and now considering 501/541 (removed 40) transitions.
// Phase 1: matrix 501 rows 228 cols
[2024-06-03 01:05:06] [INFO ] Computed 7 invariants in 46 ms
[2024-06-03 01:05:07] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-03 01:05:07] [INFO ] Invariant cache hit.
[2024-06-03 01:05:07] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-03 01:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 69 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 4 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 22 places in 402 ms of which 4 ms to minimize.
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:05:20] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:05:20] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 5 ms to minimize.
[2024-06-03 01:05:20] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 4 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 4 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 2 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 4 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 4 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 4 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 4 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 4 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-03 01:05:24] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:05:24] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 4 ms to minimize.
[2024-06-03 01:05:24] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 4 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 4 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 4 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 2 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 4 ms to minimize.
[2024-06-03 01:05:27] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 4 ms to minimize.
[2024-06-03 01:05:27] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 4 ms to minimize.
[2024-06-03 01:05:27] [INFO ] Deduced a trap composed of 152 places in 238 ms of which 4 ms to minimize.
[2024-06-03 01:05:27] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 4 ms to minimize.
[2024-06-03 01:05:29] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 4 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 4 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 4 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 4 ms to minimize.
[2024-06-03 01:05:31] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:05:31] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-03 01:05:37] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 5 ms to minimize.
[2024-06-03 01:05:37] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 3 ms to minimize.
[2024-06-03 01:05:38] [INFO ] Deduced a trap composed of 146 places in 333 ms of which 4 ms to minimize.
[2024-06-03 01:05:38] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:05:39] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 2 ms to minimize.
SMT process timed out in 31135ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 31190ms
Starting structural reductions in LTL mode, iteration 1 : 228/252 places, 501/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32751 ms. Remains : 228/252 places, 501/541 transitions.
Support contains 106 out of 228 places after structural reductions.
[2024-06-03 01:05:39] [INFO ] Flatten gal took : 172 ms
[2024-06-03 01:05:39] [INFO ] Flatten gal took : 97 ms
[2024-06-03 01:05:39] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 104 out of 228 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (1532 resets) in 2889 ms. (13 steps per ms) remains 55/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 63 ms. (62 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (36 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 69 ms. (57 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 78 ms. (50 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (35 resets) in 59 ms. (66 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 71 ms. (55 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (34 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (33 resets) in 42 ms. (93 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (35 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (34 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (44 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (35 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (34 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (35 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (35 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (35 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (33 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (35 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
[2024-06-03 01:05:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 140/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 501/729 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-03 01:05:43] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 3 ms to minimize.
Problem AtomicPropp26 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/729 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 729/729 variables, and 236 constraints, problems are : Problem set: 1 solved, 53 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 53 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 142/228 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 52 unsolved
[2024-06-03 01:05:46] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 4 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 4 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 3 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 4 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 4 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 4 ms to minimize.
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 4 ms to minimize.
Problem AtomicPropp33 is UNSAT
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
SMT process timed out in 9173ms, After SMT, problems are : Problem set: 2 solved, 52 unsolved
Fused 52 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 80 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 501/501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 228 transition count 485
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 212 transition count 483
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 41 place count 211 transition count 477
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 47 place count 205 transition count 477
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 47 place count 205 transition count 472
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 57 place count 200 transition count 472
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 61 place count 196 transition count 466
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 196 transition count 466
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 103 place count 177 transition count 447
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 121 place count 168 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 144 place count 168 transition count 445
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 165 transition count 442
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 164 place count 165 transition count 428
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 178 place count 151 transition count 428
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 151 transition count 428
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 151 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 151 transition count 427
Applied a total of 182 rules in 403 ms. Remains 151 /228 variables (removed 77) and now considering 427/501 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 151/228 places, 427/501 transitions.
RANDOM walk for 40000 steps (17 resets) in 883 ms. (45 steps per ms) remains 41/51 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (11 resets) in 47 ms. (83 steps per ms) remains 35/39 properties
BEST_FIRST walk for 4000 steps (10 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (9 resets) in 40 ms. (97 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (11 resets) in 72 ms. (54 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (8 resets) in 62 ms. (63 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4000 steps (11 resets) in 28 ms. (137 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 84 ms. (47 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 40 ms. (97 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 43 ms. (90 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (14 resets) in 28 ms. (137 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (12 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
// Phase 1: matrix 427 rows 151 cols
[2024-06-03 01:05:52] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 01:05:52] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 106/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/151 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 427/578 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 86/244 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:53] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2024-06-03 01:05:53] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-03 01:05:53] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:54] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:05:54] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:05:54] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/578 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/578 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 252 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3757 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 106/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 3 ms to minimize.
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 5/151 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 427/578 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 86/260 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 23/283 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-03 01:06:00] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 01:06:10] [INFO ] Deduced a trap composed of 95 places in 201 ms of which 2 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 0/578 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 288 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 21/21 constraints]
After SMT, in 48799ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 9 properties in 36341 ms.
Support contains 19 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 427/427 transitions.
Graph (trivial) has 119 edges and 151 vertex of which 4 / 151 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 149 transition count 410
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 136 transition count 408
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 135 transition count 405
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 132 transition count 405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 36 place count 132 transition count 403
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 130 transition count 403
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 49 place count 121 transition count 387
Iterating global reduction 4 with 9 rules applied. Total rules applied 58 place count 121 transition count 387
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 88 place count 106 transition count 372
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 105 transition count 370
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 105 transition count 370
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 114 place count 93 transition count 415
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 122 place count 93 transition count 407
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 92 transition count 403
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 92 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 134 place count 92 transition count 393
Free-agglomeration rule applied 14 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 148 place count 92 transition count 373
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 176 place count 78 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 188 place count 78 transition count 347
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 78 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 77 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 192 place count 77 transition count 344
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 77 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 76 transition count 358
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 195 place count 76 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 75 transition count 357
Applied a total of 196 rules in 177 ms. Remains 75 /151 variables (removed 76) and now considering 357/427 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 75/151 places, 357/427 transitions.
RANDOM walk for 40000 steps (3345 resets) in 814 ms. (49 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40003 steps (916 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2024-06-03 01:07:17] [INFO ] Flow matrix only has 303 transitions (discarded 54 similar events)
// Phase 1: matrix 303 rows 75 cols
[2024-06-03 01:07:17] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:07:17] [INFO ] State equation strengthened by 108 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/253 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/363 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 103/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/371 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/378 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/378 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/253 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/363 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 103/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/371 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/378 variables, 7/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 01:07:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2024-06-03 01:07:18] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-03 01:07:18] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/378 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/378 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 715ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 357/357 transitions.
Graph (trivial) has 58 edges and 75 vertex of which 2 / 75 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 74 transition count 351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 70 transition count 351
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 70 transition count 348
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 67 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 62 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 62 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 62 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 60 transition count 319
Performed 7 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 45 place count 53 transition count 358
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 60 place count 53 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 73 place count 53 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 52 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 52 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 51 transition count 324
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 51 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 83 place count 51 transition count 321
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 87 place count 51 transition count 317
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 98 place count 47 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 100 place count 46 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 107 place count 46 transition count 310
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 108 place count 46 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 109 place count 45 transition count 324
Applied a total of 109 rules in 108 ms. Remains 45 /75 variables (removed 30) and now considering 324/357 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 45/75 places, 324/357 transitions.
RANDOM walk for 40000 steps (2895 resets) in 377 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30335 steps (537 resets) in 95 ms. (315 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-06-03 01:07:18] [INFO ] Flatten gal took : 60 ms
[2024-06-03 01:07:19] [INFO ] Flatten gal took : 57 ms
[2024-06-03 01:07:19] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 95 out of 228 places (down from 98) after GAL structural reductions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 211 transition count 474
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 211 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 209 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 209 transition count 472
Applied a total of 38 rules in 16 ms. Remains 209 /228 variables (removed 19) and now considering 472/501 (removed 29) transitions.
// Phase 1: matrix 472 rows 209 cols
[2024-06-03 01:07:19] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 01:07:19] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-03 01:07:19] [INFO ] Invariant cache hit.
[2024-06-03 01:07:19] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-03 01:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 4 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 127 places in 220 ms of which 3 ms to minimize.
[2024-06-03 01:07:28] [INFO ] Deduced a trap composed of 128 places in 248 ms of which 3 ms to minimize.
[2024-06-03 01:07:28] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 4 ms to minimize.
[2024-06-03 01:07:29] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 5 ms to minimize.
[2024-06-03 01:07:30] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:07:30] [INFO ] Deduced a trap composed of 129 places in 206 ms of which 4 ms to minimize.
[2024-06-03 01:07:30] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:07:31] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:07:31] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 3 ms to minimize.
[2024-06-03 01:07:31] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:07:31] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:07:32] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 3 ms to minimize.
[2024-06-03 01:07:32] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 01:07:33] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2024-06-03 01:07:33] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2024-06-03 01:07:34] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
[2024-06-03 01:07:35] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:07:35] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:07:35] [INFO ] Deduced a trap composed of 132 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:07:36] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 4 ms to minimize.
[2024-06-03 01:07:36] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 4 ms to minimize.
[2024-06-03 01:07:36] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:07:37] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:07:37] [INFO ] Deduced a trap composed of 136 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:07:37] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 2 ms to minimize.
[2024-06-03 01:07:38] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:07:38] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2024-06-03 01:07:38] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:07:38] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:07:39] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:07:39] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:07:39] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:07:39] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 01:07:44] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:07:44] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:07:45] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:07:46] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:07:47] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:07:48] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:07:48] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:07:49] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:07:49] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:07:50] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:07:50] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 4 ms to minimize.
SMT process timed out in 30678ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30684ms
Starting structural reductions in LTL mode, iteration 1 : 209/228 places, 472/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31304 ms. Remains : 209/228 places, 472/501 transitions.
[2024-06-03 01:07:50] [INFO ] Flatten gal took : 60 ms
[2024-06-03 01:07:50] [INFO ] Flatten gal took : 50 ms
[2024-06-03 01:07:50] [INFO ] Input system was already deterministic with 472 transitions.
[2024-06-03 01:07:50] [INFO ] Flatten gal took : 47 ms
[2024-06-03 01:07:50] [INFO ] Flatten gal took : 45 ms
[2024-06-03 01:07:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9395500868119484399.gal : 33 ms
[2024-06-03 01:07:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13439450136602918628.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9395500868119484399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13439450136602918628.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-06-03 01:08:20] [INFO ] Flatten gal took : 25 ms
[2024-06-03 01:08:20] [INFO ] Applying decomposition
[2024-06-03 01:08:20] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11371805581902649233.txt' '-o' '/tmp/graph11371805581902649233.bin' '-w' '/tmp/graph11371805581902649233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11371805581902649233.bin' '-l' '-1' '-v' '-w' '/tmp/graph11371805581902649233.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:08:21] [INFO ] Decomposing Gal with order
[2024-06-03 01:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:08:21] [INFO ] Removed a total of 1260 redundant transitions.
[2024-06-03 01:08:21] [INFO ] Flatten gal took : 178 ms
[2024-06-03 01:08:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 43 ms.
[2024-06-03 01:08:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4412149657680272354.gal : 19 ms
[2024-06-03 01:08:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11158749776078208089.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/CTLCardinality4412149657680272354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11158749776078208089.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.4379e+07,18.6815,257588,4458,63,140121,804,1236,2.48062e+06,101,2485,0
Converting to forward existential form...Done !
original formula: A(AF(!(((EX(((i6.i2.u60.p221==0)||(i5.u3.p20==1))) + (AF((i3.i1.u33.p115==0)) * ((i3.i0.u28.p108==0)||(i5.u4.p8==1)))) + AF(((i7.i2.u61.p...463
=> equivalent forward existential formula: [((Init * !(EG(!((((i1.u25.p96!=1) * !((E(!(!((E(!(((i7.i2.u61.p234==0)||(i5.u3.p14==1))) U (!(((i6.i2.u60.p221=...3111
Reverse transition relation is NOT exact ! Due to transitions t19, t41, t107, t160, t162, t166, t184, t187, t196, t198, t200, t218, t240, t242, t248, t250,...1316
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 9 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:08:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:08:51] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-03 01:08:51] [INFO ] Invariant cache hit.
[2024-06-03 01:08:52] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:08:59] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 4 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 6 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 7 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 5 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 125 places in 185 ms of which 2 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 125 places in 223 ms of which 4 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 125 places in 300 ms of which 4 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:09:04] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 2 ms to minimize.
[2024-06-03 01:09:05] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 4 ms to minimize.
[2024-06-03 01:09:05] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:06] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-03 01:09:06] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:09:06] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 4 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 3 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 3 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 4 ms to minimize.
[2024-06-03 01:09:10] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:09:10] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:09:10] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 4 ms to minimize.
[2024-06-03 01:09:11] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:09:11] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:09:11] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:09:11] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:09:12] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:09:12] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:09:12] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 5 ms to minimize.
[2024-06-03 01:09:13] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:16] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 4 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 4 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 3 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 3 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 4 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:09:20] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:09:20] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:09:21] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 4 ms to minimize.
[2024-06-03 01:09:21] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:09:21] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:09:22] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 63 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:27] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 4 ms to minimize.
[2024-06-03 01:09:27] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 4 ms to minimize.
[2024-06-03 01:09:28] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2024-06-03 01:09:29] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2024-06-03 01:09:29] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:31] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 4 ms to minimize.
[2024-06-03 01:09:32] [INFO ] Deduced a trap composed of 134 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:09:33] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:09:34] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:38] [INFO ] Deduced a trap composed of 130 places in 278 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:09:43] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:09:44] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:09:44] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/659 variables, 201/277 constraints. Problems are: Problem set: 29 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 705 constraints, problems are : Problem set: 29 solved, 428 unsolved in 30186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 428/457 constraints, Known Traps: 69/69 constraints]
After SMT, in 60609ms problems are : Problem set: 29 solved, 428 unsolved
Search for dead transitions found 29 dead transitions in 60616ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 201/228 places, 429/501 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61365 ms. Remains : 201/228 places, 429/501 transitions.
[2024-06-03 01:09:53] [INFO ] Flatten gal took : 35 ms
[2024-06-03 01:09:53] [INFO ] Flatten gal took : 35 ms
[2024-06-03 01:09:53] [INFO ] Input system was already deterministic with 429 transitions.
[2024-06-03 01:09:53] [INFO ] Flatten gal took : 32 ms
[2024-06-03 01:09:53] [INFO ] Flatten gal took : 33 ms
[2024-06-03 01:09:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15112052426148197453.gal : 7 ms
[2024-06-03 01:09:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15882936174298700816.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/CTLCardinality15112052426148197453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15882936174298700816.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 01:10:23] [INFO ] Flatten gal took : 19 ms
[2024-06-03 01:10:23] [INFO ] Applying decomposition
[2024-06-03 01:10:23] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8195388570153694202.txt' '-o' '/tmp/graph8195388570153694202.bin' '-w' '/tmp/graph8195388570153694202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8195388570153694202.bin' '-l' '-1' '-v' '-w' '/tmp/graph8195388570153694202.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:10:23] [INFO ] Decomposing Gal with order
[2024-06-03 01:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:10:23] [INFO ] Removed a total of 1078 redundant transitions.
[2024-06-03 01:10:23] [INFO ] Flatten gal took : 51 ms
[2024-06-03 01:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 20 ms.
[2024-06-03 01:10:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality535225436420779529.gal : 7 ms
[2024-06-03 01:10:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8113383744443258992.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/CTLCardinality535225436420779529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8113383744443258992.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94267e+07,6.98499,126212,2800,29,86073,474,1063,1.12509e+06,73,1396,0
Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,6.99815,126212,1,0,86073,474,1646,1.12509e+06,82,1396,1350
FORMULA MedleyA-PT-18-CTLCardinality-2024-01 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 : 228/228 places, 501/501 transitions.
Graph (trivial) has 220 edges and 228 vertex of which 9 / 228 are part of one of the 2 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 221 transition count 454
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 181 transition count 452
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 180 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 178 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 88 place count 178 transition count 443
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 102 place count 171 transition count 443
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 121 place count 152 transition count 408
Iterating global reduction 4 with 19 rules applied. Total rules applied 140 place count 152 transition count 408
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 152 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 151 transition count 407
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 143 place count 150 transition count 405
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 150 transition count 405
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 149 transition count 403
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 149 transition count 403
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 182 place count 131 transition count 385
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 186 place count 127 transition count 353
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 127 transition count 353
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 126 transition count 351
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 126 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 201 place count 126 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 202 place count 126 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 203 place count 125 transition count 341
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 213 place count 120 transition count 336
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 214 place count 119 transition count 332
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 119 transition count 332
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 216 place count 118 transition count 330
Iterating global reduction 8 with 1 rules applied. Total rules applied 217 place count 118 transition count 330
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 219 place count 118 transition count 330
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 117 transition count 329
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 117 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 117 transition count 328
Applied a total of 222 rules in 125 ms. Remains 117 /228 variables (removed 111) and now considering 328/501 (removed 173) transitions.
[2024-06-03 01:10:30] [INFO ] Flow matrix only has 327 transitions (discarded 1 similar events)
// Phase 1: matrix 327 rows 117 cols
[2024-06-03 01:10:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:10:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 01:10:30] [INFO ] Flow matrix only has 327 transitions (discarded 1 similar events)
[2024-06-03 01:10:30] [INFO ] Invariant cache hit.
[2024-06-03 01:10:31] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-06-03 01:10:31] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-06-03 01:10:31] [INFO ] Redundant transitions in 22 ms returned []
Running 327 sub problems to find dead transitions.
[2024-06-03 01:10:31] [INFO ] Flow matrix only has 327 transitions (discarded 1 similar events)
[2024-06-03 01:10:31] [INFO ] Invariant cache hit.
[2024-06-03 01:10:31] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2024-06-03 01:10:34] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-06-03 01:10:35] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-03 01:10:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-03 01:10:35] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 2 ms to minimize.
[2024-06-03 01:10:35] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 326/443 variables, 117/143 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 128/271 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 (/ 5.0 6.0))
(s19 (/ 1.0 6.0))
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 272 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 4 (OVERLAPS) 326/443 variables, 117/143 constraints. Problems are: Problem set: 36 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 128/271 constraints. Problems are: Problem set: 36 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/444 variables, and 562 constraints, problems are : Problem set: 36 solved, 291 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 128/129 constraints, PredecessorRefiner: 291/327 constraints, Known Traps: 19/19 constraints]
After SMT, in 60366ms problems are : Problem set: 36 solved, 291 unsolved
Search for dead transitions found 36 dead transitions in 60370ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/228 places, 292/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-06-03 01:11:31] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61132 ms. Remains : 117/228 places, 292/501 transitions.
[2024-06-03 01:11:31] [INFO ] Flatten gal took : 19 ms
[2024-06-03 01:11:31] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:11:31] [INFO ] Input system was already deterministic with 292 transitions.
[2024-06-03 01:11:31] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:11:31] [INFO ] Flatten gal took : 15 ms
[2024-06-03 01:11:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality10260475993140604608.gal : 6 ms
[2024-06-03 01:11:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality27443623479354454.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/CTLCardinality10260475993140604608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality27443623479354454.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,2.66447e+06,9.77471,238676,2,24743,5,511101,6,0,760,530576,0
Converting to forward existential form...Done !
original formula: E(AG(EF(((p109==0)||(p198==1)))) U ((!((((((p187==1)||(p231==0))||(p126==1))&&(p134==1))&&((p228==0)||(p1==1)))) * !(AG((((p247==0)||(p19...282
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U !(E(TRUE U ((p109==0)||(p198==1))))))) * (!((((((p187==1)||(p231==0))||(p126==1))&&(p1...1073
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t10, t11, t12, t14, t17, t18, t22, t26, t27, t31, t37, t42, t43, t45, t48, t49, t54, ...612
Detected timeout of ITS tools.
[2024-06-03 01:12:02] [INFO ] Flatten gal took : 10 ms
[2024-06-03 01:12:02] [INFO ] Applying decomposition
[2024-06-03 01:12:02] [INFO ] Flatten gal took : 10 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/graph16888110346760963233.txt' '-o' '/tmp/graph16888110346760963233.bin' '-w' '/tmp/graph16888110346760963233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16888110346760963233.bin' '-l' '-1' '-v' '-w' '/tmp/graph16888110346760963233.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:12:02] [INFO ] Decomposing Gal with order
[2024-06-03 01:12:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:12:02] [INFO ] Removed a total of 469 redundant transitions.
[2024-06-03 01:12:02] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:12:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 8 ms.
[2024-06-03 01:12:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12909590303629633236.gal : 5 ms
[2024-06-03 01:12:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13527048905364913735.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/CTLCardinality12909590303629633236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13527048905364913735.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.66447e+06,3.07696,85404,1415,1878,88596,45903,695,418100,193,231091,0
Converting to forward existential form...Done !
original formula: E(AG(EF(((i3.i0.u16.p109==0)||(i6.i0.u30.p198==1)))) U ((!((((((i5.u29.p187==1)||(i6.i0.u30.p231==0))||(i3.i1.u19.p126==1))&&(i4.i0.u21.p...437
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U !(E(TRUE U ((i3.i0.u16.p109==0)||(i6.i0.u30.p198==1))))))) * (!((((((i5.u29.p187==1)||...1551
Reverse transition relation is NOT exact ! Due to transitions t31, t42, t78, t86, t95, t97, t104, t106, t108, t109, t110, t113, t114, t115, t116, t147, t14...727
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,10.3939,235356,1,0,231058,126405,4898,1.30356e+06,1333,557787,655169
FORMULA MedleyA-PT-18-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 205 transition count 464
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 205 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 203 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 203 transition count 462
Applied a total of 50 rules in 9 ms. Remains 203 /228 variables (removed 25) and now considering 462/501 (removed 39) transitions.
// Phase 1: matrix 462 rows 203 cols
[2024-06-03 01:12:12] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:12:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-03 01:12:12] [INFO ] Invariant cache hit.
[2024-06-03 01:12:13] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-03 01:12:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:12:20] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:12:20] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:12:21] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:12:21] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 5 ms to minimize.
[2024-06-03 01:12:21] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 4 ms to minimize.
[2024-06-03 01:12:21] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-06-03 01:12:21] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-06-03 01:12:22] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:12:22] [INFO ] Deduced a trap composed of 126 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:12:22] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:12:23] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 4 ms to minimize.
[2024-06-03 01:12:23] [INFO ] Deduced a trap composed of 126 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:12:23] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:12:23] [INFO ] Deduced a trap composed of 111 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:12:24] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:12:25] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 3 ms to minimize.
[2024-06-03 01:12:26] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:12:26] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:12:26] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:12:27] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:12:27] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 5 ms to minimize.
[2024-06-03 01:12:27] [INFO ] Deduced a trap composed of 112 places in 282 ms of which 5 ms to minimize.
[2024-06-03 01:12:28] [INFO ] Deduced a trap composed of 134 places in 293 ms of which 4 ms to minimize.
[2024-06-03 01:12:29] [INFO ] Deduced a trap composed of 108 places in 279 ms of which 4 ms to minimize.
[2024-06-03 01:12:30] [INFO ] Deduced a trap composed of 141 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:12:30] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:12:30] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2024-06-03 01:12:30] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 6 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 4 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 112 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 134 places in 300 ms of which 4 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:12:38] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:12:38] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 111 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 107 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:12:40] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 2 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 131 places in 262 ms of which 4 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 4 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 4 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
SMT process timed out in 30620ms, After SMT, problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 30629ms
Starting structural reductions in LTL mode, iteration 1 : 203/228 places, 462/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31279 ms. Remains : 203/228 places, 462/501 transitions.
[2024-06-03 01:12:43] [INFO ] Flatten gal took : 33 ms
[2024-06-03 01:12:43] [INFO ] Flatten gal took : 32 ms
[2024-06-03 01:12:44] [INFO ] Input system was already deterministic with 462 transitions.
[2024-06-03 01:12:44] [INFO ] Flatten gal took : 40 ms
[2024-06-03 01:12:44] [INFO ] Flatten gal took : 32 ms
[2024-06-03 01:12:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1483797779496999936.gal : 7 ms
[2024-06-03 01:12:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15356766791434472418.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1483797779496999936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15356766791434472418.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-06-03 01:13:14] [INFO ] Flatten gal took : 18 ms
[2024-06-03 01:13:14] [INFO ] Applying decomposition
[2024-06-03 01:13:14] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14761822320925289816.txt' '-o' '/tmp/graph14761822320925289816.bin' '-w' '/tmp/graph14761822320925289816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14761822320925289816.bin' '-l' '-1' '-v' '-w' '/tmp/graph14761822320925289816.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:13:14] [INFO ] Decomposing Gal with order
[2024-06-03 01:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:13:14] [INFO ] Removed a total of 1312 redundant transitions.
[2024-06-03 01:13:14] [INFO ] Flatten gal took : 63 ms
[2024-06-03 01:13:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 27 ms.
[2024-06-03 01:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16167040667683708493.gal : 10 ms
[2024-06-03 01:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1096157885921258478.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/CTLCardinality16167040667683708493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1096157885921258478.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12394e+07,4.19882,100304,4089,26,111807,381,1274,717164,64,1025,0
Converting to forward existential form...Done !
original formula: EX((EG(EF(((i2.i0.u36.p135==0)&&(i1.i2.u22.p84==1)))) * ((i6.i1.u53.p190==0) + AX(EF((i5.i2.u63.p226==0))))))
=> equivalent forward existential formula: ([((EY(Init) * EG(E(TRUE U ((i2.i0.u36.p135==0)&&(i1.i2.u22.p84==1))))) * (i6.i1.u53.p190==0))] != FALSE + [((EY...274
Reverse transition relation is NOT exact ! Due to transitions t35, t48, t107, t163, t179, t190, t194, t206, t208, t230, t232, t238, t240, t262, t264, t270,...1053
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 249 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 217 transition count 441
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 168 transition count 437
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 166 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 165 transition count 436
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 107 place count 165 transition count 428
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 123 place count 157 transition count 428
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 146 place count 134 transition count 387
Iterating global reduction 4 with 23 rules applied. Total rules applied 169 place count 134 transition count 387
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 134 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 133 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 171 place count 133 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 132 transition count 385
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 131 transition count 383
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 130 transition count 381
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 130 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 213 place count 112 transition count 363
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 218 place count 107 transition count 329
Iterating global reduction 6 with 5 rules applied. Total rules applied 223 place count 107 transition count 329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 106 transition count 327
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 106 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 237 place count 106 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 237 place count 106 transition count 313
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 241 place count 104 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 253 place count 98 transition count 307
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 255 place count 96 transition count 299
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 96 transition count 299
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 259 place count 94 transition count 295
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 94 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 93 transition count 294
Applied a total of 262 rules in 68 ms. Remains 93 /228 variables (removed 135) and now considering 294/501 (removed 207) transitions.
[2024-06-03 01:13:44] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
// Phase 1: matrix 292 rows 93 cols
[2024-06-03 01:13:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:13:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 01:13:44] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
[2024-06-03 01:13:44] [INFO ] Invariant cache hit.
[2024-06-03 01:13:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 01:13:44] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-03 01:13:44] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-03 01:13:44] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
[2024-06-03 01:13:44] [INFO ] Invariant cache hit.
[2024-06-03 01:13:44] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-03 01:13:46] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2024-06-03 01:13:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-06-03 01:13:46] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-03 01:13:47] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-03 01:13:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-03 01:13:48] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-03 01:13:48] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-03 01:13:48] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-03 01:13:48] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 291/384 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 64/182 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 1/385 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 183 constraints, problems are : Problem set: 0 solved, 289 unsolved in 19732 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 3 (OVERLAPS) 291/384 variables, 93/118 constraints. Problems are: Problem set: 36 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 64/182 constraints. Problems are: Problem set: 36 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 253/435 constraints. Problems are: Problem set: 36 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/435 constraints. Problems are: Problem set: 36 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 1/385 variables, 1/436 constraints. Problems are: Problem set: 36 solved, 253 unsolved
[2024-06-03 01:14:32] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/437 constraints. Problems are: Problem set: 36 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 437 constraints, problems are : Problem set: 36 solved, 253 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 253/289 constraints, Known Traps: 19/19 constraints]
After SMT, in 50140ms problems are : Problem set: 36 solved, 253 unsolved
Search for dead transitions found 36 dead transitions in 50145ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 93/228 places, 258/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-03 01:14:35] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 50589 ms. Remains : 93/228 places, 258/501 transitions.
[2024-06-03 01:14:35] [INFO ] Flatten gal took : 6 ms
[2024-06-03 01:14:35] [INFO ] Flatten gal took : 6 ms
[2024-06-03 01:14:35] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-03 01:14:35] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:14:35] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:14:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11918297407415973644.gal : 3 ms
[2024-06-03 01:14:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10070361167354858405.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11918297407415973644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10070361167354858405.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (6927 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2012 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10070361167354858405.prop.
Finished probabilistic random walk after 4254 steps, run visited all 1 properties in 27 ms. (steps per millisecond=157 )
Probabilistic random walk after 4254 steps, saw 1720 distinct states, run finished after 33 ms. (steps per millisecond=128 ) properties seen :1
FORMULA MedleyA-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 233 edges and 228 vertex of which 8 / 228 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 221 transition count 448
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 175 transition count 445
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 174 transition count 442
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 103 place count 171 transition count 442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 103 place count 171 transition count 434
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 119 place count 163 transition count 434
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 138 place count 144 transition count 400
Iterating global reduction 4 with 19 rules applied. Total rules applied 157 place count 144 transition count 400
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 144 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 143 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 159 place count 143 transition count 398
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 142 transition count 398
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 141 transition count 396
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 141 transition count 396
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 140 transition count 394
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 140 transition count 394
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 203 place count 121 transition count 375
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 208 place count 116 transition count 341
Iterating global reduction 6 with 5 rules applied. Total rules applied 213 place count 116 transition count 341
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 214 place count 115 transition count 339
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 115 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 226 place count 115 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 226 place count 115 transition count 327
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 114 transition count 327
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 240 place count 108 transition count 321
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 106 transition count 313
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 106 transition count 313
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 246 place count 104 transition count 309
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 104 transition count 309
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 104 transition count 309
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 103 transition count 308
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 103 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 102 transition count 307
Applied a total of 252 rules in 93 ms. Remains 102 /228 variables (removed 126) and now considering 307/501 (removed 194) transitions.
[2024-06-03 01:14:35] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
// Phase 1: matrix 306 rows 102 cols
[2024-06-03 01:14:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:14:35] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 01:14:35] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
[2024-06-03 01:14:35] [INFO ] Invariant cache hit.
[2024-06-03 01:14:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 01:14:35] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-06-03 01:14:35] [INFO ] Redundant transitions in 4 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-03 01:14:35] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
[2024-06-03 01:14:35] [INFO ] Invariant cache hit.
[2024-06-03 01:14:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-03 01:14:38] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-03 01:14:39] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-03 01:14:43] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-06-03 01:14:44] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 305/407 variables, 102/124 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-03 01:14:50] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:14:51] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 1/408 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 127 constraints, problems are : Problem set: 0 solved, 301 unsolved in 28722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 6 (OVERLAPS) 305/407 variables, 102/126 constraints. Problems are: Problem set: 36 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 265/391 constraints. Problems are: Problem set: 36 solved, 265 unsolved
[2024-06-03 01:15:29] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 1/392 constraints. Problems are: Problem set: 36 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/408 variables, and 392 constraints, problems are : Problem set: 36 solved, 265 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 265/301 constraints, Known Traps: 18/18 constraints]
After SMT, in 59139ms problems are : Problem set: 36 solved, 265 unsolved
Search for dead transitions found 36 dead transitions in 59147ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 102/228 places, 271/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-03 01:15:34] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 59632 ms. Remains : 102/228 places, 271/501 transitions.
[2024-06-03 01:15:35] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:15:35] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:15:35] [INFO ] Input system was already deterministic with 271 transitions.
[2024-06-03 01:15:35] [INFO ] Flatten gal took : 8 ms
[2024-06-03 01:15:35] [INFO ] Flatten gal took : 8 ms
[2024-06-03 01:15:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality6927396099519753489.gal : 2 ms
[2024-06-03 01:15:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15901802954846689185.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/CTLCardinality6927396099519753489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15901802954846689185.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,1.96765e+06,7.57362,153356,2,18929,5,465642,6,0,680,350881,0
Converting to forward existential form...Done !
original formula: AG(A(EG(((p237==0)&&(p162==0))) U (EF(((p122==0)||(p243==1))) + (((p7==1)&&(p237==1))&&(((p209==0)||(p72==1))&&((p164==0)||(p160==1))))))...156
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(TRUE U ((p122==0)||(p243==1))) + (((p7==1)&&(p237==1))&&(((p209==0)||(p72==1))&&(...487
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t10, t12, t15, t16, t19, t23, t26, t31, t32, t34, t36, t37, t40, t42, t44, t48, t...601
Detected timeout of ITS tools.
[2024-06-03 01:16:05] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:16:05] [INFO ] Applying decomposition
[2024-06-03 01:16:05] [INFO ] Flatten gal took : 13 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/graph11206543830880003715.txt' '-o' '/tmp/graph11206543830880003715.bin' '-w' '/tmp/graph11206543830880003715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11206543830880003715.bin' '-l' '-1' '-v' '-w' '/tmp/graph11206543830880003715.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:16:05] [INFO ] Decomposing Gal with order
[2024-06-03 01:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:16:05] [INFO ] Removed a total of 689 redundant transitions.
[2024-06-03 01:16:05] [INFO ] Flatten gal took : 33 ms
[2024-06-03 01:16:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 12 ms.
[2024-06-03 01:16:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10001280268824567879.gal : 4 ms
[2024-06-03 01:16:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality456426833952049713.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/CTLCardinality10001280268824567879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality456426833952049713.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96765e+06,0.535894,15396,801,38,21047,277,613,36581,61,741,0
Converting to forward existential form...Done !
original formula: AG(A(EG(((i1.u26.p237==0)&&(i5.i1.u20.p162==0))) U (EF(((i5.i1.u19.p122==0)||(i1.u35.p243==1))) + (((i0.u0.p7==1)&&(i1.u26.p237==1))&&(((...237
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(TRUE U ((i5.i1.u19.p122==0)||(i1.u35.p243==1))) + (((i0.u0.p7==1)&&(i1.u26.p237==...696
Reverse transition relation is NOT exact ! Due to transitions t19, t23, t44, t48, t63, t75, t77, t87, t89, t90, t91, t94, t95, t96, t97, t124, t125, t126, ...757
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,1.03257,24900,1,0,36029,355,4433,93273,272,933,126435
FORMULA MedleyA-PT-18-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 206 transition count 466
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 206 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 204 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 204 transition count 464
Applied a total of 48 rules in 9 ms. Remains 204 /228 variables (removed 24) and now considering 464/501 (removed 37) transitions.
// Phase 1: matrix 464 rows 204 cols
[2024-06-03 01:16:06] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 01:16:06] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-03 01:16:06] [INFO ] Invariant cache hit.
[2024-06-03 01:16:06] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-06-03 01:16:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:14] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:16:14] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2024-06-03 01:16:14] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:16:14] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-03 01:16:15] [INFO ] Deduced a trap composed of 127 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:16:15] [INFO ] Deduced a trap composed of 127 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:16:15] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:16:16] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-03 01:16:16] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:16:17] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 3 ms to minimize.
[2024-06-03 01:16:17] [INFO ] Deduced a trap composed of 136 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:16:18] [INFO ] Deduced a trap composed of 128 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:16:18] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:16:19] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 3 ms to minimize.
[2024-06-03 01:16:19] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:16:19] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:16:20] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:16:20] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 4 ms to minimize.
[2024-06-03 01:16:20] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:16:20] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:21] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:16:21] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:16:22] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:16:22] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-03 01:16:22] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-06-03 01:16:22] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:16:23] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 4 ms to minimize.
[2024-06-03 01:16:24] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:16:24] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:16:25] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 2 ms to minimize.
[2024-06-03 01:16:25] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:16:25] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:16:26] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:16:26] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:16:26] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 4 ms to minimize.
[2024-06-03 01:16:28] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:32] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:16:32] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:16:34] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 3 ms to minimize.
[2024-06-03 01:16:34] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 3 ms to minimize.
[2024-06-03 01:16:34] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:16:34] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:16:35] [INFO ] Deduced a trap composed of 140 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:16:35] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-06-03 01:16:36] [INFO ] Deduced a trap composed of 107 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:16:36] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:16:36] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:16:37] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/668 variables, and 59 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:43] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:16:43] [INFO ] Deduced a trap composed of 139 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:16:44] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 4 ms to minimize.
[2024-06-03 01:16:44] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:16:45] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 2 ms to minimize.
[2024-06-03 01:16:46] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:47] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:16:49] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:53] [INFO ] Deduced a trap composed of 142 places in 282 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:16:59] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 8 (OVERLAPS) 464/668 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 736 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 62/62 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Starting structural reductions in LTL mode, iteration 1 : 204/228 places, 464/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61400 ms. Remains : 204/228 places, 464/501 transitions.
[2024-06-03 01:17:07] [INFO ] Flatten gal took : 24 ms
[2024-06-03 01:17:07] [INFO ] Flatten gal took : 25 ms
[2024-06-03 01:17:07] [INFO ] Input system was already deterministic with 464 transitions.
[2024-06-03 01:17:07] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:17:07] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:17:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3788112959447865307.gal : 5 ms
[2024-06-03 01:17:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9492928185741801835.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/CTLCardinality3788112959447865307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9492928185741801835.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-06-03 01:17:37] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:17:37] [INFO ] Applying decomposition
[2024-06-03 01:17:37] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10905059051414848313.txt' '-o' '/tmp/graph10905059051414848313.bin' '-w' '/tmp/graph10905059051414848313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10905059051414848313.bin' '-l' '-1' '-v' '-w' '/tmp/graph10905059051414848313.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:17:37] [INFO ] Decomposing Gal with order
[2024-06-03 01:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:17:38] [INFO ] Removed a total of 1312 redundant transitions.
[2024-06-03 01:17:38] [INFO ] Flatten gal took : 39 ms
[2024-06-03 01:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2024-06-03 01:17:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7572658619717797519.gal : 5 ms
[2024-06-03 01:17:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality17869130078259257803.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/CTLCardinality7572658619717797519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17869130078259257803.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15577e+07,9.90777,200376,3675,52,171370,526,1184,1.75057e+06,91,1957,0
Converting to forward existential form...Done !
original formula: (AF(E((EG(A((i0.u2.p19==0) U (i8.i0.u47.p176==0))) + EF(((i8.i1.u51.p191==0)||(i6.i2.u61.p220==1)))) U !(AX((((i1.i0.u15.p69==0)||(i8.i0....363
=> equivalent forward existential formula: [FwdG((Init * !(E((EX(!(((i2.i2.u36.p143==1)&&(i8.i1.u51.p189==0)))) + (!((E(!((i6.i1.u55.p201==1)) U (!(((i8.i1...557
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t35, t48, t118, t163, t179, t185, t196, t208, t210, t232, t234, t240, t242, t264, t...1170
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 6 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:18:08] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:18:08] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 01:18:08] [INFO ] Invariant cache hit.
[2024-06-03 01:18:08] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:18:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:18:16] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:18:16] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:18:16] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:18:16] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:18:17] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:18:17] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 2 ms to minimize.
[2024-06-03 01:18:17] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:18:17] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:18:18] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:18:18] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:18:18] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:18:18] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:18:19] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 3 ms to minimize.
[2024-06-03 01:18:19] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:18:19] [INFO ] Deduced a trap composed of 125 places in 365 ms of which 3 ms to minimize.
[2024-06-03 01:18:19] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:18:20] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:18:21] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 2 ms to minimize.
[2024-06-03 01:18:21] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 3 ms to minimize.
[2024-06-03 01:18:22] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:18:22] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-03 01:18:22] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:18:23] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-06-03 01:18:24] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:18:24] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:18:25] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 3 ms to minimize.
[2024-06-03 01:18:25] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:18:25] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:18:26] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:18:26] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:18:26] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:18:27] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:18:27] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:18:27] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:18:28] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:18:28] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:18:28] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 4 ms to minimize.
[2024-06-03 01:18:28] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:18:29] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:18:29] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 4 ms to minimize.
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:18:35] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:18:35] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:18:35] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:18:36] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:18:36] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:18:37] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 3 ms to minimize.
[2024-06-03 01:18:37] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:18:37] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:18:38] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:18:39] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 3 ms to minimize.
SMT process timed out in 30542ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30548ms
Starting structural reductions in LTL mode, iteration 1 : 201/228 places, 458/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31057 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-03 01:18:39] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:18:39] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:18:39] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 01:18:39] [INFO ] Flatten gal took : 40 ms
[2024-06-03 01:18:39] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:18:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17668618988919017126.gal : 5 ms
[2024-06-03 01:18:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6496722370642003531.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/CTLCardinality17668618988919017126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6496722370642003531.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-06-03 01:19:09] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:19:09] [INFO ] Applying decomposition
[2024-06-03 01:19:09] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5754828475308592329.txt' '-o' '/tmp/graph5754828475308592329.bin' '-w' '/tmp/graph5754828475308592329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5754828475308592329.bin' '-l' '-1' '-v' '-w' '/tmp/graph5754828475308592329.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:19:09] [INFO ] Decomposing Gal with order
[2024-06-03 01:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:19:09] [INFO ] Removed a total of 1314 redundant transitions.
[2024-06-03 01:19:09] [INFO ] Flatten gal took : 52 ms
[2024-06-03 01:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2024-06-03 01:19:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality15382418264692700622.gal : 8 ms
[2024-06-03 01:19:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality18351758508916832685.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/CTLCardinality15382418264692700622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18351758508916832685.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.94267e+07,14.8919,274992,3070,24,90250,289,1158,3.12971e+06,63,824,0
Converting to forward existential form...Done !
original formula: (EX((i5.i0.u41.p139==1)) + EG(AX(AG(((i3.i2.u44.p165==0)||(i6.i0.u51.p179==1))))))
=> equivalent forward existential formula: ([(EY(Init) * (i5.i0.u41.p139==1))] != FALSE + [FwdG(Init,!(EX(!(!(E(TRUE U !(((i3.i2.u44.p165==0)||(i6.i0.u51.p...181
Reverse transition relation is NOT exact ! Due to transitions t28, t96, t114, t159, t175, t188, t190, t200, t202, t204, t226, t228, t234, t236, t258, t260,...1028
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 7 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-03 01:19:39] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 01:19:39] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-03 01:19:39] [INFO ] Invariant cache hit.
[2024-06-03 01:19:40] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-03 01:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:19:47] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:19:47] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:19:47] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-03 01:19:47] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:19:48] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:19:48] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:19:48] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:19:49] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:19:49] [INFO ] Deduced a trap composed of 126 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:19:49] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:19:49] [INFO ] Deduced a trap composed of 126 places in 215 ms of which 3 ms to minimize.
[2024-06-03 01:19:50] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:19:51] [INFO ] Deduced a trap composed of 134 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:19:52] [INFO ] Deduced a trap composed of 108 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:19:52] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:19:52] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:19:52] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:19:53] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-06-03 01:19:53] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:19:53] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:19:54] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-03 01:19:54] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:19:54] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-03 01:19:54] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:19:55] [INFO ] Deduced a trap composed of 126 places in 216 ms of which 3 ms to minimize.
[2024-06-03 01:19:55] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 3 ms to minimize.
[2024-06-03 01:19:56] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:19:57] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:19:57] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:19:57] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 3 ms to minimize.
[2024-06-03 01:19:58] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 3 ms to minimize.
[2024-06-03 01:19:58] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 2 ms to minimize.
[2024-06-03 01:19:58] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:19:58] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:19:59] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 2 ms to minimize.
[2024-06-03 01:19:59] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 4 ms to minimize.
[2024-06-03 01:19:59] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:20:00] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2024-06-03 01:20:00] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:20:00] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:06] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:20:06] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:20:06] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:20:07] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:20:07] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 8 ms to minimize.
[2024-06-03 01:20:07] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 3 ms to minimize.
[2024-06-03 01:20:08] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 3 ms to minimize.
[2024-06-03 01:20:08] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:20:08] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:20:08] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:20:09] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:20:09] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:20:09] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 60 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:16] [INFO ] Deduced a trap composed of 135 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:20:16] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-03 01:20:17] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:20:17] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:20:17] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:20:19] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-06-03 01:20:19] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:22] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 4 ms to minimize.
[2024-06-03 01:20:23] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:20:23] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:20:23] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:27] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:20:28] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:20:28] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:20:29] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:20:29] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:33] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:20:34] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:20:34] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 3 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/662 variables, and 84 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 77/77 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Starting structural reductions in LTL mode, iteration 1 : 202/228 places, 460/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60978 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-03 01:20:40] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:20:40] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:20:40] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-03 01:20:40] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:20:40] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:20:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality17423641302608085045.gal : 5 ms
[2024-06-03 01:20:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4216423234378202554.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/CTLCardinality17423641302608085045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4216423234378202554.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-06-03 01:21:10] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:21:10] [INFO ] Applying decomposition
[2024-06-03 01:21:10] [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/graph4569243248938427319.txt' '-o' '/tmp/graph4569243248938427319.bin' '-w' '/tmp/graph4569243248938427319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4569243248938427319.bin' '-l' '-1' '-v' '-w' '/tmp/graph4569243248938427319.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:21:10] [INFO ] Decomposing Gal with order
[2024-06-03 01:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:21:11] [INFO ] Removed a total of 1309 redundant transitions.
[2024-06-03 01:21:11] [INFO ] Flatten gal took : 35 ms
[2024-06-03 01:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2024-06-03 01:21:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8033551187618355749.gal : 4 ms
[2024-06-03 01:21:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4288278076858185412.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8033551187618355749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4288278076858185412.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98225e+07,9.96928,173000,3524,35,122398,403,1137,1.53273e+06,78,1062,0
Converting to forward existential form...Done !
original formula: A(EG(!(EX(TRUE))) U EG(AG(EX(((i1.i1.u13.p62==0)||(i7.i1.u53.p187==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(E(TRUE U !(EX(((i1.i1.u13.p62==0)||(i7.i1.u53.p187==1))))))))))) * !(E(!(EG(!(E(TRUE U !(E...311
Reverse transition relation is NOT exact ! Due to transitions t28, t35, t39, t103, t107, t116, t120, t161, t177, t188, t192, t202, t204, t206, t230, t238, ...1063
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 7 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:21:41] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:21:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-03 01:21:41] [INFO ] Invariant cache hit.
[2024-06-03 01:21:41] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:21:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:21:49] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:21:49] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:21:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-03 01:21:49] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:21:50] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:21:50] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:21:50] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:21:50] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:21:51] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 3 ms to minimize.
[2024-06-03 01:21:51] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:21:51] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 2 ms to minimize.
[2024-06-03 01:21:51] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:21:52] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 3 ms to minimize.
[2024-06-03 01:21:52] [INFO ] Deduced a trap composed of 125 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:21:52] [INFO ] Deduced a trap composed of 125 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:21:52] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:21:53] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:21:54] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 2 ms to minimize.
[2024-06-03 01:21:55] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:21:55] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:21:55] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:21:55] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-03 01:21:56] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-03 01:21:57] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:21:57] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 4 ms to minimize.
[2024-06-03 01:21:58] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:21:58] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:21:58] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:21:59] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:21:59] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:21:59] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:21:59] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-06-03 01:22:00] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 2 ms to minimize.
[2024-06-03 01:22:00] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:22:00] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:22:00] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 4 ms to minimize.
[2024-06-03 01:22:01] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:22:01] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
[2024-06-03 01:22:01] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-03 01:22:01] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:05] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-06-03 01:22:05] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:22:05] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:22:06] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 3 ms to minimize.
[2024-06-03 01:22:06] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:22:06] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-06-03 01:22:06] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 4 ms to minimize.
[2024-06-03 01:22:07] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 2 ms to minimize.
[2024-06-03 01:22:07] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:22:07] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:22:08] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:22:08] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 3 ms to minimize.
[2024-06-03 01:22:09] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 4 ms to minimize.
[2024-06-03 01:22:09] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:22:09] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:22:10] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 2 ms to minimize.
[2024-06-03 01:22:10] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:22:11] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 2 ms to minimize.
[2024-06-03 01:22:11] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
[2024-06-03 01:22:11] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 67 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:16] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 4 ms to minimize.
[2024-06-03 01:22:17] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:22:17] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:22:18] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:22:18] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2024-06-03 01:22:18] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2024-06-03 01:22:19] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:22:19] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:22] [INFO ] Deduced a trap composed of 139 places in 272 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:27] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:22:28] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:37] [INFO ] Deduced a trap composed of 141 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:22:37] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:22:38] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/659 variables, and 83 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 76/76 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60623ms
Starting structural reductions in LTL mode, iteration 1 : 201/228 places, 458/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61235 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-03 01:22:42] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:22:42] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:22:42] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 01:22:42] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:22:42] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:22:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16590083744133424418.gal : 5 ms
[2024-06-03 01:22:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality18081089126935679458.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/CTLCardinality16590083744133424418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18081089126935679458.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 01:23:12] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:23:12] [INFO ] Applying decomposition
[2024-06-03 01:23:12] [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/graph12691945281874131807.txt' '-o' '/tmp/graph12691945281874131807.bin' '-w' '/tmp/graph12691945281874131807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12691945281874131807.bin' '-l' '-1' '-v' '-w' '/tmp/graph12691945281874131807.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:23:12] [INFO ] Decomposing Gal with order
[2024-06-03 01:23:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:23:12] [INFO ] Removed a total of 1311 redundant transitions.
[2024-06-03 01:23:12] [INFO ] Flatten gal took : 32 ms
[2024-06-03 01:23:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 15 ms.
[2024-06-03 01:23:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10635239829749744731.gal : 5 ms
[2024-06-03 01:23:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14006904324721743317.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/CTLCardinality10635239829749744731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14006904324721743317.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.94267e+07,4.09748,92328,2213,26,93958,422,1164,634461,66,1247,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,4.11535,92328,1,0,93958,422,1689,634461,75,1247,943
FORMULA MedleyA-PT-18-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 246 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 217 transition count 439
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 166 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 164 transition count 435
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 109 place count 164 transition count 426
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 127 place count 155 transition count 426
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 149 place count 133 transition count 387
Iterating global reduction 3 with 22 rules applied. Total rules applied 171 place count 133 transition count 387
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 133 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 132 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 173 place count 132 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 131 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 130 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 130 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 129 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 129 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 215 place count 111 transition count 363
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 220 place count 106 transition count 329
Iterating global reduction 5 with 5 rules applied. Total rules applied 225 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 105 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 105 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 239 place count 105 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 239 place count 105 transition count 313
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 103 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 255 place count 97 transition count 307
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 257 place count 95 transition count 299
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 95 transition count 299
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 93 transition count 295
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 93 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 92 transition count 294
Applied a total of 264 rules in 73 ms. Remains 92 /228 variables (removed 136) and now considering 294/501 (removed 207) transitions.
[2024-06-03 01:23:16] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
// Phase 1: matrix 292 rows 92 cols
[2024-06-03 01:23:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:23:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 01:23:17] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
[2024-06-03 01:23:17] [INFO ] Invariant cache hit.
[2024-06-03 01:23:17] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 01:23:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-03 01:23:17] [INFO ] Redundant transitions in 2 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-03 01:23:17] [INFO ] Flow matrix only has 292 transitions (discarded 2 similar events)
[2024-06-03 01:23:17] [INFO ] Invariant cache hit.
[2024-06-03 01:23:17] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-03 01:23:18] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-06-03 01:23:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-03 01:23:19] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 2 ms to minimize.
[2024-06-03 01:23:19] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-06-03 01:23:19] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-06-03 01:23:19] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:23:20] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2024-06-03 01:23:20] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:23:20] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-03 01:23:20] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-03 01:23:21] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-03 01:23:21] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 291/383 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 64/175 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 1/384 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 176 constraints, problems are : Problem set: 0 solved, 289 unsolved in 18522 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 3 (OVERLAPS) 291/383 variables, 92/111 constraints. Problems are: Problem set: 36 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 64/175 constraints. Problems are: Problem set: 36 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 428 constraints, problems are : Problem set: 36 solved, 253 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 253/289 constraints, Known Traps: 12/12 constraints]
After SMT, in 48887ms problems are : Problem set: 36 solved, 253 unsolved
Search for dead transitions found 36 dead transitions in 48890ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 92/228 places, 258/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-03 01:24:06] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 49338 ms. Remains : 92/228 places, 258/501 transitions.
[2024-06-03 01:24:06] [INFO ] Flatten gal took : 11 ms
[2024-06-03 01:24:06] [INFO ] Flatten gal took : 11 ms
[2024-06-03 01:24:06] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-03 01:24:06] [INFO ] Flatten gal took : 11 ms
[2024-06-03 01:24:06] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:24:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality1496616250348624736.gal : 5 ms
[2024-06-03 01:24:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6849444111619149751.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/CTLCardinality1496616250348624736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6849444111619149751.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,862313,7.14217,153104,2,18305,5,360392,6,0,626,394306,0
Converting to forward existential form...Done !
original formula: AF(AG(((AF(((p62==0)||(p31==1))) * (p82!=0)) * (p105!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!(((p62==0)||(p31==1))))) * (p82!=0)) * (p105!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t9, t12, t13, t20, t26, t27, t29, t31, t32, t39, t42, t43, t45, t47, t48, t49, t5...578
Detected timeout of ITS tools.
[2024-06-03 01:24:36] [INFO ] Flatten gal took : 9 ms
[2024-06-03 01:24:36] [INFO ] Applying decomposition
[2024-06-03 01:24:36] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14895055316301284752.txt' '-o' '/tmp/graph14895055316301284752.bin' '-w' '/tmp/graph14895055316301284752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14895055316301284752.bin' '-l' '-1' '-v' '-w' '/tmp/graph14895055316301284752.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:24:36] [INFO ] Decomposing Gal with order
[2024-06-03 01:24:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:24:36] [INFO ] Removed a total of 462 redundant transitions.
[2024-06-03 01:24:36] [INFO ] Flatten gal took : 19 ms
[2024-06-03 01:24:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2024-06-03 01:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality3208700122503364105.gal : 2 ms
[2024-06-03 01:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17840629370675586249.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/CTLCardinality3208700122503364105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17840629370675586249.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,862313,1.73464,42308,650,457,40324,18315,541,127801,114,203973,0
Converting to forward existential form...Done !
original formula: AF(AG(((AF(((i1.u7.p62==0)||(i5.u3.p31==1))) * (i2.u9.p82!=0)) * (i8.u12.p105!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!(((i1.u7.p62==0)||(i5.u3.p31==1))))) * (i2.u9.p82!=0)) * (i8.u12.p105!=1))))))...165
Reverse transition relation is NOT exact ! Due to transitions t20, t26, t29, t31, t39, t42, t55, t67, t75, t77, t79, t80, t81, t84, t85, t86, t111, t113, t...614
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,5.19082,90884,1,0,91039,36188,3514,411877,649,318898,247830
FORMULA MedleyA-PT-18-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 249 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 217 transition count 439
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 166 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 164 transition count 435
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 109 place count 164 transition count 426
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 127 place count 155 transition count 426
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 149 place count 133 transition count 387
Iterating global reduction 3 with 22 rules applied. Total rules applied 171 place count 133 transition count 387
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 133 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 132 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 173 place count 132 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 131 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 130 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 130 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 129 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 129 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 215 place count 111 transition count 363
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 220 place count 106 transition count 329
Iterating global reduction 5 with 5 rules applied. Total rules applied 225 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 105 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 105 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 240 place count 105 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 240 place count 105 transition count 312
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 103 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 256 place count 97 transition count 306
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 258 place count 95 transition count 298
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 95 transition count 298
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 93 transition count 294
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 93 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 92 transition count 293
Applied a total of 265 rules in 66 ms. Remains 92 /228 variables (removed 136) and now considering 293/501 (removed 208) transitions.
[2024-06-03 01:24:41] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
// Phase 1: matrix 291 rows 92 cols
[2024-06-03 01:24:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:24:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-03 01:24:41] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
[2024-06-03 01:24:41] [INFO ] Invariant cache hit.
[2024-06-03 01:24:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 01:24:42] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-03 01:24:42] [INFO ] Redundant transitions in 1 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 01:24:42] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
[2024-06-03 01:24:42] [INFO ] Invariant cache hit.
[2024-06-03 01:24:42] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-03 01:24:43] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-03 01:24:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-03 01:24:43] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-06-03 01:24:44] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-03 01:24:45] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-06-03 01:24:45] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-03 01:24:45] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 290/382 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 64/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 1/383 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 178 constraints, problems are : Problem set: 0 solved, 288 unsolved in 20307 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-03 01:25:03] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/382 variables, 92/114 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 64/178 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 252/430 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/430 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/383 variables, 1/431 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/431 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/431 constraints. Problems are: Problem set: 36 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 431 constraints, problems are : Problem set: 36 solved, 252 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 252/288 constraints, Known Traps: 15/15 constraints]
After SMT, in 50603ms problems are : Problem set: 36 solved, 252 unsolved
Search for dead transitions found 36 dead transitions in 50606ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 92/228 places, 257/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-03 01:25:32] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 51044 ms. Remains : 92/228 places, 257/501 transitions.
[2024-06-03 01:25:32] [INFO ] Flatten gal took : 6 ms
[2024-06-03 01:25:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:25:32] [INFO ] Input system was already deterministic with 257 transitions.
RANDOM walk for 44 steps (8 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 01:25:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:25:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:25:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8670579112590862886.gal : 2 ms
[2024-06-03 01:25:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9192451765755186079.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8670579112590862886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9192451765755186079.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 6 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-03 01:25:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:25:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 01:25:32] [INFO ] Invariant cache hit.
[2024-06-03 01:25:33] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-03 01:25:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:25:40] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-06-03 01:25:40] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 2 ms to minimize.
[2024-06-03 01:25:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:25:41] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 2 ms to minimize.
[2024-06-03 01:25:41] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-03 01:25:41] [INFO ] Deduced a trap composed of 125 places in 185 ms of which 2 ms to minimize.
[2024-06-03 01:25:41] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
[2024-06-03 01:25:42] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:25:42] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:25:42] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:25:43] [INFO ] Deduced a trap composed of 138 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:25:44] [INFO ] Deduced a trap composed of 107 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:25:44] [INFO ] Deduced a trap composed of 125 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:25:45] [INFO ] Deduced a trap composed of 126 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:25:45] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:25:45] [INFO ] Deduced a trap composed of 127 places in 214 ms of which 3 ms to minimize.
[2024-06-03 01:25:46] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:25:46] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:25:46] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:25:46] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:25:47] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-06-03 01:25:47] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-06-03 01:25:47] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-03 01:25:49] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:25:49] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:25:49] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:25:50] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:25:50] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:25:50] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:25:51] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:25:51] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-06-03 01:25:51] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 4 ms to minimize.
[2024-06-03 01:25:51] [INFO ] Deduced a trap composed of 134 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:25:52] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:25:52] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:25:52] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 2 ms to minimize.
[2024-06-03 01:25:53] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-06-03 01:25:53] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:25:53] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:25:53] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:25:57] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:25:58] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-06-03 01:25:58] [INFO ] Deduced a trap composed of 108 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:25:59] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 4 ms to minimize.
[2024-06-03 01:25:59] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:26:00] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:26:00] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:26:00] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:26:01] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:26:01] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-03 01:26:01] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:26:02] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:26:02] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:26:02] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:26:02] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:26:03] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 2 ms to minimize.
[2024-06-03 01:26:03] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:26:03] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 65 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:26:07] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:26:08] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 4 ms to minimize.
[2024-06-03 01:26:08] [INFO ] Deduced a trap composed of 112 places in 202 ms of which 2 ms to minimize.
[2024-06-03 01:26:10] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 4 ms to minimize.
[2024-06-03 01:26:10] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 4 ms to minimize.
[2024-06-03 01:26:10] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:26:10] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:26:11] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-06-03 01:26:11] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:26:11] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-06-03 01:26:11] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 4 ms to minimize.
[2024-06-03 01:26:12] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:26:12] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:26:13] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-06-03 01:26:13] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:26:16] [INFO ] Deduced a trap composed of 134 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:26:17] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:26:18] [INFO ] Deduced a trap composed of 136 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:26:18] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:26:18] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:26:20] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:26:23] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:26:28] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:26:29] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:26:29] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:26:33] [INFO ] Deduced a trap composed of 107 places in 236 ms of which 3 ms to minimize.
SMT process timed out in 60558ms, After SMT, problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Starting structural reductions in LTL mode, iteration 1 : 202/228 places, 460/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61059 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-03 01:26:33] [INFO ] Flatten gal took : 31 ms
[2024-06-03 01:26:33] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:26:34] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-03 01:26:34] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:26:34] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:26:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality4012436343263982831.gal : 5 ms
[2024-06-03 01:26:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality10234563073542038196.ctl : 5 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/CTLCardinality4012436343263982831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10234563073542038196.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-06-03 01:27:04] [INFO ] Flatten gal took : 15 ms
[2024-06-03 01:27:04] [INFO ] Applying decomposition
[2024-06-03 01:27:04] [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/graph15716712986215926185.txt' '-o' '/tmp/graph15716712986215926185.bin' '-w' '/tmp/graph15716712986215926185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15716712986215926185.bin' '-l' '-1' '-v' '-w' '/tmp/graph15716712986215926185.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:27:04] [INFO ] Decomposing Gal with order
[2024-06-03 01:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:27:04] [INFO ] Removed a total of 1314 redundant transitions.
[2024-06-03 01:27:04] [INFO ] Flatten gal took : 30 ms
[2024-06-03 01:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 7 ms.
[2024-06-03 01:27:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality7503907661705533187.gal : 4 ms
[2024-06-03 01:27:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality111506175235018255.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/CTLCardinality7503907661705533187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality111506175235018255.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09273e+07,21.4905,319956,3419,43,103381,472,1143,3.58422e+06,71,1232,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 6 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:27:34] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:27:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 01:27:34] [INFO ] Invariant cache hit.
[2024-06-03 01:27:34] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:27:42] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:27:42] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:27:42] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-03 01:27:42] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2024-06-03 01:27:43] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 2 ms to minimize.
[2024-06-03 01:27:43] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:27:43] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:27:44] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:27:44] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 2 ms to minimize.
[2024-06-03 01:27:44] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:27:44] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2024-06-03 01:27:45] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:27:45] [INFO ] Deduced a trap composed of 125 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:27:45] [INFO ] Deduced a trap composed of 125 places in 222 ms of which 3 ms to minimize.
[2024-06-03 01:27:45] [INFO ] Deduced a trap composed of 125 places in 307 ms of which 4 ms to minimize.
[2024-06-03 01:27:46] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:27:46] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:27:47] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:27:48] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:27:48] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:27:48] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:27:49] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:27:49] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-03 01:27:50] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:27:51] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 3 ms to minimize.
[2024-06-03 01:27:51] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:27:51] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 3 ms to minimize.
[2024-06-03 01:27:52] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 4 ms to minimize.
[2024-06-03 01:27:52] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:27:52] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 3 ms to minimize.
[2024-06-03 01:27:52] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:27:53] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:27:53] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:27:53] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:27:54] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:27:54] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:27:54] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 4 ms to minimize.
[2024-06-03 01:27:54] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 4 ms to minimize.
[2024-06-03 01:27:55] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:27:55] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:27:59] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 4 ms to minimize.
[2024-06-03 01:27:59] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 4 ms to minimize.
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:28:01] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
[2024-06-03 01:28:01] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 4 ms to minimize.
[2024-06-03 01:28:01] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:28:02] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 4 ms to minimize.
[2024-06-03 01:28:02] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:28:02] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:28:03] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 4 ms to minimize.
[2024-06-03 01:28:03] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:28:04] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:28:04] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:28:05] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 4 ms to minimize.
SMT process timed out in 30610ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30618ms
Starting structural reductions in LTL mode, iteration 1 : 201/228 places, 458/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31129 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-03 01:28:05] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:28:05] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:28:05] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 01:28:05] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:28:05] [INFO ] Flatten gal took : 30 ms
[2024-06-03 01:28:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality18406216299011556996.gal : 5 ms
[2024-06-03 01:28:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4381608451089315393.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/CTLCardinality18406216299011556996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4381608451089315393.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-06-03 01:28:35] [INFO ] Flatten gal took : 28 ms
[2024-06-03 01:28:35] [INFO ] Applying decomposition
[2024-06-03 01:28:35] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8767024217092511181.txt' '-o' '/tmp/graph8767024217092511181.bin' '-w' '/tmp/graph8767024217092511181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8767024217092511181.bin' '-l' '-1' '-v' '-w' '/tmp/graph8767024217092511181.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:28:35] [INFO ] Decomposing Gal with order
[2024-06-03 01:28:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:28:35] [INFO ] Removed a total of 1312 redundant transitions.
[2024-06-03 01:28:35] [INFO ] Flatten gal took : 28 ms
[2024-06-03 01:28:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2024-06-03 01:28:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17415058004857955449.gal : 4 ms
[2024-06-03 01:28:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15251349356536290383.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/CTLCardinality17415058004857955449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15251349356536290383.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.94267e+07,7.99533,146184,2294,25,97906,381,1147,1.29736e+06,62,1303,0
Converting to forward existential form...Done !
original formula: AF(E((AF(((i8.i2.u64.p229==0)||(i2.i1.u27.p113==1))) + (i4.i0.u33.p129==1)) U AG((AX((i4.i0.u32.p127==0)) + AG(((i7.i0.u62.p210==0)||(i6....176
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG(!(((i8.i2.u64.p229==0)||(i2.i1.u27.p113==1))))) + (i4.i0.u33.p129==1)) U !(E(TRUE U !((!(EX...257
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t39, t96, t101, t114, t118, t159, t175, t188, t190, t200, t204, t226, t228, t234, t...1022
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 207 transition count 465
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 207 transition count 465
Applied a total of 42 rules in 4 ms. Remains 207 /228 variables (removed 21) and now considering 465/501 (removed 36) transitions.
// Phase 1: matrix 465 rows 207 cols
[2024-06-03 01:29:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:29:06] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 01:29:06] [INFO ] Invariant cache hit.
[2024-06-03 01:29:06] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-03 01:29:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-03 01:29:14] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:29:14] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-03 01:29:14] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:29:14] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:29:14] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:29:15] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 4 ms to minimize.
[2024-06-03 01:29:15] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
[2024-06-03 01:29:15] [INFO ] Deduced a trap composed of 130 places in 191 ms of which 3 ms to minimize.
[2024-06-03 01:29:15] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 4 ms to minimize.
[2024-06-03 01:29:15] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 3 ms to minimize.
[2024-06-03 01:29:16] [INFO ] Deduced a trap composed of 130 places in 190 ms of which 3 ms to minimize.
[2024-06-03 01:29:16] [INFO ] Deduced a trap composed of 115 places in 222 ms of which 3 ms to minimize.
[2024-06-03 01:29:18] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 3 ms to minimize.
[2024-06-03 01:29:18] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:29:18] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 4 ms to minimize.
[2024-06-03 01:29:19] [INFO ] Deduced a trap composed of 131 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:29:19] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:29:19] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:29:19] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:29:20] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-03 01:29:20] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:29:21] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:29:21] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:29:21] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:29:21] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:29:22] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:29:22] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 3 ms to minimize.
[2024-06-03 01:29:22] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:29:24] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:29:24] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 3 ms to minimize.
[2024-06-03 01:29:24] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:29:25] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:29:25] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:29:25] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:29:25] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:29:26] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:29:26] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 4 ms to minimize.
[2024-06-03 01:29:27] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-03 01:29:27] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 2 ms to minimize.
[2024-06-03 01:29:27] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-03 01:29:31] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-06-03 01:29:31] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 4 ms to minimize.
[2024-06-03 01:29:33] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:29:33] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:29:33] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:29:34] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:29:34] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:29:34] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:29:35] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:29:35] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2024-06-03 01:29:35] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 3 ms to minimize.
[2024-06-03 01:29:35] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/672 variables, and 59 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-03 01:29:41] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 3 ms to minimize.
[2024-06-03 01:29:44] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:29:44] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (OVERLAPS) 465/672 variables, 207/269 constraints. Problems are: Problem set: 50 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 414/683 constraints. Problems are: Problem set: 50 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 683 constraints, problems are : Problem set: 50 solved, 414 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 414/464 constraints, Known Traps: 55/55 constraints]
After SMT, in 60580ms problems are : Problem set: 50 solved, 414 unsolved
Search for dead transitions found 50 dead transitions in 60587ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 207/228 places, 415/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61058 ms. Remains : 207/228 places, 415/501 transitions.
[2024-06-03 01:30:06] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:30:06] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:30:06] [INFO ] Input system was already deterministic with 415 transitions.
[2024-06-03 01:30:07] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:30:07] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:30:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17573110969754901373.gal : 2 ms
[2024-06-03 01:30:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8144102892541241705.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/CTLCardinality17573110969754901373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8144102892541241705.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-06-03 01:30:37] [INFO ] Flatten gal took : 13 ms
[2024-06-03 01:30:37] [INFO ] Applying decomposition
[2024-06-03 01:30:37] [INFO ] Flatten gal took : 12 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/graph2653998591981274762.txt' '-o' '/tmp/graph2653998591981274762.bin' '-w' '/tmp/graph2653998591981274762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2653998591981274762.bin' '-l' '-1' '-v' '-w' '/tmp/graph2653998591981274762.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:30:37] [INFO ] Decomposing Gal with order
[2024-06-03 01:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:30:37] [INFO ] Removed a total of 910 redundant transitions.
[2024-06-03 01:30:37] [INFO ] Flatten gal took : 24 ms
[2024-06-03 01:30:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2024-06-03 01:30:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10245155032238797911.gal : 3 ms
[2024-06-03 01:30:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17732690879029778209.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/CTLCardinality10245155032238797911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17732690879029778209.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15348e+07,9.1147,190372,3301,40,318800,827,916,949181,88,2676,0
Converting to forward existential form...Done !
original formula: ((AF((((i4.u49.p182==1)&&(i7.i0.u24.p170==0))&&(i3.i1.u37.p138==0))) + A((AF(((i2.i0.u40.p153==0)||(i6.i4.u52.p232==1))) * (!(AG(((i3.i1....473
=> equivalent forward existential formula: [FwdG(((Init * !((!(EG(!((((i4.u49.p182==1)&&(i7.i0.u24.p170==0))&&(i3.i1.u37.p138==0))))) + !((E(!(E(TRUE U (i6...653
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t59, t87, t120, t129, t182, t188, t195, t202, t209, t235, t243, t267, t275, t280, t...1006
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 7 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-03 01:31:07] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:31:07] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-03 01:31:07] [INFO ] Invariant cache hit.
[2024-06-03 01:31:07] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-03 01:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:15] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 3 ms to minimize.
[2024-06-03 01:31:15] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:31:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-03 01:31:15] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:31:15] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:31:16] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:31:16] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 3 ms to minimize.
[2024-06-03 01:31:16] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 2 ms to minimize.
[2024-06-03 01:31:16] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 4 ms to minimize.
[2024-06-03 01:31:17] [INFO ] Deduced a trap composed of 125 places in 292 ms of which 3 ms to minimize.
[2024-06-03 01:31:17] [INFO ] Deduced a trap composed of 125 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:31:17] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 2 ms to minimize.
[2024-06-03 01:31:17] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 2 ms to minimize.
[2024-06-03 01:31:18] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 2 ms to minimize.
[2024-06-03 01:31:18] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-06-03 01:31:18] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2024-06-03 01:31:18] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:31:20] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 3 ms to minimize.
[2024-06-03 01:31:20] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 01:31:20] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:21] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-06-03 01:31:21] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:31:21] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-06-03 01:31:21] [INFO ] Deduced a trap composed of 112 places in 200 ms of which 3 ms to minimize.
[2024-06-03 01:31:22] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 3 ms to minimize.
[2024-06-03 01:31:23] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:31:23] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:31:24] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:31:24] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 4 ms to minimize.
[2024-06-03 01:31:24] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 4 ms to minimize.
[2024-06-03 01:31:25] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 3 ms to minimize.
[2024-06-03 01:31:25] [INFO ] Deduced a trap composed of 144 places in 297 ms of which 3 ms to minimize.
[2024-06-03 01:31:25] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:31:26] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:31:26] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 2 ms to minimize.
[2024-06-03 01:31:26] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:31:27] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:31:27] [INFO ] Deduced a trap composed of 129 places in 302 ms of which 3 ms to minimize.
[2024-06-03 01:31:27] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:31:28] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:33] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:31:33] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:31:33] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 4 ms to minimize.
[2024-06-03 01:31:34] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:31:34] [INFO ] Deduced a trap composed of 143 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:31:34] [INFO ] Deduced a trap composed of 134 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:31:35] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:31:35] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:31:35] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:31:36] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:31:36] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:31:36] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:31:36] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:31:37] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:31:37] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:31:37] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:31:37] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 64 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:44] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:31:44] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:31:45] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:31:45] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:31:45] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:31:45] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:31:46] [INFO ] Deduced a trap composed of 122 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:31:46] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:31:46] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:31:48] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-06-03 01:31:48] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:31:48] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:51] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:31:52] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:31:52] [INFO ] Deduced a trap composed of 138 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:31:53] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:31:53] [INFO ] Deduced a trap composed of 114 places in 253 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:31:58] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:31:58] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 5 ms to minimize.
[2024-06-03 01:31:58] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:32:03] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:32:03] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:32:04] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/662 variables, and 87 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 80/80 constraints]
After SMT, in 60594ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60601ms
Starting structural reductions in LTL mode, iteration 1 : 202/228 places, 460/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61255 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-03 01:32:08] [INFO ] Flatten gal took : 25 ms
[2024-06-03 01:32:08] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:32:08] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-03 01:32:08] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:32:08] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:32:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9623556137951266864.gal : 5 ms
[2024-06-03 01:32:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1994741774422133472.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/CTLCardinality9623556137951266864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1994741774422133472.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-06-03 01:32:38] [INFO ] Flatten gal took : 15 ms
[2024-06-03 01:32:38] [INFO ] Applying decomposition
[2024-06-03 01:32:38] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11025887218742422672.txt' '-o' '/tmp/graph11025887218742422672.bin' '-w' '/tmp/graph11025887218742422672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11025887218742422672.bin' '-l' '-1' '-v' '-w' '/tmp/graph11025887218742422672.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:32:38] [INFO ] Decomposing Gal with order
[2024-06-03 01:32:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:32:38] [INFO ] Removed a total of 1286 redundant transitions.
[2024-06-03 01:32:38] [INFO ] Flatten gal took : 40 ms
[2024-06-03 01:32:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 11 ms.
[2024-06-03 01:32:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10668288588894569678.gal : 5 ms
[2024-06-03 01:32:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10012933049932355471.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/CTLCardinality10668288588894569678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10012933049932355471.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.08533e+07,7.10472,121352,2920,69,79194,571,1205,1.04577e+06,96,1405,0
Converting to forward existential form...Done !
original formula: !(E(A((E(((i7.i0.u13.p68==1)||(i7.i0.u13.p65==1)) U !(((i1.u8.p30==0)||(i1.u8.p31==1)))) + EG(E((i7.i2.u5.p24==1) U ((i0.i2.u42.p124==0)|...238
=> equivalent forward existential formula: [(EY(FwdU(Init,!((E(!(((i0.i2.u43.p166==0)||(i2.i0.u34.p131==1))) U (!((E(((i7.i0.u13.p68==1)||(i7.i0.u13.p65==1...393
Reverse transition relation is NOT exact ! Due to transitions t35, t56, t94, t101, t105, t159, t175, t188, t192, t204, t206, t228, t230, t236, t238, t260, ...1150
Detected timeout of ITS tools.
[2024-06-03 01:33:08] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:33:08] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:33:09] [INFO ] Applying decomposition
[2024-06-03 01:33:09] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13666633260112505189.txt' '-o' '/tmp/graph13666633260112505189.bin' '-w' '/tmp/graph13666633260112505189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13666633260112505189.bin' '-l' '-1' '-v' '-w' '/tmp/graph13666633260112505189.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:33:09] [INFO ] Decomposing Gal with order
[2024-06-03 01:33:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:33:09] [INFO ] Removed a total of 1271 redundant transitions.
[2024-06-03 01:33:09] [INFO ] Flatten gal took : 28 ms
[2024-06-03 01:33:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 6 ms.
[2024-06-03 01:33:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16122630028955962220.gal : 4 ms
[2024-06-03 01:33:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8360193425833373917.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/CTLCardinality16122630028955962220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8360193425833373917.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23297e+07,26.152,432360,5687,56,246289,591,1279,4.42251e+06,83,1919,0
Converting to forward existential form...Done !
original formula: A(AF(!(((EX(((i6.i1.u72.p221==0)||(i8.i1.u6.p20==1))) + (AF((i4.u31.p115==0)) * ((i2.i0.u28.p108==0)||(i7.i0.u4.p8==1)))) + AF(((i7.i2.u7...482
=> equivalent forward existential formula: [((Init * !(EG(!((((i8.i0.u26.p96!=1) * !((E(!(!((E(!(((i5.i0.u54.p234==0)||(i1.i0.u82.p14==1))) U (!(((i6.i1.u7...3276
Reverse transition relation is NOT exact ! Due to transitions t2, t29, t46, t93, t96, t129, t138, t139, t212, t234, t236, t237, t240, t243, t245, t247, t26...1686
ITS-tools command line returned an error code 139
[2024-06-03 01:48:04] [INFO ] Applying decomposition
[2024-06-03 01:48:04] [INFO ] Flatten gal took : 17 ms
[2024-06-03 01:48:04] [INFO ] Decomposing Gal with order
[2024-06-03 01:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:48:04] [INFO ] Removed a total of 838 redundant transitions.
[2024-06-03 01:48:04] [INFO ] Flatten gal took : 25 ms
[2024-06-03 01:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 3 ms.
[2024-06-03 01:48:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11678585643349215972.gal : 2 ms
[2024-06-03 01:48:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4231739032719189232.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/CTLCardinality11678585643349215972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4231739032719189232.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23297e+07,2.33651,67764,1153,3295,37813,75170,249,168750,566,692568,0
Converting to forward existential form...Done !
original formula: A(AF(!(((EX(((i0.i1.u11.p221==0)||(i0.i0.i0.u4.p20==1))) + (AF((i0.i1.u10.p115==0)) * ((i0.i1.u10.p108==0)||(i0.i0.i0.u4.p8==1)))) + AF((...512
=> equivalent forward existential formula: [((Init * !(EG(!((((i0.i0.i1.u8.p96!=1) * !((E(!(!((E(!(((i0.i1.u11.p234==0)||(i0.i0.i0.u4.p14==1))) U (!(((i0.i...3408
Reverse transition relation is NOT exact ! Due to transitions t276, t349, t351, u12.t1, u12.t2, u12.t4, u12.t6, i0.t465, i0.t454, i0.t421, i0.i0.i0.u4.t226...2149
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-06-03 01:51:37] [INFO ] Flatten gal took : 18 ms
[2024-06-03 01:51:37] [INFO ] Input system was already deterministic with 501 transitions.
[2024-06-03 01:51:37] [INFO ] Transformed 228 places.
[2024-06-03 01:51:37] [INFO ] Transformed 501 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 01:51:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14084155037708017830.gal : 3 ms
[2024-06-03 01:51:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality825732712699067630.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/CTLCardinality14084155037708017830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality825732712699067630.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23297e+07,149.747,2658732,2,125846,5,7.25519e+06,6,0,1415,7.17068e+06,0
Converting to forward existential form...Done !
original formula: A(AF(!(((EX(((p221==0)||(p20==1))) + (AF((p115==0)) * ((p108==0)||(p8==1)))) + AF(((p218==0)||(p18==1)))))) U (((p96!=1) * A(AF((p49==1))...302
=> equivalent forward existential formula: [((Init * !(EG(!((((p96!=1) * !((E(!(!((E(!(((p234==0)||(p14==1))) U (!(((p221==0)||(p62==1))) * !(((p234==0)||(...2138
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t13, t15, t17, t18, t21, t26, t29, t35, t37, t38, t40, t42, t43, t46, t47, t5...1011
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="MedleyA-PT-18"
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 MedleyA-PT-18, 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 r576-smll-171734920100137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 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 '
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 ;