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.r136-tall-171631132600433.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 DiscoveryGPU-PT-10b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 02:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 02:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716377234950

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 11:27:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:27:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:27:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-22 11:27:16] [INFO ] Transformed 296 places.
[2024-05-22 11:27:16] [INFO ] Transformed 314 transitions.
[2024-05-22 11:27:16] [INFO ] Found NUPN structural information;
[2024-05-22 11:27:16] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 121 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 280 transition count 314
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 35 place count 261 transition count 295
Iterating global reduction 1 with 19 rules applied. Total rules applied 54 place count 261 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 257 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 257 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 255 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 255 transition count 289
Applied a total of 66 rules in 58 ms. Remains 255 /296 variables (removed 41) and now considering 289/314 (removed 25) transitions.
// Phase 1: matrix 289 rows 255 cols
[2024-05-22 11:27:16] [INFO ] Computed 2 invariants in 14 ms
[2024-05-22 11:27:16] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-22 11:27:16] [INFO ] Invariant cache hit.
[2024-05-22 11:27:16] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 11:27:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/540 variables, 251/253 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 11:27:22] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 21 ms to minimize.
[2024-05-22 11:27:22] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 4/544 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 11:27:30] [INFO ] Deduced a trap composed of 141 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 11:27:32] [INFO ] Deduced a trap composed of 127 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/544 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 280 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23923 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/540 variables, 251/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 284/560 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 4/544 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 4/568 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 11:27:52] [INFO ] Deduced a trap composed of 161 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 569 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 24/24 constraints]
After SMT, in 54141ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54156ms
Starting structural reductions in LTL mode, iteration 1 : 255/296 places, 289/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54700 ms. Remains : 255/296 places, 289/314 transitions.
Support contains 121 out of 255 places after structural reductions.
[2024-05-22 11:28:11] [INFO ] Flatten gal took : 42 ms
[2024-05-22 11:28:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:28:11] [INFO ] Flatten gal took : 17 ms
[2024-05-22 11:28:11] [INFO ] Input system was already deterministic with 289 transitions.
Support contains 103 out of 255 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (120 resets) in 1209 ms. (33 steps per ms) remains 1/79 properties
BEST_FIRST walk for 15017 steps (6 resets) in 64 ms. (231 steps per ms) remains 0/1 properties
[2024-05-22 11:28:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:28:11] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:28:11] [INFO ] Input system was already deterministic with 289 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 470 edges and 255 vertex of which 240 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 289
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 217 transition count 254
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 217 transition count 254
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 82 place count 208 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 91 place count 208 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 200 transition count 235
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 200 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 193 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 187 transition count 218
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 187 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 184 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 184 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 181 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 181 transition count 212
Applied a total of 145 rules in 28 ms. Remains 181 /255 variables (removed 74) and now considering 212/289 (removed 77) transitions.
// Phase 1: matrix 212 rows 181 cols
[2024-05-22 11:28:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:28:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 11:28:12] [INFO ] Invariant cache hit.
[2024-05-22 11:28:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-22 11:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 5 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:28:15] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:28:16] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 1/393 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 203 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 210/412 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 414 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 20/20 constraints]
After SMT, in 22759ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 22764ms
Starting structural reductions in LTL mode, iteration 1 : 181/255 places, 212/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22983 ms. Remains : 181/255 places, 212/289 transitions.
[2024-05-22 11:28:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:28:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:28:34] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-22 11:28:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:28:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:28:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2703223886232257558.gal : 4 ms
[2024-05-22 11:28:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2879103504931283455.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/CTLCardinality2703223886232257558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2879103504931283455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 33 place count 222 transition count 260
Iterating global reduction 1 with 29 rules applied. Total rules applied 62 place count 222 transition count 260
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 212 transition count 250
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 212 transition count 250
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 204 transition count 239
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 204 transition count 239
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 196 transition count 230
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 196 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 191 transition count 223
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 191 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 188 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 188 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 186 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 186 transition count 218
Applied a total of 134 rules in 33 ms. Remains 186 /255 variables (removed 69) and now considering 218/289 (removed 71) transitions.
// Phase 1: matrix 218 rows 186 cols
[2024-05-22 11:29:35] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 11:29:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 11:29:35] [INFO ] Invariant cache hit.
[2024-05-22 11:29:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-22 11:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/404 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 3 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 17/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 205 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/404 variables, 186/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 217/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 422 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 17/17 constraints]
After SMT, in 17918ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 17923ms
Starting structural reductions in LTL mode, iteration 1 : 186/255 places, 218/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18160 ms. Remains : 186/255 places, 218/289 transitions.
[2024-05-22 11:29:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:29:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:29:53] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-22 11:29:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:29:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:29:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality11908204894092569294.gal : 2 ms
[2024-05-22 11:29:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11319735420694476266.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/CTLCardinality11908204894092569294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11319735420694476266.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 36 place count 219 transition count 257
Iterating global reduction 1 with 32 rules applied. Total rules applied 68 place count 219 transition count 257
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 77 place count 210 transition count 248
Iterating global reduction 1 with 9 rules applied. Total rules applied 86 place count 210 transition count 248
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 203 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 203 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 199 transition count 235
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 199 transition count 235
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 195 transition count 229
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 195 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 192 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 192 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 190 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 190 transition count 224
Applied a total of 126 rules in 28 ms. Remains 190 /255 variables (removed 65) and now considering 224/289 (removed 65) transitions.
// Phase 1: matrix 224 rows 190 cols
[2024-05-22 11:30:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:30:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 11:30:53] [INFO ] Invariant cache hit.
[2024-05-22 11:30:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-22 11:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/414 variables, 190/192 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:30:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:30:58] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 15/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/414 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 207 constraints, problems are : Problem set: 0 solved, 223 unsolved in 8888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/414 variables, 190/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 223/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 430 constraints, problems are : Problem set: 0 solved, 223 unsolved in 10455 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 15/15 constraints]
After SMT, in 19408ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 19411ms
Starting structural reductions in LTL mode, iteration 1 : 190/255 places, 224/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19609 ms. Remains : 190/255 places, 224/289 transitions.
[2024-05-22 11:31:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:31:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:31:13] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-22 11:31:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:31:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:31:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13855183525118665473.gal : 1 ms
[2024-05-22 11:31:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10959534908046946042.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/CTLCardinality13855183525118665473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10959534908046946042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 212 transition count 250
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 212 transition count 250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 92 place count 202 transition count 240
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 202 transition count 240
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 193 transition count 228
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 193 transition count 228
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 129 place count 184 transition count 217
Iterating global reduction 1 with 9 rules applied. Total rules applied 138 place count 184 transition count 217
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 147 place count 175 transition count 204
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 175 transition count 204
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 162 place count 169 transition count 198
Iterating global reduction 1 with 6 rules applied. Total rules applied 168 place count 169 transition count 198
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 172 place count 165 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 176 place count 165 transition count 194
Applied a total of 176 rules in 17 ms. Remains 165 /255 variables (removed 90) and now considering 194/289 (removed 95) transitions.
// Phase 1: matrix 194 rows 165 cols
[2024-05-22 11:32:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:32:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:32:13] [INFO ] Invariant cache hit.
[2024-05-22 11:32:13] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-22 11:32:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 187 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 380 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7522 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
After SMT, in 13810ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 13812ms
Starting structural reductions in LTL mode, iteration 1 : 165/255 places, 194/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14001 ms. Remains : 165/255 places, 194/289 transitions.
[2024-05-22 11:32:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:32:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:32:27] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-22 11:32:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:32:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:32:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8220988799616099490.gal : 1 ms
[2024-05-22 11:32:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5101998353822673789.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/CTLCardinality8220988799616099490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5101998353822673789.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 216 transition count 254
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 216 transition count 254
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 83 place count 207 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 92 place count 207 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 199 transition count 234
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 199 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 191 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 191 transition count 224
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 132 place count 183 transition count 213
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 183 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 178 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 150 place count 178 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 153 place count 175 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 156 place count 175 transition count 205
Applied a total of 156 rules in 13 ms. Remains 175 /255 variables (removed 80) and now considering 205/289 (removed 84) transitions.
// Phase 1: matrix 205 rows 175 cols
[2024-05-22 11:33:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:33:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:33:27] [INFO ] Invariant cache hit.
[2024-05-22 11:33:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-22 11:33:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 205/380 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-22 11:33:30] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:33:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:33:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:33:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 197 constraints, problems are : Problem set: 0 solved, 204 unsolved in 6813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/380 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 204/401 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 401 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 20/20 constraints]
After SMT, in 15376ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 15378ms
Starting structural reductions in LTL mode, iteration 1 : 175/255 places, 205/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15562 ms. Remains : 175/255 places, 205/289 transitions.
[2024-05-22 11:33:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:33:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:33:43] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-22 11:33:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:33:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:33:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12437079049915919193.gal : 2 ms
[2024-05-22 11:33:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1360555162767886377.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/CTLCardinality12437079049915919193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1360555162767886377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 213 transition count 251
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 213 transition count 251
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 204 transition count 242
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 204 transition count 242
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 196 transition count 232
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 196 transition count 232
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 189 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 189 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 182 transition count 213
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 182 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 177 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 177 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 156 place count 173 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 160 place count 173 transition count 204
Applied a total of 160 rules in 21 ms. Remains 173 /255 variables (removed 82) and now considering 204/289 (removed 85) transitions.
// Phase 1: matrix 204 rows 173 cols
[2024-05-22 11:34:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:34:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 11:34:43] [INFO ] Invariant cache hit.
[2024-05-22 11:34:43] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 11:34:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/377 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:34:46] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 19/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 194 constraints, problems are : Problem set: 0 solved, 203 unsolved in 7840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/377 variables, 173/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 203/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 397 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 19/19 constraints]
After SMT, in 15997ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 16000ms
Starting structural reductions in LTL mode, iteration 1 : 173/255 places, 204/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16223 ms. Remains : 173/255 places, 204/289 transitions.
[2024-05-22 11:34:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:34:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:34:59] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-22 11:34:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:34:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:34:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5514269329402600245.gal : 1 ms
[2024-05-22 11:34:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15049307753820953665.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/CTLCardinality5514269329402600245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15049307753820953665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 213 transition count 251
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 213 transition count 251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 203 transition count 241
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 203 transition count 241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 194 transition count 229
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 194 transition count 229
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 127 place count 185 transition count 218
Iterating global reduction 1 with 9 rules applied. Total rules applied 136 place count 185 transition count 218
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 176 transition count 205
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 176 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 160 place count 170 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 170 transition count 199
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 170 place count 166 transition count 195
Iterating global reduction 1 with 4 rules applied. Total rules applied 174 place count 166 transition count 195
Applied a total of 174 rules in 21 ms. Remains 166 /255 variables (removed 89) and now considering 195/289 (removed 94) transitions.
// Phase 1: matrix 195 rows 166 cols
[2024-05-22 11:36:00] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 11:36:00] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 11:36:00] [INFO ] Invariant cache hit.
[2024-05-22 11:36:00] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-22 11:36:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/361 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-22 11:36:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:36:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:36:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:36:03] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 19/187 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 187 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/361 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 194/381 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 381 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 19/19 constraints]
After SMT, in 14342ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 14344ms
Starting structural reductions in LTL mode, iteration 1 : 166/255 places, 195/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14514 ms. Remains : 166/255 places, 195/289 transitions.
[2024-05-22 11:36:14] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:36:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:36:14] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-22 11:36:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:36:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:36:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15025795116473072430.gal : 1 ms
[2024-05-22 11:36:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1138857499303158652.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/CTLCardinality15025795116473072430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1138857499303158652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Graph (complete) has 470 edges and 255 vertex of which 240 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 239 transition count 233
Reduce places removed 44 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 49 rules applied. Total rules applied 94 place count 195 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 190 transition count 228
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 99 place count 190 transition count 210
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 135 place count 172 transition count 210
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 146 place count 161 transition count 199
Iterating global reduction 3 with 11 rules applied. Total rules applied 157 place count 161 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 157 place count 161 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 160 transition count 198
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 166 place count 153 transition count 191
Iterating global reduction 3 with 7 rules applied. Total rules applied 173 place count 153 transition count 191
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 148 transition count 186
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 148 transition count 186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 143 transition count 176
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 143 transition count 176
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 138 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 138 transition count 171
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 253 place count 113 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 111 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 111 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 109 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 109 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 108 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 108 transition count 139
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 108 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 106 transition count 137
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 276 place count 105 transition count 129
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 285 place count 97 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 96 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 286 place count 96 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 290 place count 94 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 292 place count 93 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 294 place count 93 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 296 place count 92 transition count 122
Applied a total of 296 rules in 110 ms. Remains 92 /255 variables (removed 163) and now considering 122/289 (removed 167) transitions.
// Phase 1: matrix 122 rows 92 cols
[2024-05-22 11:37:14] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:37:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 11:37:14] [INFO ] Invariant cache hit.
[2024-05-22 11:37:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-22 11:37:15] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-22 11:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 122/204 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 10/214 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 11:37:16] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 94 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 122/204 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 10/214 variables, 10/205 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 206 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 4587ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 4588ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/255 places, 122/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4820 ms. Remains : 92/255 places, 122/289 transitions.
[2024-05-22 11:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:37:19] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 11:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:37:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16355461699021484622.gal : 1 ms
[2024-05-22 11:37:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5479180399056917261.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/CTLCardinality16355461699021484622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5479180399056917261.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,3.21377e+10,2.17974,74140,2,22739,5,365227,6,0,474,323087,0


Converting to forward existential form...Done !
original formula: A(((p168==0) + EF(!(EG(A((p179==1) U (p65==1)))))) U (!(((!((p46==0)||(p265==1)))&&(p53==0))) * EG(A(EG(((p191==0)||(p220==1))) U (p286==...161
=> equivalent forward existential formula: [((Init * !(EG(!((!(((!((p46==0)||(p265==1)))&&(p53==0))) * EG(!((E(!((p286==0)) U (!(EG(((p191==0)||(p220==1)))...608
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t11, t13, t14, t16, t19, t20, t21, t22, t24, t25, t27, t29, t30, t32, t34...381
Detected timeout of ITS tools.
[2024-05-22 11:37:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:37:49] [INFO ] Applying decomposition
[2024-05-22 11:37:49] [INFO ] Flatten gal took : 2 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/graph10256817942571195564.txt' '-o' '/tmp/graph10256817942571195564.bin' '-w' '/tmp/graph10256817942571195564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10256817942571195564.bin' '-l' '-1' '-v' '-w' '/tmp/graph10256817942571195564.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:37:49] [INFO ] Decomposing Gal with order
[2024-05-22 11:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:37:49] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 11:37:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:37:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 1 ms.
[2024-05-22 11:37:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6567110609111674145.gal : 2 ms
[2024-05-22 11:37:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16807392309707340786.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/CTLCardinality6567110609111674145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16807392309707340786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21377e+10,1.47803,61636,3384,107,94547,929,280,453805,39,5726,0


Converting to forward existential form...Done !
original formula: A(((i5.u18.p168==0) + EF(!(EG(A((i6.u19.p179==1) U (i11.u9.p65==1)))))) U (!(((!((i1.u3.p46==0)||(i10.u30.p265==1)))&&(i2.u5.p53==0))) * ...224
=> equivalent forward existential formula: [((Init * !(EG(!((!(((!((i1.u3.p46==0)||(i10.u30.p265==1)))&&(i2.u5.p53==0))) * EG(!((E(!((i11.u33.p286==0)) U (...817
Reverse transition relation is NOT exact ! Due to transitions t83, t110, t113, t118, t120, t121, i0.u0.t50, i0.u1.t48, i0.u2.t51, i1.u4.t45, i2.u6.t46, i3....618
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 216 transition count 254
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 216 transition count 254
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 84 place count 206 transition count 244
Iterating global reduction 1 with 10 rules applied. Total rules applied 94 place count 206 transition count 244
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 103 place count 197 transition count 232
Iterating global reduction 1 with 9 rules applied. Total rules applied 112 place count 197 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 188 transition count 221
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 188 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 139 place count 179 transition count 208
Iterating global reduction 1 with 9 rules applied. Total rules applied 148 place count 179 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 173 transition count 202
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 173 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 164 place count 169 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 168 place count 169 transition count 198
Applied a total of 168 rules in 20 ms. Remains 169 /255 variables (removed 86) and now considering 198/289 (removed 91) transitions.
// Phase 1: matrix 198 rows 169 cols
[2024-05-22 11:38:19] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 11:38:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:38:19] [INFO ] Invariant cache hit.
[2024-05-22 11:38:19] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-22 11:38:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/367 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/367 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 184 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/367 variables, 169/184 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 197/381 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/367 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 381 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 13/13 constraints]
After SMT, in 14167ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 14169ms
Starting structural reductions in LTL mode, iteration 1 : 169/255 places, 198/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14345 ms. Remains : 169/255 places, 198/289 transitions.
[2024-05-22 11:38:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:38:34] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-22 11:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17541547517754409540.gal : 1 ms
[2024-05-22 11:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15317499730379661976.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/CTLCardinality17541547517754409540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15317499730379661976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Graph (complete) has 470 edges and 255 vertex of which 241 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 240 transition count 229
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 191 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 189 transition count 227
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 103 place count 189 transition count 210
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 137 place count 172 transition count 210
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 150 place count 159 transition count 197
Iterating global reduction 3 with 13 rules applied. Total rules applied 163 place count 159 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 163 place count 159 transition count 195
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 157 transition count 195
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 149 transition count 187
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 149 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 143 transition count 180
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 143 transition count 180
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 201 place count 137 transition count 169
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 137 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 212 place count 132 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 217 place count 132 transition count 164
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 259 place count 111 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 109 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 109 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 107 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 107 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 106 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 106 transition count 136
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 106 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 104 transition count 134
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 130 edges and 102 vertex of which 98 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 95 edges and 98 vertex of which 36 / 98 are part of one of the 18 SCC in 2 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 3 with 30 rules applied. Total rules applied 303 place count 80 transition count 103
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 48 rules applied. Total rules applied 351 place count 54 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 354 place count 51 transition count 81
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 362 place count 43 transition count 65
Iterating global reduction 6 with 8 rules applied. Total rules applied 370 place count 43 transition count 65
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 377 place count 36 transition count 51
Iterating global reduction 6 with 7 rules applied. Total rules applied 384 place count 36 transition count 51
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 389 place count 31 transition count 41
Iterating global reduction 6 with 5 rules applied. Total rules applied 394 place count 31 transition count 41
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 398 place count 27 transition count 37
Iterating global reduction 6 with 4 rules applied. Total rules applied 402 place count 27 transition count 37
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 6 with 6 rules applied. Total rules applied 408 place count 24 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 410 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 411 place count 23 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 413 place count 22 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 414 place count 21 transition count 30
Applied a total of 414 rules in 56 ms. Remains 21 /255 variables (removed 234) and now considering 30/289 (removed 259) transitions.
[2024-05-22 11:39:34] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 21 cols
[2024-05-22 11:39:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:39:34] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 11:39:34] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-22 11:39:34] [INFO ] Invariant cache hit.
[2024-05-22 11:39:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 11:39:34] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-22 11:39:34] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-22 11:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 3/46 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 21 constraints, problems are : Problem set: 0 solved, 25 unsolved in 137 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 3/46 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 46 constraints, problems are : Problem set: 0 solved, 25 unsolved in 129 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 271ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/255 places, 30/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 365 ms. Remains : 21/255 places, 30/289 transitions.
[2024-05-22 11:39:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:34] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-22 11:39:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11153534767260829831.gal : 1 ms
[2024-05-22 11:39:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11234786451901730822.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/CTLCardinality11153534767260829831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11234786451901730822.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25055,0.011083,3776,2,157,5,2315,6,0,108,2628,0


Converting to forward existential form...Done !
original formula: EG((AF((AG(((p199==0)&&(p254==1))) + AG(((p195==0)&&(p56==1))))) + (((p82==0)&&(p5==0))&&(p46==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((!(E(TRUE U !(((p199==0)&&(p254==1))))) + !(E(TRUE U !(((p195==0)&&(p56==1))))))))) + (((p82=...191
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t21, t22, t24, t27, t28, t29, Intersection with reachable at each step enabled....202
(forward)formula 0,0,0.072181,6680,1,0,152,17305,87,83,631,22293,189
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 251 transition count 289
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 213 transition count 251
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 213 transition count 251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 203 transition count 241
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 203 transition count 241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 194 transition count 229
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 194 transition count 229
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 186 transition count 219
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 186 transition count 219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 178 transition count 207
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 178 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 172 transition count 201
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 172 transition count 201
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 168 transition count 197
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 168 transition count 197
Applied a total of 170 rules in 16 ms. Remains 168 /255 variables (removed 87) and now considering 197/289 (removed 92) transitions.
// Phase 1: matrix 197 rows 168 cols
[2024-05-22 11:39:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:39:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:39:34] [INFO ] Invariant cache hit.
[2024-05-22 11:39:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:39:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/365 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:39:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2024-05-22 11:39:38] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 17/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 187 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/365 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 196/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 383 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 14513ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14515ms
Starting structural reductions in LTL mode, iteration 1 : 168/255 places, 197/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14686 ms. Remains : 168/255 places, 197/289 transitions.
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:39:49] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:39:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12452525917050548682.gal : 1 ms
[2024-05-22 11:39:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10576167712235483599.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/CTLCardinality12452525917050548682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10576167712235483599.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Graph (complete) has 470 edges and 255 vertex of which 244 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 243 transition count 233
Reduce places removed 46 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 98 place count 197 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 192 transition count 228
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 103 place count 192 transition count 210
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 139 place count 174 transition count 210
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 150 place count 163 transition count 199
Iterating global reduction 3 with 11 rules applied. Total rules applied 161 place count 163 transition count 199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 161 place count 163 transition count 197
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 161 transition count 197
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 156 transition count 192
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 156 transition count 192
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 151 transition count 185
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 151 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 147 transition count 179
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 147 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 145 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 145 transition count 177
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 241 place count 123 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 121 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 121 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 119 transition count 149
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 119 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 118 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 118 transition count 148
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 118 transition count 148
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 116 transition count 146
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 141 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 102 edges and 110 vertex of which 34 / 110 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 287 place count 93 transition count 114
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 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 4 with 47 rules applied. Total rules applied 334 place count 66 transition count 94
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 338 place count 64 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 340 place count 62 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 340 place count 62 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 342 place count 61 transition count 91
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 347 place count 56 transition count 81
Iterating global reduction 7 with 5 rules applied. Total rules applied 352 place count 56 transition count 81
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 356 place count 52 transition count 73
Iterating global reduction 7 with 4 rules applied. Total rules applied 360 place count 52 transition count 73
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 364 place count 48 transition count 65
Iterating global reduction 7 with 4 rules applied. Total rules applied 368 place count 48 transition count 65
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 372 place count 44 transition count 61
Iterating global reduction 7 with 4 rules applied. Total rules applied 376 place count 44 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 384 place count 40 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 386 place count 39 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 388 place count 39 transition count 54
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 7 with 1 rules applied. Total rules applied 389 place count 39 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 390 place count 38 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 391 place count 37 transition count 52
Applied a total of 391 rules in 34 ms. Remains 37 /255 variables (removed 218) and now considering 52/289 (removed 237) transitions.
[2024-05-22 11:40:49] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 37 cols
[2024-05-22 11:40:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:40:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:40:49] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-22 11:40:49] [INFO ] Invariant cache hit.
[2024-05-22 11:40:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-22 11:40:49] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-22 11:40:49] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-22 11:40:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 44/76 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 5/81 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/82 variables, and 37 constraints, problems are : Problem set: 0 solved, 47 unsolved in 358 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 44/76 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 37/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 5/81 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/82 variables, and 84 constraints, problems are : Problem set: 0 solved, 47 unsolved in 348 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 720ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/255 places, 52/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 824 ms. Remains : 37/255 places, 52/289 transitions.
[2024-05-22 11:40:50] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:40:50] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:50] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 11:40:50] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:50] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7560989028489996535.gal : 0 ms
[2024-05-22 11:40:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality15953663667262885831.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/CTLCardinality7560989028489996535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15953663667262885831.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,408336,0.006448,3580,2,97,5,594,6,0,180,580,0


Converting to forward existential form...Done !
original formula: E(((p18==0)||(p12==1)) U (E((((p5==1) * AG(((p257==0)||(p153==1)))) * AF(((p130==0)||(p33==1)))) U ((p159==0)||(p132==1))) * AF((EF((p56=...174
=> equivalent forward existential formula: [((FwdU(Init,((p18==0)||(p12==1))) * E((((p5==1) * !(E(TRUE U !(((p257==0)||(p153==1)))))) * !(EG(!(((p130==0)||...250
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t11, t16, t17, t25, t43, t46, t48, Intersection with reachable at each step enabled....202
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 48/0/4
(forward)formula 0,1,0.137218,10500,1,0,357,37732,146,230,1164,60780,391
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Graph (complete) has 470 edges and 255 vertex of which 240 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 239 transition count 228
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 190 transition count 228
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 99 place count 190 transition count 210
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 135 place count 172 transition count 210
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 149 place count 158 transition count 196
Iterating global reduction 2 with 14 rules applied. Total rules applied 163 place count 158 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 163 place count 158 transition count 194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 156 transition count 194
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 175 place count 148 transition count 186
Iterating global reduction 2 with 8 rules applied. Total rules applied 183 place count 148 transition count 186
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 141 transition count 177
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 141 transition count 177
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 204 place count 134 transition count 165
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 134 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 130 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 130 transition count 161
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 263 place count 108 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 106 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 106 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 104 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 104 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 272 place count 103 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 103 transition count 132
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 103 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 101 transition count 130
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 99 vertex of which 95 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 96 edges and 95 vertex of which 38 / 95 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 30 rules applied. Total rules applied 306 place count 76 transition count 99
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 352 place count 50 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 49 transition count 79
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 361 place count 41 transition count 63
Iterating global reduction 5 with 8 rules applied. Total rules applied 369 place count 41 transition count 63
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 375 place count 35 transition count 51
Iterating global reduction 5 with 6 rules applied. Total rules applied 381 place count 35 transition count 51
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 386 place count 30 transition count 41
Iterating global reduction 5 with 5 rules applied. Total rules applied 391 place count 30 transition count 41
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 395 place count 26 transition count 37
Iterating global reduction 5 with 4 rules applied. Total rules applied 399 place count 26 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 400 place count 26 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 25 transition count 35
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 407 place count 20 transition count 30
Applied a total of 407 rules in 38 ms. Remains 20 /255 variables (removed 235) and now considering 30/289 (removed 259) transitions.
[2024-05-22 11:40:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 20 cols
[2024-05-22 11:40:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 11:40:50] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 11:40:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-22 11:40:50] [INFO ] Invariant cache hit.
[2024-05-22 11:40:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 11:40:50] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 11:40:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-22 11:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/37 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 20 constraints, problems are : Problem set: 0 solved, 19 unsolved in 155 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/37 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 6/43 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 39 constraints, problems are : Problem set: 0 solved, 19 unsolved in 96 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 254ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/255 places, 30/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 343 ms. Remains : 20/255 places, 30/289 transitions.
[2024-05-22 11:40:51] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:40:51] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:51] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-22 11:40:51] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:51] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:40:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11322522884793767514.gal : 0 ms
[2024-05-22 11:40:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13976709833908153363.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/CTLCardinality11322522884793767514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13976709833908153363.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,47130,0.005149,3456,2,116,5,565,6,0,96,624,0


Converting to forward existential form...Done !
original formula: EG(EF((((AG((p101==1)) + (p185==0)) + ((p84==0)||(p224==1))) + (p269==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(E(TRUE U !((p101==1)))) + (p185==0)) + ((p84==0)||(p224==1))) + (p269==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t13, t24, t26, t27, t28, t29, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,0.021492,4568,1,0,63,5444,82,36,564,5904,76
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 289
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 218 transition count 255
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 218 transition count 255
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 213 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 213 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 209 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 209 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 206 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 206 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 203 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 203 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 201 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 201 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 200 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 200 transition count 233
Applied a total of 107 rules in 13 ms. Remains 200 /255 variables (removed 55) and now considering 233/289 (removed 56) transitions.
// Phase 1: matrix 233 rows 200 cols
[2024-05-22 11:40:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:40:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:40:51] [INFO ] Invariant cache hit.
[2024-05-22 11:40:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-22 11:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 233/432 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 11:40:54] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:40:54] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:40:54] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:40:55] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 1/433 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 220 constraints, problems are : Problem set: 0 solved, 232 unsolved in 11102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 233/432 variables, 199/219 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 231/450 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 1/433 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 0/433 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 452 constraints, problems are : Problem set: 0 solved, 232 unsolved in 17168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 18/18 constraints]
After SMT, in 28333ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 28334ms
Starting structural reductions in LTL mode, iteration 1 : 200/255 places, 233/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28535 ms. Remains : 200/255 places, 233/289 transitions.
[2024-05-22 11:41:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:41:19] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-22 11:41:19] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:41:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4240930603632469487.gal : 7 ms
[2024-05-22 11:41:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6714144237466743972.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/CTLCardinality4240930603632469487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6714144237466743972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 289/289 transitions.
Graph (complete) has 470 edges and 255 vertex of which 240 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 239 transition count 225
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 187 transition count 225
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 105 place count 187 transition count 207
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 141 place count 169 transition count 207
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 153 place count 157 transition count 195
Iterating global reduction 2 with 12 rules applied. Total rules applied 165 place count 157 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 165 place count 157 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 155 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 148 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 148 transition count 186
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 141 transition count 177
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 141 transition count 177
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 135 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 135 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 131 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 131 transition count 163
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 265 place count 107 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 267 place count 105 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 105 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 271 place count 103 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 274 place count 102 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 102 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 277 place count 100 transition count 130
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 103 edges and 94 vertex of which 40 / 94 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 2 with 35 rules applied. Total rules applied 312 place count 74 transition count 94
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 363 place count 43 transition count 74
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 371 place count 35 transition count 58
Iterating global reduction 4 with 8 rules applied. Total rules applied 379 place count 35 transition count 58
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 387 place count 27 transition count 42
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 27 transition count 42
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 403 place count 19 transition count 26
Iterating global reduction 4 with 8 rules applied. Total rules applied 411 place count 19 transition count 26
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 419 place count 11 transition count 18
Iterating global reduction 4 with 8 rules applied. Total rules applied 427 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 428 place count 11 transition count 17
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 429 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 430 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 432 place count 8 transition count 14
Applied a total of 432 rules in 28 ms. Remains 8 /255 variables (removed 247) and now considering 14/289 (removed 275) transitions.
[2024-05-22 11:42:19] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 11:42:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:42:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:42:19] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 11:42:19] [INFO ] Invariant cache hit.
[2024-05-22 11:42:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 11:42:19] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 11:42:19] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 11:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 49 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 83 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/255 places, 14/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 8/255 places, 14/289 transitions.
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:42:20] [INFO ] Input system was already deterministic with 14 transitions.
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:42:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6084145803235070281.gal : 0 ms
[2024-05-22 11:42:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15361208808587472730.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/CTLCardinality6084145803235070281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15361208808587472730.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,385,0.018228,3360,2,23,5,145,6,0,39,138,0


Converting to forward existential form...Done !
original formula: AF((p152==1))
=> equivalent forward existential formula: [FwdG(Init,!((p152==1)))] = FALSE
Hit Full ! (commute/partial/dont) 12/0/2
(forward)formula 0,0,0.019866,3680,1,0,8,291,20,4,198,309,8
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 11:42:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:42:20] [INFO ] Applying decomposition
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 6 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/graph3616316481594627819.txt' '-o' '/tmp/graph3616316481594627819.bin' '-w' '/tmp/graph3616316481594627819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3616316481594627819.bin' '-l' '-1' '-v' '-w' '/tmp/graph3616316481594627819.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:42:20] [INFO ] Decomposing Gal with order
[2024-05-22 11:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:42:20] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-22 11:42:20] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:42:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 11:42:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality1740341678592678765.gal : 5 ms
[2024-05-22 11:42:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4521367225709333835.ctl : 16 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/CTLCardinality1740341678592678765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4521367225709333835.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99689e+15,177.159,2370788,21429,205,3.24284e+06,17072,599,1.32438e+07,77,179779,0


Converting to forward existential form...Done !
original formula: AG((((AX(((((i1.i2.u0.p0==0)&&(i24.i0.u74.p229==1))&&((i5.u12.p31==0)&&(i21.u67.p210==1)))||(i22.i1.u70.p219==0))) + AF((i13.u42.p121==1)...267
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(!((E(!((i12.i1.u39.p114==0)) U (!(!(EX(TRUE))) * !((i12.i1.u39.p114==0)))) + EG(!((...409
Reverse transition relation is NOT exact ! Due to transitions t264, t269, t276, u90.t6, u90.t8, u90.t9, u90.t11, i3.u7.t184, i3.u7.t186, i4.u10.t180, i4.u1...1144
ITS-tools command line returned an error code 137
[2024-05-22 11:58:58] [INFO ] Applying decomposition
[2024-05-22 11:58:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:58:58] [INFO ] Decomposing Gal with order
[2024-05-22 11:58:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:58:58] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-22 11:58:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 528 labels/synchronizations in 12 ms.
[2024-05-22 11:58:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13484096809568162503.gal : 2 ms
[2024-05-22 11:58:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10662610743454890021.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/CTLCardinality13484096809568162503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10662610743454890021.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99689e+15,392.682,6848196,2380,3939,9.66344e+06,3.02201e+06,410,3.28567e+07,255,1.88189e+07,0


Converting to forward existential form...Done !
original formula: AG((((AX(((((u29.p0==0)&&(i0.i0.u18.p229==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.p31==0)&&(i0.i0.i0.u17.p210==1)))||(i0.i0.i0.u17.p219==0)...363
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(!((E(!((i0.i0.i0.i0.i0.i0.i0.u13.p114==0)) U (!(!(EX(TRUE))) * !((i0.i0.i0.i0.i0.i0...533
Reverse transition relation is NOT exact ! Due to transitions t215, t269, t276, i0.u19.t14, i0.u19.t20, i0.u19.t24, i0.u19.t26, i0.u19.t28, i0.u19.t30, i0....1884
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 2
(forward)formula 0,0,1009.07,7596528,1,0,9.66344e+06,7.5733e+06,1126,3.28742e+07,871,4.18444e+07,1331040
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-22 12:23:59] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:23:59] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 12:23:59] [INFO ] Transformed 255 places.
[2024-05-22 12:23:59] [INFO ] Transformed 289 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 12:23:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10981235196459583553.gal : 2 ms
[2024-05-22 12:23:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2083717615348320579.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/CTLCardinality10981235196459583553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2083717615348320579.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

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="DiscoveryGPU-PT-10b"
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 DiscoveryGPU-PT-10b, 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 r136-tall-171631132600433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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