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-171734920100145.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-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717381282136

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 02:21:24] [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 02:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 02:21:24] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-03 02:21:24] [INFO ] Transformed 272 places.
[2024-06-03 02:21:24] [INFO ] Transformed 586 transitions.
[2024-06-03 02:21:24] [INFO ] Found NUPN structural information;
[2024-06-03 02:21:24] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 3 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-19-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 224 transition count 533
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 224 transition count 533
Applied a total of 88 rules in 66 ms. Remains 224 /269 variables (removed 45) and now considering 533/583 (removed 50) transitions.
// Phase 1: matrix 533 rows 224 cols
[2024-06-03 02:21:24] [INFO ] Computed 22 invariants in 32 ms
[2024-06-03 02:21:25] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-06-03 02:21:25] [INFO ] Invariant cache hit.
[2024-06-03 02:21:26] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
Running 532 sub problems to find dead transitions.
[2024-06-03 02:21:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/224 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:21:37] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 23 ms to minimize.
[2024-06-03 02:21:37] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 2 ms to minimize.
[2024-06-03 02:21:37] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-06-03 02:21:38] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-03 02:21:39] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-03 02:21:40] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 6 ms to minimize.
[2024-06-03 02:21:40] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-06-03 02:21:40] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 13/35 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:21:47] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-06-03 02:21:47] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-03 02:21:48] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-03 02:21:48] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-06-03 02:21:48] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-03 02:21:48] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 6/41 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:21:52] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 1/42 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:21:56] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 224/757 variables, and 43 constraints, problems are : Problem set: 120 solved, 412 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/224 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 120 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/224 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 21/43 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:22:04] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 1/44 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/44 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 533/757 variables, 224/268 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 412/680 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-03 02:22:17] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 4 ms to minimize.
[2024-06-03 02:22:18] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 3 ms to minimize.
[2024-06-03 02:22:18] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 4 ms to minimize.
[2024-06-03 02:22:18] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 3 ms to minimize.
[2024-06-03 02:22:18] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-03 02:22:19] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 2 ms to minimize.
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 2 ms to minimize.
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 5 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 3 ms to minimize.
[2024-06-03 02:22:22] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 6 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 4 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-03 02:22:24] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 4 ms to minimize.
[2024-06-03 02:22:25] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-06-03 02:22:26] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-03 02:22:28] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 2 ms to minimize.
[2024-06-03 02:22:28] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 62146ms, After SMT, problems are : Problem set: 120 solved, 412 unsolved
Search for dead transitions found 120 dead transitions in 62199ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 224/269 places, 413/583 transitions.
Applied a total of 0 rules in 13 ms. Remains 224 /224 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63669 ms. Remains : 224/269 places, 413/583 transitions.
Support contains 112 out of 224 places after structural reductions.
[2024-06-03 02:22:28] [INFO ] Flatten gal took : 142 ms
[2024-06-03 02:22:28] [INFO ] Flatten gal took : 76 ms
[2024-06-03 02:22:29] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 99 out of 224 places (down from 112) after GAL structural reductions.
RANDOM walk for 40000 steps (21 resets) in 3008 ms. (13 steps per ms) remains 41/65 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (10 resets) in 28 ms. (137 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (15 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (14 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (11 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
// Phase 1: matrix 413 rows 224 cols
[2024-06-03 02:22:30] [INFO ] Computed 22 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 69/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 79/206 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 2/208 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 400/608 variables, 208/230 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 24/632 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 5/637 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/637 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 246 constraints, problems are : Problem set: 0 solved, 36 unsolved in 3151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 69/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 79/206 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-03 02:22:34] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-03 02:22:34] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-03 02:22:34] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-06-03 02:22:35] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2024-06-03 02:22:35] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-03 02:22:35] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-03 02:22:35] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-06-03 02:22:35] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-03 02:22:36] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 3 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:22:38] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
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 1)
(s13 0)
(s14 0)
(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 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(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 0)
(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 1)
(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 1)
(s101 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/637 variables, and 48 constraints, problems are : Problem set: 0 solved, 36 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/224 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 27/27 constraints]
After SMT, in 8223ms problems are : Problem set: 0 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 221 transition count 395
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 207 transition count 387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 201 transition count 387
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 44 place count 201 transition count 384
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 198 transition count 384
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 67 place count 181 transition count 365
Iterating global reduction 3 with 17 rules applied. Total rules applied 84 place count 181 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 181 transition count 364
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 180 transition count 364
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 141 place count 152 transition count 337
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 152 transition count 335
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 147 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 162 place count 147 transition count 335
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 163 place count 147 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 146 transition count 334
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 146 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 168 place count 144 transition count 332
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 172 place count 144 transition count 328
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 176 place count 140 transition count 328
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 186 place count 140 transition count 328
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 187 place count 140 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 188 place count 139 transition count 327
Applied a total of 188 rules in 305 ms. Remains 139 /224 variables (removed 85) and now considering 327/413 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 139/224 places, 327/413 transitions.
RANDOM walk for 40000 steps (2379 resets) in 868 ms. (46 steps per ms) remains 13/36 properties
BEST_FIRST walk for 40004 steps (490 resets) in 86 ms. (459 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (497 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (586 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (512 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (501 resets) in 93 ms. (425 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (514 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (514 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (446 resets) in 117 ms. (339 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (518 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (523 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
// Phase 1: matrix 327 rows 139 cols
[2024-06-03 02:22:39] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:22:39] [INFO ] State equation strengthened by 113 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/95 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 40/135 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/138 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 327/465 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 113/273 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/466 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/466 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 274 constraints, problems are : Problem set: 0 solved, 7 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/95 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 02:22:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 40/135 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/138 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 327/465 variables, 138/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 113/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 02:22:41] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 02:22:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-03 02:22:41] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/466 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/466 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 285 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 2417ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 852 ms.
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 327/327 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 139 transition count 312
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 124 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 124 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 123 transition count 311
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 113 transition count 293
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 113 transition count 293
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 90 place count 93 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 90 transition count 287
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 90 transition count 277
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 117 place count 80 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 80 transition count 275
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 130 place count 80 transition count 465
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 173 place count 68 transition count 434
Applied a total of 173 rules in 81 ms. Remains 68 /139 variables (removed 71) and now considering 434/327 (removed -107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 68/139 places, 434/327 transitions.
RANDOM walk for 23081 steps (3431 resets) in 264 ms. (87 steps per ms) remains 0/1 properties
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-19-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 02:22:43] [INFO ] Flatten gal took : 42 ms
[2024-06-03 02:22:43] [INFO ] Flatten gal took : 44 ms
[2024-06-03 02:22:43] [INFO ] Input system was already deterministic with 413 transitions.
Computed a total of 25 stabilizing places and 28 stable transitions
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 220 transition count 373
Reduce places removed 36 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 40 rules applied. Total rules applied 77 place count 184 transition count 369
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 80 place count 182 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 181 transition count 368
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 81 place count 181 transition count 362
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 93 place count 175 transition count 362
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 124 place count 144 transition count 322
Iterating global reduction 4 with 31 rules applied. Total rules applied 155 place count 144 transition count 322
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 320
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 142 transition count 320
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 218 place count 111 transition count 292
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 109 transition count 288
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 109 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 109 transition count 284
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 227 place count 109 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 108 transition count 283
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 6 with 6 rules applied. Total rules applied 234 place count 105 transition count 280
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 235 place count 105 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 236 place count 104 transition count 279
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 104 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 102 transition count 277
Applied a total of 239 rules in 116 ms. Remains 102 /224 variables (removed 122) and now considering 277/413 (removed 136) transitions.
[2024-06-03 02:22:43] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
// Phase 1: matrix 276 rows 102 cols
[2024-06-03 02:22:43] [INFO ] Computed 19 invariants in 3 ms
[2024-06-03 02:22:43] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-03 02:22:43] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
[2024-06-03 02:22:43] [INFO ] Invariant cache hit.
[2024-06-03 02:22:43] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-03 02:22:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-03 02:22:44] [INFO ] Redundant transitions in 89 ms returned []
Running 268 sub problems to find dead transitions.
[2024-06-03 02:22:44] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
[2024-06-03 02:22:44] [INFO ] Invariant cache hit.
[2024-06-03 02:22:44] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 275/377 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 150 constraints, problems are : Problem set: 0 solved, 268 unsolved in 13093 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 275/377 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 268/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/378 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 418 constraints, problems are : Problem set: 0 solved, 268 unsolved in 21925 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 35352ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 35355ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/224 places, 277/413 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35931 ms. Remains : 102/224 places, 277/413 transitions.
[2024-06-03 02:23:19] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:23:19] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:23:19] [INFO ] Input system was already deterministic with 277 transitions.
[2024-06-03 02:23:19] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:23:19] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality3889699830441530924.gal : 19 ms
[2024-06-03 02:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2972987172175942940.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3889699830441530924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2972987172175942940.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,4.18243e+09,7.66839,172908,2,8760,5,716993,6,0,676,563719,0


Converting to forward existential form...Done !
original formula: AG((!(E(AG((p178==0)) U (p264==1))) + (p44==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p44==1))),!(E(TRUE U !((p178==0))))) * (p264==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t6, t7, t8, t9, t20, t21, t22, t23, t24, t26, t28, t29, t31, t32, t44, t46, t47, t53,...277
Detected timeout of ITS tools.
[2024-06-03 02:23:49] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:23:49] [INFO ] Applying decomposition
[2024-06-03 02:23:49] [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/graph14580292848362748458.txt' '-o' '/tmp/graph14580292848362748458.bin' '-w' '/tmp/graph14580292848362748458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14580292848362748458.bin' '-l' '-1' '-v' '-w' '/tmp/graph14580292848362748458.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:23:49] [INFO ] Decomposing Gal with order
[2024-06-03 02:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:23:50] [INFO ] Removed a total of 618 redundant transitions.
[2024-06-03 02:23:50] [INFO ] Flatten gal took : 132 ms
[2024-06-03 02:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 24 ms.
[2024-06-03 02:23:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2857182761653380994.gal : 9 ms
[2024-06-03 02:23:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11472956398878163589.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/CTLCardinality2857182761653380994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11472956398878163589.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,4.18243e+09,0.15376,6280,230,34,5410,151,358,10581,59,403,0


Converting to forward existential form...Done !
original formula: AG((!(E(AG((i4.u16.p178==0)) U (i4.u26.p264==1))) + (i1.u1.p44==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((i1.u1.p44==1))),!(E(TRUE U !((i4.u16.p178==0))))) * (i4.u26.p264==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t24, i0.t170, i0.u7.t53, i0.u18.t28, i1.t68, i1.u1.t73, i1.u5.t66, i2.i0.t3, i2.i0.t47, i...421
(forward)formula 0,0,1.27564,32416,1,0,50492,973,2265,158531,283,2344,73957
FORMULA MedleyA-PT-19-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 190 transition count 375
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 190 transition count 375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 187 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 187 transition count 369
Applied a total of 74 rules in 12 ms. Remains 187 /224 variables (removed 37) and now considering 369/413 (removed 44) transitions.
// Phase 1: matrix 369 rows 187 cols
[2024-06-03 02:23:51] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:23:51] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-03 02:23:51] [INFO ] Invariant cache hit.
[2024-06-03 02:23:52] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-03 02:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-03 02:23:58] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 4 ms to minimize.
[2024-06-03 02:23:58] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:23:59] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-03 02:23:59] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:23:59] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-03 02:23:59] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
[2024-06-03 02:24:00] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-03 02:24:00] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-03 02:24:00] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:24:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/556 variables, 187/219 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-03 02:24:09] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 4 ms to minimize.
[2024-06-03 02:24:09] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 3 ms to minimize.
[2024-06-03 02:24:09] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 3 ms to minimize.
[2024-06-03 02:24:10] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-03 02:24:10] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-06-03 02:24:10] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-03 02:24:11] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 226 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/556 variables, 187/226 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 368/594 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-03 02:24:35] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2024-06-03 02:24:37] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 368 unsolved
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 Int declared 556/556 variables, and 596 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 19/19 constraints]
After SMT, in 60757ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Starting structural reductions in LTL mode, iteration 1 : 187/224 places, 369/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61298 ms. Remains : 187/224 places, 369/413 transitions.
[2024-06-03 02:24:52] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:24:52] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:24:52] [INFO ] Input system was already deterministic with 369 transitions.
[2024-06-03 02:24:52] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:24:52] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality16281731579719191348.gal : 4 ms
[2024-06-03 02:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3174010747082723181.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/CTLCardinality16281731579719191348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3174010747082723181.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 02:25:23] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:25:23] [INFO ] Applying decomposition
[2024-06-03 02:25:23] [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/graph2153037092117492113.txt' '-o' '/tmp/graph2153037092117492113.bin' '-w' '/tmp/graph2153037092117492113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2153037092117492113.bin' '-l' '-1' '-v' '-w' '/tmp/graph2153037092117492113.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:25:23] [INFO ] Decomposing Gal with order
[2024-06-03 02:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:25:23] [INFO ] Removed a total of 524 redundant transitions.
[2024-06-03 02:25:23] [INFO ] Flatten gal took : 42 ms
[2024-06-03 02:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 8 ms.
[2024-06-03 02:25:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7680987357369162880.gal : 5 ms
[2024-06-03 02:25:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4194113614854590883.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/CTLCardinality7680987357369162880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4194113614854590883.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,7.11344e+11,0.955502,21680,1512,445,32598,6962,497,61496,200,29108,0


Converting to forward existential form...Done !
original formula: E(AX(!(((A(A(((i3.u10.p43==0)||(i9.i0.u37.p189==1)) U (i0.i0.u0.p0==1)) U ((i3.u8.p38==1)||(i4.u4.p25==0))) + EX(((i3.u11.p49==0)||(u21.p...221
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((!((E(!(((i3.u8.p38==1)||(i4.u4.p25==0))) U (!(!((E(!((i0.i0.u0.p0==1)) U (!(((i3.u10.p43=...433
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t77, t126, u21.t76, u21.t78, u21.t80, u21.t81, u21.t83, u21.t84, u21.t85, u21.t87, u...1015
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 189 transition count 373
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 189 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 186 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 186 transition count 367
Applied a total of 76 rules in 24 ms. Remains 186 /224 variables (removed 38) and now considering 367/413 (removed 46) transitions.
// Phase 1: matrix 367 rows 186 cols
[2024-06-03 02:25:53] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:25:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-03 02:25:53] [INFO ] Invariant cache hit.
[2024-06-03 02:25:54] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-03 02:25:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:26:00] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 3 ms to minimize.
[2024-06-03 02:26:00] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2024-06-03 02:26:00] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-06-03 02:26:00] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-06-03 02:26:01] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-06-03 02:26:01] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-06-03 02:26:01] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-03 02:26:01] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-03 02:26:02] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-03 02:26:02] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:26:02] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:26:02] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:26:07] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/553 variables, 186/221 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:26:18] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 3 ms to minimize.
[2024-06-03 02:26:18] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 4 ms to minimize.
[2024-06-03 02:26:19] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 3 ms to minimize.
[2024-06-03 02:26:19] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-03 02:26:20] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-06-03 02:26:20] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-03 02:26:20] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-03 02:26:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-03 02:26:21] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:26:21] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 10/231 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 231 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/231 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 366/597 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:26:38] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:26:51] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:26:52] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 600 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 26/26 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60783ms
Starting structural reductions in LTL mode, iteration 1 : 186/224 places, 367/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61438 ms. Remains : 186/224 places, 367/413 transitions.
[2024-06-03 02:26:54] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:26:54] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:26:54] [INFO ] Input system was already deterministic with 367 transitions.
[2024-06-03 02:26:54] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:26:54] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:26:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7880042106813009780.gal : 5 ms
[2024-06-03 02:26:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18382191232743026085.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/CTLCardinality7880042106813009780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18382191232743026085.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 02:27:25] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:27:25] [INFO ] Applying decomposition
[2024-06-03 02:27:25] [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/graph15591804552961768539.txt' '-o' '/tmp/graph15591804552961768539.bin' '-w' '/tmp/graph15591804552961768539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15591804552961768539.bin' '-l' '-1' '-v' '-w' '/tmp/graph15591804552961768539.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:27:25] [INFO ] Decomposing Gal with order
[2024-06-03 02:27:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:27:25] [INFO ] Removed a total of 612 redundant transitions.
[2024-06-03 02:27:25] [INFO ] Flatten gal took : 35 ms
[2024-06-03 02:27:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 12 ms.
[2024-06-03 02:27:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15397920918203114513.gal : 5 ms
[2024-06-03 02:27:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1875704423088154125.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/CTLCardinality15397920918203114513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1875704423088154125.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,6.6806e+11,1.69105,47476,1992,173,96165,2563,590,199601,108,11653,0


Converting to forward existential form...Done !
original formula: A((A(EF(AX(((i2.i0.u42.p184==0)||(i5.i0.u21.p89==1)))) U ((i10.u40.p263==0) * EG(((i9.u48.p207==0)||(i0.u57.p248==1))))) + AF(!(EG(((i10....215
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((i4.i0.u60.p258!=0)))))))) * !(E(!(!(E(TRUE U !((i4.i0.u60.p258!=0))))) U (!((!((E...545
Reverse transition relation is NOT exact ! Due to transitions t30, t93, t126, i0.t20, i0.u56.t10, i0.u57.t18, i3.t152, i3.t150, i3.t141, i3.u7.t158, i3.u7....962
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 an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 193 transition count 377
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 193 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 191 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 191 transition count 373
Applied a total of 66 rules in 8 ms. Remains 191 /224 variables (removed 33) and now considering 373/413 (removed 40) transitions.
// Phase 1: matrix 373 rows 191 cols
[2024-06-03 02:27:55] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:27:55] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-03 02:27:55] [INFO ] Invariant cache hit.
[2024-06-03 02:27:55] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-06-03 02:27:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:28:02] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-03 02:28:02] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:28:02] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 3 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-03 02:28:03] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-03 02:28:04] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:28:04] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-03 02:28:04] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:28:04] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/564 variables, 191/226 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:28:12] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-06-03 02:28:13] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-03 02:28:13] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 2 ms to minimize.
[2024-06-03 02:28:13] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-03 02:28:13] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:28:14] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-03 02:28:14] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-06-03 02:28:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-03 02:28:14] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 9/235 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:28:23] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 236 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/564 variables, 191/236 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 372/608 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:28:37] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 4 ms to minimize.
[2024-06-03 02:28:38] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-03 02:28:38] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-03 02:28:39] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 612 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 27/27 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Starting structural reductions in LTL mode, iteration 1 : 191/224 places, 373/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61279 ms. Remains : 191/224 places, 373/413 transitions.
[2024-06-03 02:28:56] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:28:56] [INFO ] Flatten gal took : 23 ms
[2024-06-03 02:28:56] [INFO ] Input system was already deterministic with 373 transitions.
[2024-06-03 02:28:56] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:28:56] [INFO ] Flatten gal took : 27 ms
[2024-06-03 02:28:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14742352560858412802.gal : 6 ms
[2024-06-03 02:28:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1943240932509273918.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/CTLCardinality14742352560858412802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1943240932509273918.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 02:29:26] [INFO ] Flatten gal took : 14 ms
[2024-06-03 02:29:26] [INFO ] Applying decomposition
[2024-06-03 02:29:26] [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/graph8724745369138173070.txt' '-o' '/tmp/graph8724745369138173070.bin' '-w' '/tmp/graph8724745369138173070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8724745369138173070.bin' '-l' '-1' '-v' '-w' '/tmp/graph8724745369138173070.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:29:26] [INFO ] Decomposing Gal with order
[2024-06-03 02:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:29:26] [INFO ] Removed a total of 686 redundant transitions.
[2024-06-03 02:29:26] [INFO ] Flatten gal took : 34 ms
[2024-06-03 02:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2024-06-03 02:29:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality18446174051023026404.gal : 4 ms
[2024-06-03 02:29:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality15549573840772239797.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/CTLCardinality18446174051023026404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15549573840772239797.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,8.25544e+11,0.694091,23928,1859,65,43506,699,575,73813,70,3127,0


Converting to forward existential form...Done !
original formula: !(E(E(A((((i2.u12.p51==0)||(i0.i2.u2.p3==1))&&(!((i9.i1.u62.p247==0)||(i7.u46.p200==1)))) U ((((i7.u51.p207==0)||(i0.i1.u40.p160==1))||((...342
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(!((E(!(((((i7.u51.p207==0)||(i0.i1.u40.p160==1))||((i5.u23.p100==0)||(i8.u42.p163==1)))||(!((i...655
Reverse transition relation is NOT exact ! Due to transitions t30, t56, t131, i1.u5.t167, i2.t157, i2.t155, i2.t146, i2.u7.t163, i2.u7.t164, i2.u10.t165, i...1167
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 220 transition count 372
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 81 place count 183 transition count 366
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 180 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 179 transition count 365
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 86 place count 179 transition count 358
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 100 place count 172 transition count 358
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 132 place count 140 transition count 317
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 140 transition count 317
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 164 place count 140 transition count 314
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 137 transition count 314
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 57 rules applied. Total rules applied 227 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 105 transition count 283
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 105 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 105 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 240 place count 102 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 100 transition count 275
Applied a total of 242 rules in 74 ms. Remains 100 /224 variables (removed 124) and now considering 275/413 (removed 138) transitions.
[2024-06-03 02:29:57] [INFO ] Flow matrix only has 274 transitions (discarded 1 similar events)
// Phase 1: matrix 274 rows 100 cols
[2024-06-03 02:29:57] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 02:29:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-03 02:29:57] [INFO ] Flow matrix only has 274 transitions (discarded 1 similar events)
[2024-06-03 02:29:57] [INFO ] Invariant cache hit.
[2024-06-03 02:29:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-03 02:29:57] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-03 02:29:57] [INFO ] Redundant transitions in 59 ms returned []
Running 266 sub problems to find dead transitions.
[2024-06-03 02:29:57] [INFO ] Flow matrix only has 274 transitions (discarded 1 similar events)
[2024-06-03 02:29:57] [INFO ] Invariant cache hit.
[2024-06-03 02:29:57] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 273/373 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 28/147 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 148 constraints, problems are : Problem set: 0 solved, 266 unsolved in 14188 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 273/373 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 28/147 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 266/413 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 414 constraints, problems are : Problem set: 0 solved, 266 unsolved in 23459 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 38063ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 38068ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/224 places, 275/413 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38485 ms. Remains : 100/224 places, 275/413 transitions.
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 7 ms
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:30:35] [INFO ] Input system was already deterministic with 275 transitions.
RANDOM walk for 162 steps (12 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:30:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15996968797185963138.gal : 3 ms
[2024-06-03 02:30:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9725976862019204212.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/ReachabilityCardinality15996968797185963138.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9725976862019204212.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 221 transition count 375
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 186 transition count 369
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 183 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 80 place count 183 transition count 363
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 177 transition count 363
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 122 place count 147 transition count 325
Iterating global reduction 3 with 30 rules applied. Total rules applied 152 place count 147 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 152 place count 147 transition count 322
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 144 transition count 322
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 212 place count 116 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 114 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 114 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 219 place count 114 transition count 289
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 111 transition count 286
Applied a total of 225 rules in 40 ms. Remains 111 /224 variables (removed 113) and now considering 286/413 (removed 127) transitions.
[2024-06-03 02:30:35] [INFO ] Flow matrix only has 285 transitions (discarded 1 similar events)
// Phase 1: matrix 285 rows 111 cols
[2024-06-03 02:30:35] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 02:30:35] [INFO ] Implicit Places using invariants in 91 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/224 places, 286/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 141 ms. Remains : 110/224 places, 286/413 transitions.
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 9 ms
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:30:35] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:30:35] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:30:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality7329923278215553741.gal : 2 ms
[2024-06-03 02:30:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17559378030828418307.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/CTLCardinality7329923278215553741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17559378030828418307.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,6.47635e+09,8.53202,195300,2,15885,5,752783,6,0,722,641678,0


Converting to forward existential form...Done !
original formula: E(EG((AF(EG(((p256==0)||(p31==1)))) * AF((((p203==1)&&(p173==1)) + EG(((p265==0)||(p1==1))))))) U AG((p216!=1)))
=> equivalent forward existential formula: [(FwdU(Init,EG((!(EG(!(EG(((p256==0)||(p31==1)))))) * !(EG(!((((p203==1)&&(p173==1)) + EG(((p265==0)||(p1==1))))...200
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t11, t12, t20, t21, t26, t27, t28, t29, t37, t38, t50, t52, t53, t59, t72, t74, t...286
Detected timeout of ITS tools.
[2024-06-03 02:31:05] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:31:05] [INFO ] Applying decomposition
[2024-06-03 02:31:05] [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/graph15982850651073337579.txt' '-o' '/tmp/graph15982850651073337579.bin' '-w' '/tmp/graph15982850651073337579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15982850651073337579.bin' '-l' '-1' '-v' '-w' '/tmp/graph15982850651073337579.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:31:05] [INFO ] Decomposing Gal with order
[2024-06-03 02:31:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:31:06] [INFO ] Removed a total of 502 redundant transitions.
[2024-06-03 02:31:06] [INFO ] Flatten gal took : 27 ms
[2024-06-03 02:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 4 ms.
[2024-06-03 02:31:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10207427436690169134.gal : 2 ms
[2024-06-03 02:31:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14892750200337389857.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/CTLCardinality10207427436690169134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14892750200337389857.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,6.47635e+09,0.149693,8588,353,142,9759,865,353,19069,150,2041,0


Converting to forward existential form...Done !
original formula: E(EG((AF(EG(((i5.u24.p256==0)||(i4.u1.p31==1)))) * AF((((i4.u17.p203==1)&&(i3.u14.p173==1)) + EG(((i5.u24.p265==0)||(i5.u0.p1==1))))))) U...177
=> equivalent forward existential formula: [(FwdU(Init,EG((!(EG(!(EG(((i5.u24.p256==0)||(i4.u1.p31==1)))))) * !(EG(!((((i4.u17.p203==1)&&(i3.u14.p173==1)) ...247
Reverse transition relation is NOT exact ! Due to transitions t5, t29, t87, t88, t225, i0.t75, i0.t1, i0.u2.t74, i0.u6.t72, i1.t53, i1.t3, i1.u8.t52, i1.u1...392
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 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 193 transition count 377
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 193 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 191 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 191 transition count 373
Applied a total of 66 rules in 9 ms. Remains 191 /224 variables (removed 33) and now considering 373/413 (removed 40) transitions.
// Phase 1: matrix 373 rows 191 cols
[2024-06-03 02:31:36] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:31:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 02:31:36] [INFO ] Invariant cache hit.
[2024-06-03 02:31:36] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-06-03 02:31:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:31:43] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-03 02:31:43] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-03 02:31:43] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 3 ms to minimize.
[2024-06-03 02:31:43] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-06-03 02:31:43] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-03 02:31:44] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-03 02:31:44] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:31:44] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-03 02:31:45] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-03 02:31:45] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-06-03 02:31:45] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/564 variables, 191/224 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:31:50] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 4 ms to minimize.
[2024-06-03 02:31:50] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-03 02:31:51] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-03 02:31:51] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-03 02:31:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:31:51] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-03 02:31:52] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-03 02:31:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:32:02] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/564 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 372 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 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.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 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 233 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/564 variables, 191/233 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 372/605 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-03 02:32:19] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-06-03 02:32:22] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-06-03 02:32:23] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 608 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 23/23 constraints]
After SMT, in 60635ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Starting structural reductions in LTL mode, iteration 1 : 191/224 places, 373/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 191/224 places, 373/413 transitions.
[2024-06-03 02:32:37] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:32:37] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:32:37] [INFO ] Input system was already deterministic with 373 transitions.
[2024-06-03 02:32:37] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:32:37] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:32:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5292503613182752316.gal : 4 ms
[2024-06-03 02:32:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality8688479882086999012.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/CTLCardinality5292503613182752316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8688479882086999012.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 02:33:07] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:33:07] [INFO ] Applying decomposition
[2024-06-03 02:33:07] [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/graph15478403847160832307.txt' '-o' '/tmp/graph15478403847160832307.bin' '-w' '/tmp/graph15478403847160832307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15478403847160832307.bin' '-l' '-1' '-v' '-w' '/tmp/graph15478403847160832307.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:33:07] [INFO ] Decomposing Gal with order
[2024-06-03 02:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:33:07] [INFO ] Removed a total of 678 redundant transitions.
[2024-06-03 02:33:07] [INFO ] Flatten gal took : 45 ms
[2024-06-03 02:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 10 ms.
[2024-06-03 02:33:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality9770672699657389323.gal : 5 ms
[2024-06-03 02:33:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14696414328882873813.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/CTLCardinality9770672699657389323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14696414328882873813.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,9.53461e+11,3.74398,98464,2591,61,150608,507,659,667606,79,2222,0


Converting to forward existential form...Done !
original formula: EF((A(((((i2.u16.p73==0)||(i4.u22.p104==1))&&((i2.u3.p8==0)||(i5.u39.p172==1))) * ((i8.u55.p239==1) * (((i2.u15.p59==0)&&(i4.u20.p85==1))...329
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!((E(!(((!(EG(!((i4.u35.p149==0)))) * ((i7.u40.p177==0)||(i1.u10.p43==1))) * (i2.u1...1273
Reverse transition relation is NOT exact ! Due to transitions t45, t80, i1.t157, i1.t155, i1.t146, i1.u7.t127, i1.u7.t165, i1.u7.t166, i1.u8.t163, i1.u8.t1...1209
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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 a local 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 SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 220 transition count 373
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 184 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 181 transition count 367
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 82 place count 181 transition count 361
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 94 place count 175 transition count 361
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 123 place count 146 transition count 323
Iterating global reduction 3 with 29 rules applied. Total rules applied 152 place count 146 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 152 place count 146 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 143 transition count 320
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 216 place count 113 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 112 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 112 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 112 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 109 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 109 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 107 transition count 282
Applied a total of 230 rules in 43 ms. Remains 107 /224 variables (removed 117) and now considering 282/413 (removed 131) transitions.
[2024-06-03 02:33:37] [INFO ] Flow matrix only has 281 transitions (discarded 1 similar events)
// Phase 1: matrix 281 rows 107 cols
[2024-06-03 02:33:37] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 02:33:37] [INFO ] Implicit Places using invariants in 105 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 106/224 places, 282/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 158 ms. Remains : 106/224 places, 282/413 transitions.
[2024-06-03 02:33:37] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:33:37] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:33:37] [INFO ] Input system was already deterministic with 282 transitions.
[2024-06-03 02:33:37] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:33:37] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:33:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7657166225443290694.gal : 3 ms
[2024-06-03 02:33:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1077168426446337923.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/CTLCardinality7657166225443290694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1077168426446337923.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,6.47461e+09,10.2169,189872,2,10827,5,827997,6,0,699,618137,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF(((p174==0)&&(p108==0))) + AF(((p47==1)||(p50==0)))) + (AF(((p143==0)||(p63==1))) * EG((p166==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!(((p174==0)&&(p108==0))))) + !(EG(!(((p47==1)||(p50==0)))))) + (!(EG(!(((p143==0...199
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t10, t20, t21, t22, t23, t28, t29, t31, t32, t44, t46, t47, t52, t54, t60...288
Detected timeout of ITS tools.
[2024-06-03 02:34:07] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:34:07] [INFO ] Applying decomposition
[2024-06-03 02:34:07] [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/graph3325145214781646999.txt' '-o' '/tmp/graph3325145214781646999.bin' '-w' '/tmp/graph3325145214781646999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3325145214781646999.bin' '-l' '-1' '-v' '-w' '/tmp/graph3325145214781646999.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:34:07] [INFO ] Decomposing Gal with order
[2024-06-03 02:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:34:07] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-03 02:34:07] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 4 ms.
[2024-06-03 02:34:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4517237379670937730.gal : 3 ms
[2024-06-03 02:34:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality11752962683947315828.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/CTLCardinality4517237379670937730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11752962683947315828.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,6.47461e+09,0.135828,6364,297,146,4494,1199,333,7806,139,4045,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF(((i0.u24.p174==0)&&(i4.u10.p108==0))) + AF(((i1.u3.p47==1)||(i1.u4.p50==0)))) + (AF(((i4.u17.p143==0)||(i2.u8.p63==1))) * EG((...175
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!(((i0.u24.p174==0)&&(i4.u10.p108==0))))) + !(EG(!(((i1.u3.p47==1)||(i1.u4.p50==0...245
Reverse transition relation is NOT exact ! Due to transitions t5, t23, t85, i0.u24.t7, i0.u24.t8, i0.u24.t10, i0.u24.t28, i0.u24.t29, i1.t73, i1.t72, i1.t1...411
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,18.1663,456948,1,0,655904,104763,2188,2.38669e+06,752,825039,360610
FORMULA MedleyA-PT-19-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 189 transition count 374
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 189 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 187 transition count 370
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 187 transition count 370
Applied a total of 74 rules in 5 ms. Remains 187 /224 variables (removed 37) and now considering 370/413 (removed 43) transitions.
// Phase 1: matrix 370 rows 187 cols
[2024-06-03 02:34:26] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:34:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 02:34:26] [INFO ] Invariant cache hit.
[2024-06-03 02:34:26] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-06-03 02:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:34:33] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-06-03 02:34:33] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-06-03 02:34:33] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-06-03 02:34:33] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-03 02:34:33] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-06-03 02:34:34] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-06-03 02:34:34] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:34:34] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-06-03 02:34:35] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-03 02:34:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:34:35] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-03 02:34:35] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:34:41] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 370/557 variables, 187/222 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:34:50] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 4 ms to minimize.
[2024-06-03 02:34:50] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2024-06-03 02:34:51] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-03 02:34:51] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-06-03 02:34:51] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-03 02:34:52] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 228 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/557 variables, 187/228 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 369/597 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:35:10] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:35:10] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:35:10] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:35:20] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 601 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 23/23 constraints]
After SMT, in 60714ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60722ms
Starting structural reductions in LTL mode, iteration 1 : 187/224 places, 370/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61195 ms. Remains : 187/224 places, 370/413 transitions.
[2024-06-03 02:35:27] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:35:27] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:35:27] [INFO ] Input system was already deterministic with 370 transitions.
[2024-06-03 02:35:27] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:35:27] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:35:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality18123626874404529077.gal : 2 ms
[2024-06-03 02:35:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8587140932275448822.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18123626874404529077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8587140932275448822.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 02:35:57] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:35:57] [INFO ] Applying decomposition
[2024-06-03 02:35:57] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10672078585614789152.txt' '-o' '/tmp/graph10672078585614789152.bin' '-w' '/tmp/graph10672078585614789152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10672078585614789152.bin' '-l' '-1' '-v' '-w' '/tmp/graph10672078585614789152.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:35:57] [INFO ] Decomposing Gal with order
[2024-06-03 02:35:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:35:57] [INFO ] Removed a total of 565 redundant transitions.
[2024-06-03 02:35:57] [INFO ] Flatten gal took : 24 ms
[2024-06-03 02:35:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 4 ms.
[2024-06-03 02:35:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality4130971424839749504.gal : 3 ms
[2024-06-03 02:35:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7395048185072149310.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/CTLCardinality4130971424839749504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7395048185072149310.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,6.51671e+11,0.940873,26472,1938,225,48834,2823,559,80532,127,11696,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(((((i1.u7.p35==0)||(i4.u28.p121==1))||((i4.u30.p126==0)||(i10.u53.p233==1)))||((i3.i0.u15.p78==0)&&(i3.i1.u16.p63==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(((((i1.u7.p35==0)||(i4.u28.p121==1))||((i4.u30.p126==0)||(i10.u53.p233==1)))||(...212
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t79, i1.t155, i1.t153, i1.t144, i1.u7.t163, i1.u7.t164, i1.u8.t161, i1.u8.t162, i1.u...975
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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 : 224/224 places, 413/413 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 188 transition count 373
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 188 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 185 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 185 transition count 367
Applied a total of 78 rules in 6 ms. Remains 185 /224 variables (removed 39) and now considering 367/413 (removed 46) transitions.
// Phase 1: matrix 367 rows 185 cols
[2024-06-03 02:36:27] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:36:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 02:36:27] [INFO ] Invariant cache hit.
[2024-06-03 02:36:28] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-03 02:36:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:36:34] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-03 02:36:34] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-06-03 02:36:35] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:36:35] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-06-03 02:36:35] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-06-03 02:36:35] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-03 02:36:35] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-03 02:36:36] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-03 02:36:36] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-03 02:36:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-03 02:36:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:36:40] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/552 variables, 185/219 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:36:46] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2024-06-03 02:36:47] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-06-03 02:36:47] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-03 02:36:47] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-03 02:36:47] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:36:51] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-03 02:36:51] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/226 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/592 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:37:10] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-03 02:37:12] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-03 02:37:13] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-03 02:37:25] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 596 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 23/23 constraints]
After SMT, in 60724ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Starting structural reductions in LTL mode, iteration 1 : 185/224 places, 367/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61254 ms. Remains : 185/224 places, 367/413 transitions.
[2024-06-03 02:37:28] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:37:28] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:37:28] [INFO ] Input system was already deterministic with 367 transitions.
[2024-06-03 02:37:29] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:37:29] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:37:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality587619758211992895.gal : 5 ms
[2024-06-03 02:37:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11846551076281095733.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/CTLCardinality587619758211992895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11846551076281095733.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 02:37:59] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:37:59] [INFO ] Applying decomposition
[2024-06-03 02:37:59] [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/graph11353931006983793304.txt' '-o' '/tmp/graph11353931006983793304.bin' '-w' '/tmp/graph11353931006983793304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11353931006983793304.bin' '-l' '-1' '-v' '-w' '/tmp/graph11353931006983793304.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:37:59] [INFO ] Decomposing Gal with order
[2024-06-03 02:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:37:59] [INFO ] Removed a total of 622 redundant transitions.
[2024-06-03 02:37:59] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 5 ms.
[2024-06-03 02:37:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12710507761828621193.gal : 3 ms
[2024-06-03 02:37:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6630958300897554837.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/CTLCardinality12710507761828621193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6630958300897554837.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,6.08538e+11,2.19071,49068,1928,139,92784,2593,578,213968,112,9856,0


Converting to forward existential form...Done !
original formula: A(AX(EX((i4.u20.p95==1))) U AF((i4.u32.p139==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i4.u32.p139==1)))))))) * !(E(!(!(EG(!((i4.u32.p139==1))))) U (!(!(EX(!(EX((i4.u20.p95==...208
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t126, i0.i3.u55.t18, i0.i3.u55.t19, i1.i1.u53.t20, i1.i1.u53.t236, i2.t152, i2.t150...984
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 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
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 SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 221 transition count 377
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 188 transition count 371
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 185 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 184 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 78 place count 184 transition count 362
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 94 place count 176 transition count 362
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 120 place count 150 transition count 331
Iterating global reduction 4 with 26 rules applied. Total rules applied 146 place count 150 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 146 place count 150 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 148 transition count 329
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 209 place count 117 transition count 301
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 115 transition count 297
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 115 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 216 place count 115 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 222 place count 112 transition count 291
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 112 transition count 291
Applied a total of 223 rules in 45 ms. Remains 112 /224 variables (removed 112) and now considering 291/413 (removed 122) transitions.
[2024-06-03 02:38:29] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
// Phase 1: matrix 290 rows 112 cols
[2024-06-03 02:38:29] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 02:38:29] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-03 02:38:29] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-03 02:38:29] [INFO ] Invariant cache hit.
[2024-06-03 02:38:29] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-06-03 02:38:29] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-03 02:38:29] [INFO ] Redundant transitions in 59 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-03 02:38:29] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-03 02:38:29] [INFO ] Invariant cache hit.
[2024-06-03 02:38:29] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-03 02:38:32] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-03 02:38:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-03 02:38:32] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-03 02:38:32] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-03 02:38:33] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-03 02:38:33] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-03 02:38:33] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-03 02:38:33] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 289/401 variables, 112/139 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 127/266 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/402 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-03 02:38:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 0/402 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 268 constraints, problems are : Problem set: 0 solved, 289 unsolved in 20625 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 289/401 variables, 112/140 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 127/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 289/556 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/402 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 0/402 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 557 constraints, problems are : Problem set: 0 solved, 289 unsolved in 27460 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints]
After SMT, in 48584ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48589ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/224 places, 291/413 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49201 ms. Remains : 112/224 places, 291/413 transitions.
[2024-06-03 02:39:18] [INFO ] Flatten gal took : 14 ms
[2024-06-03 02:39:18] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:39:18] [INFO ] Input system was already deterministic with 291 transitions.
[2024-06-03 02:39:18] [INFO ] Flatten gal took : 9 ms
[2024-06-03 02:39:18] [INFO ] Flatten gal took : 9 ms
[2024-06-03 02:39:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14842222397667547906.gal : 2 ms
[2024-06-03 02:39:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6500647090658354562.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/CTLCardinality14842222397667547906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6500647090658354562.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,6.07429e+09,9.51999,212588,2,21174,5,817520,6,0,732,726679,0


Converting to forward existential form...Done !
original formula: EF((EG(((p206==0)&&(p0==1))) + (((p55==1) * (!(E(((p260==0)||(p258==1)) U (p235==1))) + A(A((p59==0) U ((p77==0)||(p139==1))) U AG((p132=...199
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((p206==0)&&(p0==1)))] != FALSE + ([FwdG((FwdU(Init,TRUE) * ((p55==1) * (!(E(((p260==0)||...757
Hit Full ! (commute/partial/dont) 277/14/14
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t9, t11, t13, t14, t17, t18, t19, t21, t24, t25, t26, t27, t28, t30, t33,...581
Detected timeout of ITS tools.
[2024-06-03 02:39:48] [INFO ] Flatten gal took : 9 ms
[2024-06-03 02:39:48] [INFO ] Applying decomposition
[2024-06-03 02:39:48] [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/graph7676647676646704399.txt' '-o' '/tmp/graph7676647676646704399.bin' '-w' '/tmp/graph7676647676646704399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7676647676646704399.bin' '-l' '-1' '-v' '-w' '/tmp/graph7676647676646704399.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:39:48] [INFO ] Decomposing Gal with order
[2024-06-03 02:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:39:48] [INFO ] Removed a total of 661 redundant transitions.
[2024-06-03 02:39:48] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2024-06-03 02:39:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14372112284904475153.gal : 3 ms
[2024-06-03 02:39:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality2800715254018417013.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/CTLCardinality14372112284904475153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2800715254018417013.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,6.07429e+09,0.146576,8380,566,51,9266,303,463,17278,76,949,0


Converting to forward existential form...Done !
original formula: EF((EG(((i4.u22.p206==0)&&(i6.u34.p0==1))) + (((i0.u4.p55==1) * (!(E(((i6.u29.p260==0)||(i6.u29.p258==1)) U (i5.u25.p235==1))) + A(A((i1....280
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((i4.u22.p206==0)&&(i6.u34.p0==1)))] != FALSE + ([FwdG((FwdU(Init,TRUE) * ((i0.u4.p55==1)...971
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Reverse transition relation is NOT exact ! Due to transitions t86, t90, t109, t111, t121, t123, t140, t142, t144, t146, t182, t183, t194, t198, i0.t80, i0....764
(forward)formula 0,1,14.4839,297432,1,0,459883,1135,3466,1.14739e+06,386,4934,423741
FORMULA MedleyA-PT-19-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 192 transition count 376
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 192 transition count 376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 191 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 191 transition count 374
Applied a total of 66 rules in 7 ms. Remains 191 /224 variables (removed 33) and now considering 374/413 (removed 39) transitions.
// Phase 1: matrix 374 rows 191 cols
[2024-06-03 02:40:03] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:40:03] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-03 02:40:03] [INFO ] Invariant cache hit.
[2024-06-03 02:40:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-06-03 02:40:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 3 ms to minimize.
[2024-06-03 02:40:10] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-03 02:40:11] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 5 ms to minimize.
[2024-06-03 02:40:11] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-03 02:40:11] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-06-03 02:40:12] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-03 02:40:12] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 5 ms to minimize.
[2024-06-03 02:40:12] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:40:12] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-03 02:40:12] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/227 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-06-03 02:40:21] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
[2024-06-03 02:40:21] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 3 ms to minimize.
[2024-06-03 02:40:21] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 3 ms to minimize.
[2024-06-03 02:40:21] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-03 02:40:22] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-06-03 02:40:32] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:40:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 234 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/234 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 373/607 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-06-03 02:40:45] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:40:48] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-06-03 02:40:49] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 373 unsolved
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 Int declared 565/565 variables, and 610 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 24/24 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 191/224 places, 374/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60975 ms. Remains : 191/224 places, 374/413 transitions.
[2024-06-03 02:41:04] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:41:04] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:41:04] [INFO ] Input system was already deterministic with 374 transitions.
[2024-06-03 02:41:04] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:41:04] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:41:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality10523836014706618488.gal : 3 ms
[2024-06-03 02:41:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8864495957335037428.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/CTLCardinality10523836014706618488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8864495957335037428.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 02:41:34] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:41:34] [INFO ] Applying decomposition
[2024-06-03 02:41:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14422416325590205539.txt' '-o' '/tmp/graph14422416325590205539.bin' '-w' '/tmp/graph14422416325590205539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14422416325590205539.bin' '-l' '-1' '-v' '-w' '/tmp/graph14422416325590205539.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:41:34] [INFO ] Decomposing Gal with order
[2024-06-03 02:41:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:41:34] [INFO ] Removed a total of 681 redundant transitions.
[2024-06-03 02:41:34] [INFO ] Flatten gal took : 31 ms
[2024-06-03 02:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2024-06-03 02:41:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality15766644567090190311.gal : 4 ms
[2024-06-03 02:41:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6894145032890339472.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/CTLCardinality15766644567090190311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6894145032890339472.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,6.68724e+11,1.06265,30248,1901,59,57072,687,573,113646,69,3228,0


Converting to forward existential form...Done !
original formula: AG(AX(((AG((E((i6.u22.p98==0) U ((i0.i1.u9.p35==0)||(i0.i0.u62.p259==1))) + ((i9.i1.u56.p236==1)&&((i2.u7.p39==0)||(i5.u27.p118==1))))) *...314
=> equivalent forward existential formula: (([((FwdU(EY(FwdU(Init,TRUE)),TRUE) * !(((i9.i1.u56.p236==1)&&((i2.u7.p39==0)||(i5.u27.p118==1))))) * !(E((i6.u2...530
Reverse transition relation is NOT exact ! Due to transitions t148, i0.t146, i0.t141, i0.i0.u3.t170, i0.i0.u57.t20, i0.i0.u57.t243, i0.i1.t132, i0.i1.t133,...1052
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 220 transition count 376
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 187 transition count 370
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 184 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 182 transition count 368
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 80 place count 182 transition count 360
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 96 place count 174 transition count 360
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 124 place count 146 transition count 324
Iterating global reduction 4 with 28 rules applied. Total rules applied 152 place count 146 transition count 324
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 152 place count 146 transition count 321
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 143 transition count 321
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 214 place count 114 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 112 transition count 290
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 112 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 112 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 225 place count 110 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 108 transition count 283
Applied a total of 227 rules in 44 ms. Remains 108 /224 variables (removed 116) and now considering 283/413 (removed 130) transitions.
[2024-06-03 02:42:04] [INFO ] Flow matrix only has 282 transitions (discarded 1 similar events)
// Phase 1: matrix 282 rows 108 cols
[2024-06-03 02:42:04] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 02:42:04] [INFO ] Implicit Places using invariants in 100 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/224 places, 283/413 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 163 ms. Remains : 107/224 places, 283/413 transitions.
[2024-06-03 02:42:04] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:42:04] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:42:04] [INFO ] Input system was already deterministic with 283 transitions.
[2024-06-03 02:42:04] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:42:04] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:42:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8400939757532092030.gal : 2 ms
[2024-06-03 02:42:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2749262748900206918.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/CTLCardinality8400939757532092030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2749262748900206918.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,5.27131e+09,12.7288,261952,2,12300,5,973260,6,0,704,847699,0


Converting to forward existential form...Done !
original formula: (EF((((p86==0)||(p14==1))&&(p255==1))) * E(((p84==0)||(p263==1)) U AF((EF((((p66==0)||(p154==1))&&(p220==1))) * ((p114==0)||(p210==1)))))...156
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((p86==0)||(p14==1))&&(p255==1)))),((p84==0)||(p263==1))) * !(EG(!((E(TRUE U (((p66==0)...220
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t14, t21, t22, t23, t24, t29, t30, t31, t33, t34, t37, t41, t43, t44, t45...330
Detected timeout of ITS tools.
[2024-06-03 02:42:34] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:42:34] [INFO ] Applying decomposition
[2024-06-03 02:42:34] [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/graph5927511015557675628.txt' '-o' '/tmp/graph5927511015557675628.bin' '-w' '/tmp/graph5927511015557675628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5927511015557675628.bin' '-l' '-1' '-v' '-w' '/tmp/graph5927511015557675628.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:42:34] [INFO ] Decomposing Gal with order
[2024-06-03 02:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:42:34] [INFO ] Removed a total of 556 redundant transitions.
[2024-06-03 02:42:34] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 3 ms.
[2024-06-03 02:42:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2214991743535219183.gal : 2 ms
[2024-06-03 02:42:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15636089788950297317.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/CTLCardinality2214991743535219183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15636089788950297317.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,5.27131e+09,0.302073,9452,276,177,8252,2343,319,26030,136,16571,0


Converting to forward existential form...Done !
original formula: (EF((((i5.u14.p86==0)||(i0.u1.p14==1))&&(u22.p255==1))) * E(((i5.u14.p84==0)||(i3.u25.p263==1)) U AF((EF((((i0.u8.p66==0)||(i5.u14.p154==...220
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((i5.u14.p86==0)||(i0.u1.p14==1))&&(u22.p255==1)))),((i5.u14.p84==0)||(i3.u25.p263==1))...284
Reverse transition relation is NOT exact ! Due to transitions t84, i0.t189, i0.u7.t55, i0.u19.t22, i1.t70, i1.t1, i1.u2.t69, i1.u6.t67, i2.t46, i2.t3, i2.u...528
Detected timeout of ITS tools.
[2024-06-03 02:43:04] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:43:04] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:43:04] [INFO ] Applying decomposition
[2024-06-03 02:43:05] [INFO ] Flatten gal took : 11 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/graph14299476123667397837.txt' '-o' '/tmp/graph14299476123667397837.bin' '-w' '/tmp/graph14299476123667397837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14299476123667397837.bin' '-l' '-1' '-v' '-w' '/tmp/graph14299476123667397837.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:43:05] [INFO ] Decomposing Gal with order
[2024-06-03 02:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:43:05] [INFO ] Removed a total of 659 redundant transitions.
[2024-06-03 02:43:05] [INFO ] Flatten gal took : 24 ms
[2024-06-03 02:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2024-06-03 02:43:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality125152449913358699.gal : 4 ms
[2024-06-03 02:43:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality844478108814019325.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/CTLCardinality125152449913358699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality844478108814019325.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 -...260
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,4.98847e+12,9.30492,202844,5446,980,280034,17320,712,1.19952e+06,194,135719,0


Converting to forward existential form...Done !
original formula: E(AX(!(((A(A(((i3.u11.p43==0)||(i7.u43.p189==1)) U (i0.i0.u0.p0==1)) U ((i3.u9.p38==1)||(i2.u5.p25==0))) + EX(((i3.u12.p49==0)||(i4.u32.p...221
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((!((E(!(((i3.u9.p38==1)||(i2.u5.p25==0))) U (!(!((E(!((i0.i0.u0.p0==1)) U (!(((i3.u11.p43=...433
Reverse transition relation is NOT exact ! Due to transitions i0.i3.t20, i0.i3.u57.t10, i0.i3.u58.t18, i1.u3.t209, i1.u6.t204, i2.t212, i2.t180, i2.t171, i...1795
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
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,588.011,2738192,1,0,2.8359e+06,375663,1973,1.25029e+07,519,2.56212e+06,1219942
FORMULA MedleyA-PT-19-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-06-03 03:10:18] [INFO ] Applying decomposition
[2024-06-03 03:10:18] [INFO ] Flatten gal took : 12 ms
[2024-06-03 03:10:18] [INFO ] Decomposing Gal with order
[2024-06-03 03:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:10:18] [INFO ] Removed a total of 601 redundant transitions.
[2024-06-03 03:10:18] [INFO ] Flatten gal took : 23 ms
[2024-06-03 03:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 6 ms.
[2024-06-03 03:10:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17091282946939861370.gal : 4 ms
[2024-06-03 03:10:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15470230838753473787.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/CTLCardinality17091282946939861370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15470230838753473787.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.98847e+12,15.2202,416804,3947,938,761100,14510,619,3.0259e+06,236,182597,0


Converting to forward existential form...Done !
original formula: A((A(EF(AX(((i0.i1.i1.u56.p184==0)||(i0.i0.i1.u13.p89==1)))) U ((i1.i1.u36.p263==0) * EG(((i0.i1.i1.i0.u26.p207==0)||(i1.i1.u43.p248==1))...253
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((i1.i1.i0.u42.p258!=0)))))))) * !(E(!(!(E(TRUE U !((i1.i1.i0.u42.p258!=0))))) U (!...617
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t206, i0.i0.i0.u4.t207, i0.i0.i0.u4.t208, i0.i0.i0.u4.t209, i0.i0.i0.u4.t211, i0....3013

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;