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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 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 9.3K Apr 12 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 02:10 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 104K 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-14b-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716382755198

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-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 12:59: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 12:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:59:16] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 12:59:16] [INFO ] Transformed 408 places.
[2024-05-22 12:59:16] [INFO ] Transformed 434 transitions.
[2024-05-22 12:59:16] [INFO ] Found NUPN structural information;
[2024-05-22 12:59:16] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 390 transition count 434
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 56 place count 352 transition count 396
Iterating global reduction 1 with 38 rules applied. Total rules applied 94 place count 352 transition count 396
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 347 transition count 391
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 347 transition count 391
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 343 transition count 387
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 343 transition count 387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 342 transition count 386
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 342 transition count 386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 341 transition count 384
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 341 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 340 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 340 transition count 383
Applied a total of 118 rules in 101 ms. Remains 340 /408 variables (removed 68) and now considering 383/434 (removed 51) transitions.
// Phase 1: matrix 383 rows 340 cols
[2024-05-22 12:59:16] [INFO ] Computed 4 invariants in 21 ms
[2024-05-22 12:59:16] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 12:59:16] [INFO ] Invariant cache hit.
[2024-05-22 12:59:17] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-22 12:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 5/334 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-22 12:59:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 13 ms to minimize.
[2024-05-22 12:59:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:59:21] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:59:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/717 variables, 334/342 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 10 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 3 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:59:28] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:59:29] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-22 12:59:30] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:59:30] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-22 12:59:30] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:59:30] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:59:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 6/723 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 723/723 variables, and 373 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 5/334 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/717 variables, 334/367 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 376/743 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 6/723 variables, 6/749 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 723/723 variables, and 755 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 29/29 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LTL mode, iteration 1 : 340/408 places, 383/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60927 ms. Remains : 340/408 places, 383/434 transitions.
Support contains 99 out of 340 places after structural reductions.
[2024-05-22 13:00:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 13:00:17] [INFO ] Flatten gal took : 78 ms
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:00:17] [INFO ] Flatten gal took : 26 ms
[2024-05-22 13:00:17] [INFO ] Input system was already deterministic with 383 transitions.
Support contains 81 out of 340 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 1175 ms. (34 steps per ms) remains 1/56 properties
BEST_FIRST walk for 19424 steps (5 resets) in 98 ms. (196 steps per ms) remains 0/1 properties
[2024-05-22 13:00:18] [INFO ] Flatten gal took : 27 ms
[2024-05-22 13:00:18] [INFO ] Flatten gal took : 26 ms
[2024-05-22 13:00:18] [INFO ] Input system was already deterministic with 383 transitions.
Computed a total of 50 stabilizing places and 50 stable transitions
Graph (complete) has 635 edges and 340 vertex of which 315 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.19 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Graph (complete) has 635 edges and 340 vertex of which 315 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 314 transition count 304
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 251 transition count 304
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 127 place count 251 transition count 271
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 193 place count 218 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 205 transition count 258
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 205 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 219 place count 205 transition count 256
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 223 place count 203 transition count 256
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 232 place count 194 transition count 246
Iterating global reduction 2 with 9 rules applied. Total rules applied 241 place count 194 transition count 246
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 250 place count 185 transition count 234
Iterating global reduction 2 with 9 rules applied. Total rules applied 259 place count 185 transition count 234
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 267 place count 177 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 275 place count 177 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 280 place count 172 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 285 place count 172 transition count 216
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 341 place count 144 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 342 place count 143 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 343 place count 143 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 344 place count 142 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 345 place count 142 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 141 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 141 transition count 184
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 349 place count 141 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 139 transition count 182
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 167 edges and 137 vertex of which 133 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 143 edges and 133 vertex of which 56 / 133 are part of one of the 28 SCC in 2 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 46 rules applied. Total rules applied 397 place count 105 transition count 135
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 467 place count 63 transition count 107
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 478 place count 52 transition count 85
Iterating global reduction 4 with 11 rules applied. Total rules applied 489 place count 52 transition count 85
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 500 place count 41 transition count 63
Iterating global reduction 4 with 11 rules applied. Total rules applied 511 place count 41 transition count 63
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 522 place count 30 transition count 41
Iterating global reduction 4 with 11 rules applied. Total rules applied 533 place count 30 transition count 41
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 543 place count 20 transition count 31
Iterating global reduction 4 with 10 rules applied. Total rules applied 553 place count 20 transition count 31
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 554 place count 20 transition count 30
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 555 place count 20 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 556 place count 19 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 559 place count 16 transition count 26
Applied a total of 559 rules in 171 ms. Remains 16 /340 variables (removed 324) and now considering 26/383 (removed 357) transitions.
[2024-05-22 13:00:18] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 16 cols
[2024-05-22 13:00:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:00:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 13:00:18] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-22 13:00:18] [INFO ] Invariant cache hit.
[2024-05-22 13:00:18] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-22 13:00:18] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 13:00:18] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-22 13:00:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 16 constraints, problems are : Problem set: 0 solved, 19 unsolved in 207 ms.
Refiners :[State Equation: 16/16 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 4/36 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 35 constraints, problems are : Problem set: 0 solved, 19 unsolved in 152 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 373ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/340 places, 26/383 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 634 ms. Remains : 16/340 places, 26/383 transitions.
[2024-05-22 13:00:19] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:00:19] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:00:19] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-22 13:00:19] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:00:19] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:00:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10090502647081939285.gal : 1 ms
[2024-05-22 13:00:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2990556534836328621.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/CTLCardinality10090502647081939285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2990556534836328621.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,12103,0.018022,3248,2,41,5,266,6,0,77,248,0


Converting to forward existential form...Done !
original formula: EG(AF((AG(((p66==0)&&(p184==0))) * (p130==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !(((p66==0)&&(p184==0))))) * (p130==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t10, t12, t22, t23, t24, t25, Intersection with reachable at each step enabled. (des...197
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.026908,3860,1,0,86,2663,81,51,476,3264,95
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 331 transition count 383
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 45 place count 295 transition count 347
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 295 transition count 347
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 93 place count 283 transition count 333
Iterating global reduction 1 with 12 rules applied. Total rules applied 105 place count 283 transition count 333
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 115 place count 273 transition count 322
Iterating global reduction 1 with 10 rules applied. Total rules applied 125 place count 273 transition count 322
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 134 place count 264 transition count 312
Iterating global reduction 1 with 9 rules applied. Total rules applied 143 place count 264 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 150 place count 257 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 157 place count 257 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 251 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 251 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 174 place count 246 transition count 289
Iterating global reduction 1 with 5 rules applied. Total rules applied 179 place count 246 transition count 289
Applied a total of 179 rules in 37 ms. Remains 246 /340 variables (removed 94) and now considering 289/383 (removed 94) transitions.
// Phase 1: matrix 289 rows 246 cols
[2024-05-22 13:00:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:00:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 13:00:19] [INFO ] Invariant cache hit.
[2024-05-22 13:00:19] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 13:00:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/534 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:00:25] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:00:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:00:27] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:00:27] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:00:27] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 277 constraints, problems are : Problem set: 0 solved, 288 unsolved in 19004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/534 variables, 245/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 287/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 565 constraints, problems are : Problem set: 0 solved, 288 unsolved in 27462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
After SMT, in 46574ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 46579ms
Starting structural reductions in LTL mode, iteration 1 : 246/340 places, 289/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47037 ms. Remains : 246/340 places, 289/383 transitions.
[2024-05-22 13:01:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:01:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:01:06] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 13:01:06] [INFO ] Flatten gal took : 25 ms
[2024-05-22 13:01:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:01:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9843575157810610668.gal : 7 ms
[2024-05-22 13:01:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9971479160041229228.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/CTLCardinality9843575157810610668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9971479160041229228.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 13:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:01:36] [INFO ] Applying decomposition
[2024-05-22 13:01:36] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15323623006179963049.txt' '-o' '/tmp/graph15323623006179963049.bin' '-w' '/tmp/graph15323623006179963049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15323623006179963049.bin' '-l' '-1' '-v' '-w' '/tmp/graph15323623006179963049.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:01:36] [INFO ] Decomposing Gal with order
[2024-05-22 13:01:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:01:36] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 13:01:36] [INFO ] Flatten gal took : 45 ms
[2024-05-22 13:01:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 13:01:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13263462291749863332.gal : 7 ms
[2024-05-22 13:01:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9120229107261586534.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/CTLCardinality13263462291749863332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9120229107261586534.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 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 49 place count 291 transition count 344
Iterating global reduction 1 with 39 rules applied. Total rules applied 88 place count 291 transition count 344
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 101 place count 278 transition count 329
Iterating global reduction 1 with 13 rules applied. Total rules applied 114 place count 278 transition count 329
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 125 place count 267 transition count 317
Iterating global reduction 1 with 11 rules applied. Total rules applied 136 place count 267 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 147 place count 256 transition count 306
Iterating global reduction 1 with 11 rules applied. Total rules applied 158 place count 256 transition count 306
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 167 place count 247 transition count 289
Iterating global reduction 1 with 9 rules applied. Total rules applied 176 place count 247 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 184 place count 239 transition count 281
Iterating global reduction 1 with 8 rules applied. Total rules applied 192 place count 239 transition count 281
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 200 place count 231 transition count 273
Iterating global reduction 1 with 8 rules applied. Total rules applied 208 place count 231 transition count 273
Applied a total of 208 rules in 26 ms. Remains 231 /340 variables (removed 109) and now considering 273/383 (removed 110) transitions.
// Phase 1: matrix 273 rows 231 cols
[2024-05-22 13:02:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:02:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 13:02:06] [INFO ] Invariant cache hit.
[2024-05-22 13:02:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-22 13:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 273/504 variables, 231/233 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 13:02:11] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:02:11] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:02:11] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:02:11] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:02:11] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:02:12] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 13:02:13] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:02:13] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:02:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:02:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:02:13] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 258 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/504 variables, 231/258 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 272/530 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 530 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 25/25 constraints]
After SMT, in 29686ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 29691ms
Starting structural reductions in LTL mode, iteration 1 : 231/340 places, 273/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29952 ms. Remains : 231/340 places, 273/383 transitions.
[2024-05-22 13:02:36] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:02:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:02:36] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-22 13:02:36] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:02:36] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:02:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality619393810717050609.gal : 2 ms
[2024-05-22 13:02:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17954817638658442437.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/CTLCardinality619393810717050609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17954817638658442437.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 13:03:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:03:06] [INFO ] Applying decomposition
[2024-05-22 13:03:06] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7142551231379703216.txt' '-o' '/tmp/graph7142551231379703216.bin' '-w' '/tmp/graph7142551231379703216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7142551231379703216.bin' '-l' '-1' '-v' '-w' '/tmp/graph7142551231379703216.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:03:06] [INFO ] Decomposing Gal with order
[2024-05-22 13:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:03:06] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 13:03:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 13:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality13009615663257491126.gal : 4 ms
[2024-05-22 13:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4383938044238121455.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/CTLCardinality13009615663257491126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4383938044238121455.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 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 48 place count 292 transition count 345
Iterating global reduction 1 with 38 rules applied. Total rules applied 86 place count 292 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 100 place count 278 transition count 329
Iterating global reduction 1 with 14 rules applied. Total rules applied 114 place count 278 transition count 329
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 126 place count 266 transition count 316
Iterating global reduction 1 with 12 rules applied. Total rules applied 138 place count 266 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 150 place count 254 transition count 303
Iterating global reduction 1 with 12 rules applied. Total rules applied 162 place count 254 transition count 303
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 245 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 245 transition count 287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 187 place count 238 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 194 place count 238 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 200 place count 232 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 206 place count 232 transition count 274
Applied a total of 206 rules in 17 ms. Remains 232 /340 variables (removed 108) and now considering 274/383 (removed 109) transitions.
// Phase 1: matrix 274 rows 232 cols
[2024-05-22 13:03:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:03:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 13:03:37] [INFO ] Invariant cache hit.
[2024-05-22 13:03:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-05-22 13:03:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 274/506 variables, 232/234 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-22 13:03:41] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:03:42] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:03:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/506 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 261 constraints, problems are : Problem set: 0 solved, 273 unsolved in 13789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/506 variables, 232/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 273/534 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/506 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 534 constraints, problems are : Problem set: 0 solved, 273 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 27/27 constraints]
After SMT, in 27366ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 27369ms
Starting structural reductions in LTL mode, iteration 1 : 232/340 places, 274/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27597 ms. Remains : 232/340 places, 274/383 transitions.
[2024-05-22 13:04:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:04:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:04:04] [INFO ] Input system was already deterministic with 274 transitions.
[2024-05-22 13:04:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:04:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:04:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12135362343519045358.gal : 2 ms
[2024-05-22 13:04:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2553930194217037497.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/CTLCardinality12135362343519045358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2553930194217037497.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 13:04:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:04:34] [INFO ] Applying decomposition
[2024-05-22 13:04:34] [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/graph17839910946896782775.txt' '-o' '/tmp/graph17839910946896782775.bin' '-w' '/tmp/graph17839910946896782775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17839910946896782775.bin' '-l' '-1' '-v' '-w' '/tmp/graph17839910946896782775.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:04:34] [INFO ] Decomposing Gal with order
[2024-05-22 13:04:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:04:34] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 13:04:34] [INFO ] Flatten gal took : 33 ms
[2024-05-22 13:04:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2024-05-22 13:04:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5244949071913167100.gal : 3 ms
[2024-05-22 13:04:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6908087409762912303.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/CTLCardinality5244949071913167100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6908087409762912303.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 49 place count 291 transition count 344
Iterating global reduction 1 with 39 rules applied. Total rules applied 88 place count 291 transition count 344
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 102 place count 277 transition count 328
Iterating global reduction 1 with 14 rules applied. Total rules applied 116 place count 277 transition count 328
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 128 place count 265 transition count 315
Iterating global reduction 1 with 12 rules applied. Total rules applied 140 place count 265 transition count 315
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 152 place count 253 transition count 302
Iterating global reduction 1 with 12 rules applied. Total rules applied 164 place count 253 transition count 302
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 173 place count 244 transition count 286
Iterating global reduction 1 with 9 rules applied. Total rules applied 182 place count 244 transition count 286
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 190 place count 236 transition count 278
Iterating global reduction 1 with 8 rules applied. Total rules applied 198 place count 236 transition count 278
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 205 place count 229 transition count 271
Iterating global reduction 1 with 7 rules applied. Total rules applied 212 place count 229 transition count 271
Applied a total of 212 rules in 23 ms. Remains 229 /340 variables (removed 111) and now considering 271/383 (removed 112) transitions.
// Phase 1: matrix 271 rows 229 cols
[2024-05-22 13:05:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:05:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 13:05:04] [INFO ] Invariant cache hit.
[2024-05-22 13:05:05] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-22 13:05:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/500 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 13:05:09] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:05:09] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:05:09] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:05:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:05:11] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 7/258 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 258 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/500 variables, 229/258 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 270/528 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 528 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 27/27 constraints]
After SMT, in 27324ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27329ms
Starting structural reductions in LTL mode, iteration 1 : 229/340 places, 271/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27546 ms. Remains : 229/340 places, 271/383 transitions.
[2024-05-22 13:05:32] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:05:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:05:32] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-22 13:05:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:05:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:05:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14036738900966650011.gal : 2 ms
[2024-05-22 13:05:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17517575023148023724.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/CTLCardinality14036738900966650011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17517575023148023724.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 13:06:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:06:02] [INFO ] Applying decomposition
[2024-05-22 13:06:02] [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/graph12239364033662199440.txt' '-o' '/tmp/graph12239364033662199440.bin' '-w' '/tmp/graph12239364033662199440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12239364033662199440.bin' '-l' '-1' '-v' '-w' '/tmp/graph12239364033662199440.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:06:02] [INFO ] Decomposing Gal with order
[2024-05-22 13:06:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:06:02] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 13:06:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:06:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-22 13:06:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14508526099023301670.gal : 2 ms
[2024-05-22 13:06:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1890137805596713566.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/CTLCardinality14508526099023301670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1890137805596713566.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 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 50 place count 290 transition count 343
Iterating global reduction 1 with 40 rules applied. Total rules applied 90 place count 290 transition count 343
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 276 transition count 327
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 276 transition count 327
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 130 place count 264 transition count 314
Iterating global reduction 1 with 12 rules applied. Total rules applied 142 place count 264 transition count 314
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 252 transition count 301
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 252 transition count 301
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 242 transition count 283
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 242 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 233 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 233 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 212 place count 225 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 220 place count 225 transition count 266
Applied a total of 220 rules in 16 ms. Remains 225 /340 variables (removed 115) and now considering 266/383 (removed 117) transitions.
// Phase 1: matrix 266 rows 225 cols
[2024-05-22 13:06:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 13:06:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 13:06:32] [INFO ] Invariant cache hit.
[2024-05-22 13:06:32] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-05-22 13:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/491 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:06:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 252 constraints, problems are : Problem set: 0 solved, 265 unsolved in 12695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/491 variables, 225/252 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 265/517 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 517 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 25/25 constraints]
After SMT, in 25846ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 25849ms
Starting structural reductions in LTL mode, iteration 1 : 225/340 places, 266/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26068 ms. Remains : 225/340 places, 266/383 transitions.
[2024-05-22 13:06:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:06:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:06:58] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-22 13:06:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:06:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7945382440491027878.gal : 1 ms
[2024-05-22 13:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8120578852419141707.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/CTLCardinality7945382440491027878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8120578852419141707.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 13:07:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:07:28] [INFO ] Applying decomposition
[2024-05-22 13:07:28] [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/graph15073631362283832001.txt' '-o' '/tmp/graph15073631362283832001.bin' '-w' '/tmp/graph15073631362283832001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15073631362283832001.bin' '-l' '-1' '-v' '-w' '/tmp/graph15073631362283832001.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:07:28] [INFO ] Decomposing Gal with order
[2024-05-22 13:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:07:28] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-22 13:07:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-22 13:07:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11472485808157846210.gal : 2 ms
[2024-05-22 13:07:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8474756485622273409.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/CTLCardinality11472485808157846210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8474756485622273409.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 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 46 place count 294 transition count 347
Iterating global reduction 1 with 36 rules applied. Total rules applied 82 place count 294 transition count 347
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 95 place count 281 transition count 332
Iterating global reduction 1 with 13 rules applied. Total rules applied 108 place count 281 transition count 332
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 269 transition count 319
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 269 transition count 319
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 143 place count 258 transition count 307
Iterating global reduction 1 with 11 rules applied. Total rules applied 154 place count 258 transition count 307
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 163 place count 249 transition count 291
Iterating global reduction 1 with 9 rules applied. Total rules applied 172 place count 249 transition count 291
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 180 place count 241 transition count 283
Iterating global reduction 1 with 8 rules applied. Total rules applied 188 place count 241 transition count 283
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 195 place count 234 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 202 place count 234 transition count 276
Applied a total of 202 rules in 27 ms. Remains 234 /340 variables (removed 106) and now considering 276/383 (removed 107) transitions.
// Phase 1: matrix 276 rows 234 cols
[2024-05-22 13:07:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:07:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 13:07:59] [INFO ] Invariant cache hit.
[2024-05-22 13:07:59] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-22 13:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 276/510 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:08:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:08:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/510 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 264 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/510 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 275/539 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/510 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 539 constraints, problems are : Problem set: 0 solved, 275 unsolved in 14360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 28/28 constraints]
After SMT, in 28190ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 28192ms
Starting structural reductions in LTL mode, iteration 1 : 234/340 places, 276/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28439 ms. Remains : 234/340 places, 276/383 transitions.
[2024-05-22 13:08:27] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:08:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:08:27] [INFO ] Input system was already deterministic with 276 transitions.
[2024-05-22 13:08:27] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:08:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:08:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9903038602628515221.gal : 2 ms
[2024-05-22 13:08:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5905144595333735595.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/CTLCardinality9903038602628515221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5905144595333735595.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 13:08:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:08:57] [INFO ] Applying decomposition
[2024-05-22 13:08:57] [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/graph4339733166061943593.txt' '-o' '/tmp/graph4339733166061943593.bin' '-w' '/tmp/graph4339733166061943593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4339733166061943593.bin' '-l' '-1' '-v' '-w' '/tmp/graph4339733166061943593.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:08:57] [INFO ] Decomposing Gal with order
[2024-05-22 13:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:08:57] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 13:08:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:08:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 13:08:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3164484286315028432.gal : 2 ms
[2024-05-22 13:08:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2259513466953414786.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/CTLCardinality3164484286315028432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2259513466953414786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 330 transition count 383
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 49 place count 291 transition count 344
Iterating global reduction 1 with 39 rules applied. Total rules applied 88 place count 291 transition count 344
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 101 place count 278 transition count 330
Iterating global reduction 1 with 13 rules applied. Total rules applied 114 place count 278 transition count 330
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 125 place count 267 transition count 318
Iterating global reduction 1 with 11 rules applied. Total rules applied 136 place count 267 transition count 318
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 147 place count 256 transition count 306
Iterating global reduction 1 with 11 rules applied. Total rules applied 158 place count 256 transition count 306
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 168 place count 246 transition count 288
Iterating global reduction 1 with 10 rules applied. Total rules applied 178 place count 246 transition count 288
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 237 transition count 279
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 237 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 204 place count 229 transition count 271
Iterating global reduction 1 with 8 rules applied. Total rules applied 212 place count 229 transition count 271
Applied a total of 212 rules in 17 ms. Remains 229 /340 variables (removed 111) and now considering 271/383 (removed 112) transitions.
// Phase 1: matrix 271 rows 229 cols
[2024-05-22 13:09:27] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 13:09:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 13:09:27] [INFO ] Invariant cache hit.
[2024-05-22 13:09:27] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-22 13:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/500 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 13:09:32] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:09:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:09:32] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:09:32] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:09:32] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:09:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 13:09:34] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:09:34] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:09:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:09:34] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 255 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/500 variables, 229/255 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 270/525 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 525 constraints, problems are : Problem set: 0 solved, 270 unsolved in 14439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 24/24 constraints]
After SMT, in 27837ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27841ms
Starting structural reductions in LTL mode, iteration 1 : 229/340 places, 271/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28088 ms. Remains : 229/340 places, 271/383 transitions.
[2024-05-22 13:09:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:09:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:09:55] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-22 13:09:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:09:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:09:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7616251496174703875.gal : 1 ms
[2024-05-22 13:09:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14140990845800864458.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/CTLCardinality7616251496174703875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14140990845800864458.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 13:10:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:10:25] [INFO ] Applying decomposition
[2024-05-22 13:10:25] [INFO ] Flatten gal took : 5 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/graph16979771254784056576.txt' '-o' '/tmp/graph16979771254784056576.bin' '-w' '/tmp/graph16979771254784056576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16979771254784056576.bin' '-l' '-1' '-v' '-w' '/tmp/graph16979771254784056576.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:10:25] [INFO ] Decomposing Gal with order
[2024-05-22 13:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:10:25] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-22 13:10:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2024-05-22 13:10:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11508739656485167674.gal : 3 ms
[2024-05-22 13:10:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7615258946069648354.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/CTLCardinality11508739656485167674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7615258946069648354.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 : 340/340 places, 383/383 transitions.
Graph (complete) has 635 edges and 340 vertex of which 317 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 316 transition count 307
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 255 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 254 transition count 306
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 125 place count 254 transition count 274
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 189 place count 222 transition count 274
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 202 place count 209 transition count 261
Iterating global reduction 3 with 13 rules applied. Total rules applied 215 place count 209 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 215 place count 209 transition count 259
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 219 place count 207 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 229 place count 197 transition count 247
Iterating global reduction 3 with 10 rules applied. Total rules applied 239 place count 197 transition count 247
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 249 place count 187 transition count 233
Iterating global reduction 3 with 10 rules applied. Total rules applied 259 place count 187 transition count 233
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 265 place count 181 transition count 225
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 181 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 179 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 179 transition count 223
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 335 place count 149 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 336 place count 148 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 148 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 338 place count 147 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 339 place count 147 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 146 transition count 189
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 146 transition count 189
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 146 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 344 place count 144 transition count 187
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 172 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 148 edges and 138 vertex of which 54 / 138 are part of one of the 27 SCC in 0 ms
Free SCC test removed 27 places
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 3 with 48 rules applied. Total rules applied 392 place count 111 transition count 138
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 75 rules applied. Total rules applied 467 place count 67 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 469 place count 65 transition count 107
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 479 place count 55 transition count 87
Iterating global reduction 6 with 10 rules applied. Total rules applied 489 place count 55 transition count 87
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 498 place count 46 transition count 69
Iterating global reduction 6 with 9 rules applied. Total rules applied 507 place count 46 transition count 69
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 516 place count 37 transition count 51
Iterating global reduction 6 with 9 rules applied. Total rules applied 525 place count 37 transition count 51
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 534 place count 28 transition count 42
Iterating global reduction 6 with 9 rules applied. Total rules applied 543 place count 28 transition count 42
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 544 place count 28 transition count 41
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 545 place count 28 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 546 place count 27 transition count 40
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 551 place count 22 transition count 35
Applied a total of 551 rules in 73 ms. Remains 22 /340 variables (removed 318) and now considering 35/383 (removed 348) transitions.
[2024-05-22 13:10:56] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
// Phase 1: matrix 27 rows 22 cols
[2024-05-22 13:10:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:10:56] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 13:10:56] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2024-05-22 13:10:56] [INFO ] Invariant cache hit.
[2024-05-22 13:10:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-22 13:10:56] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-22 13:10:56] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2024-05-22 13:10:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 26/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/49 variables, and 22 constraints, problems are : Problem set: 0 solved, 25 unsolved in 129 ms.
Refiners :[State Equation: 22/22 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 26/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 6/48 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/49 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 127 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/340 places, 35/383 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 373 ms. Remains : 22/340 places, 35/383 transitions.
[2024-05-22 13:10:56] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:10:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:10:56] [INFO ] Input system was already deterministic with 35 transitions.
[2024-05-22 13:10:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:10:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:10:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13490867388882921219.gal : 1 ms
[2024-05-22 13:10:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9944211978484341146.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/CTLCardinality13490867388882921219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9944211978484341146.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,83160,0.006374,3480,2,49,5,277,6,0,101,235,0


Converting to forward existential form...Done !
original formula: EF(AG((((p234==0)||(p152==1))||((p374==0)||(p27==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p234==0)||(p152==1))||((p374==0)||(p27==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t13, t15, t17, t21, t34, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,1,0.013899,3800,1,0,58,2122,83,34,561,1927,74
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 333 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 303 transition count 353
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 303 transition count 353
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 293 transition count 341
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 293 transition count 341
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 95 place count 285 transition count 333
Iterating global reduction 1 with 8 rules applied. Total rules applied 103 place count 285 transition count 333
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 278 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 278 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 275 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 275 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 272 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 272 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 269 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 269 transition count 314
Applied a total of 135 rules in 16 ms. Remains 269 /340 variables (removed 71) and now considering 314/383 (removed 69) transitions.
// Phase 1: matrix 314 rows 269 cols
[2024-05-22 13:10:56] [INFO ] Computed 3 invariants in 2 ms
[2024-05-22 13:10:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 13:10:56] [INFO ] Invariant cache hit.
[2024-05-22 13:10:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 13:10:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 3/268 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 13:10:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:10:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/582 variables, 268/273 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:11:03] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:11:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 13:11:05] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/583 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/583 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 295 constraints, problems are : Problem set: 0 solved, 313 unsolved in 22648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 3/268 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/582 variables, 268/294 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 312/606 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/583 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 608 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 23/23 constraints]
After SMT, in 52757ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 52761ms
Starting structural reductions in LTL mode, iteration 1 : 269/340 places, 314/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52995 ms. Remains : 269/340 places, 314/383 transitions.
[2024-05-22 13:11:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:11:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:11:49] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 13:11:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:11:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:11:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17054160656241023498.gal : 1 ms
[2024-05-22 13:11:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality168970840822467107.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/CTLCardinality17054160656241023498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality168970840822467107.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 13:12:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:12:19] [INFO ] Applying decomposition
[2024-05-22 13:12:19] [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/graph5517483188164954560.txt' '-o' '/tmp/graph5517483188164954560.bin' '-w' '/tmp/graph5517483188164954560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5517483188164954560.bin' '-l' '-1' '-v' '-w' '/tmp/graph5517483188164954560.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:12:19] [INFO ] Decomposing Gal with order
[2024-05-22 13:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:12:19] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 13:12:19] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 3 ms.
[2024-05-22 13:12:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5391160842216904136.gal : 3 ms
[2024-05-22 13:12:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12299753155793484228.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/CTLCardinality5391160842216904136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12299753155793484228.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 : 340/340 places, 383/383 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 331 transition count 383
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 47 place count 293 transition count 345
Iterating global reduction 1 with 38 rules applied. Total rules applied 85 place count 293 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 99 place count 279 transition count 329
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 279 transition count 329
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 125 place count 267 transition count 316
Iterating global reduction 1 with 12 rules applied. Total rules applied 137 place count 267 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 149 place count 255 transition count 303
Iterating global reduction 1 with 12 rules applied. Total rules applied 161 place count 255 transition count 303
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 245 transition count 285
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 245 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 190 place count 236 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 199 place count 236 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 207 place count 228 transition count 268
Iterating global reduction 1 with 8 rules applied. Total rules applied 215 place count 228 transition count 268
Applied a total of 215 rules in 26 ms. Remains 228 /340 variables (removed 112) and now considering 268/383 (removed 115) transitions.
// Phase 1: matrix 268 rows 228 cols
[2024-05-22 13:12:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:12:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 13:12:49] [INFO ] Invariant cache hit.
[2024-05-22 13:12:49] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-22 13:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/495 variables, 227/229 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:12:54] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 3 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:12:55] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:12:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/496 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 259 constraints, problems are : Problem set: 0 solved, 267 unsolved in 16733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/495 variables, 227/258 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 266/524 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/496 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 526 constraints, problems are : Problem set: 0 solved, 267 unsolved in 23520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 29/29 constraints]
After SMT, in 40336ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 40341ms
Starting structural reductions in LTL mode, iteration 1 : 228/340 places, 268/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40584 ms. Remains : 228/340 places, 268/383 transitions.
[2024-05-22 13:13:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:13:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:13:30] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-22 13:13:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:13:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:13:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality431818295270759096.gal : 1 ms
[2024-05-22 13:13:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14954645223450797296.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/CTLCardinality431818295270759096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14954645223450797296.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 13:14:00] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:14:00] [INFO ] Applying decomposition
[2024-05-22 13:14:00] [INFO ] Flatten gal took : 5 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/graph15630638386022583540.txt' '-o' '/tmp/graph15630638386022583540.bin' '-w' '/tmp/graph15630638386022583540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15630638386022583540.bin' '-l' '-1' '-v' '-w' '/tmp/graph15630638386022583540.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:14:00] [INFO ] Decomposing Gal with order
[2024-05-22 13:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:14:00] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-22 13:14:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 13:14:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11464865704051108296.gal : 10 ms
[2024-05-22 13:14:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13908874897169422345.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/CTLCardinality11464865704051108296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13908874897169422345.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 : 340/340 places, 383/383 transitions.
Graph (complete) has 635 edges and 340 vertex of which 317 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 316 transition count 307
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 255 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 254 transition count 306
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 125 place count 254 transition count 273
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 191 place count 221 transition count 273
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 204 place count 208 transition count 260
Iterating global reduction 3 with 13 rules applied. Total rules applied 217 place count 208 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 217 place count 208 transition count 258
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 221 place count 206 transition count 258
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 231 place count 196 transition count 246
Iterating global reduction 3 with 10 rules applied. Total rules applied 241 place count 196 transition count 246
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 251 place count 186 transition count 232
Iterating global reduction 3 with 10 rules applied. Total rules applied 261 place count 186 transition count 232
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 178 transition count 220
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 178 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 281 place count 174 transition count 216
Iterating global reduction 3 with 4 rules applied. Total rules applied 285 place count 174 transition count 216
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 343 place count 145 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 344 place count 144 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 144 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 143 transition count 184
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 143 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 142 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 142 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 350 place count 142 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 140 transition count 181
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 166 edges and 138 vertex of which 134 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 142 edges and 134 vertex of which 54 / 134 are part of one of the 27 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 44 rules applied. Total rules applied 396 place count 107 transition count 136
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 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 70 rules applied. Total rules applied 466 place count 67 transition count 106
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 470 place count 65 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 472 place count 63 transition count 104
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 484 place count 51 transition count 80
Iterating global reduction 7 with 12 rules applied. Total rules applied 496 place count 51 transition count 80
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 506 place count 41 transition count 60
Iterating global reduction 7 with 10 rules applied. Total rules applied 516 place count 41 transition count 60
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 526 place count 31 transition count 40
Iterating global reduction 7 with 10 rules applied. Total rules applied 536 place count 31 transition count 40
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 546 place count 21 transition count 30
Iterating global reduction 7 with 10 rules applied. Total rules applied 556 place count 21 transition count 30
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 558 place count 21 transition count 28
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 559 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 560 place count 20 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 564 place count 16 transition count 23
Applied a total of 564 rules in 44 ms. Remains 16 /340 variables (removed 324) and now considering 23/383 (removed 360) transitions.
[2024-05-22 13:14:30] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-22 13:14:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:14:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 13:14:30] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-22 13:14:30] [INFO ] Invariant cache hit.
[2024-05-22 13:14:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 13:14:30] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 13:14:30] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-22 13:14:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 5/33 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/34 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 89 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/33 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/34 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 84 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/340 places, 23/383 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 266 ms. Remains : 16/340 places, 23/383 transitions.
[2024-05-22 13:14:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:14:30] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:14:30] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 13:14:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:14:30] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:14:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6038351801637160021.gal : 0 ms
[2024-05-22 13:14:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10979678835683113728.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/CTLCardinality6038351801637160021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10979678835683113728.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,13344,0.00425,3420,2,46,5,488,6,0,74,575,0


Converting to forward existential form...Done !
original formula: AF((EG(E(AG((p168==1)) U (p25==0))) * (EF((p18==1)) + (p325==1))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(E(!(E(TRUE U !((p168==1)))) U (p25==0))) * (E(TRUE U (p18==1)) + (p325==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t22, Intersection with reachable at each step enabled. (destroyed/reverse/in...180
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.043822,5324,1,0,254,10991,80,167,459,15282,244
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 383/383 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 332 transition count 383
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 40 place count 300 transition count 351
Iterating global reduction 1 with 32 rules applied. Total rules applied 72 place count 300 transition count 351
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 83 place count 289 transition count 338
Iterating global reduction 1 with 11 rules applied. Total rules applied 94 place count 289 transition count 338
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 104 place count 279 transition count 327
Iterating global reduction 1 with 10 rules applied. Total rules applied 114 place count 279 transition count 327
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 124 place count 269 transition count 316
Iterating global reduction 1 with 10 rules applied. Total rules applied 134 place count 269 transition count 316
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 261 transition count 302
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 261 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 157 place count 254 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 164 place count 254 transition count 295
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 170 place count 248 transition count 289
Iterating global reduction 1 with 6 rules applied. Total rules applied 176 place count 248 transition count 289
Applied a total of 176 rules in 22 ms. Remains 248 /340 variables (removed 92) and now considering 289/383 (removed 94) transitions.
// Phase 1: matrix 289 rows 248 cols
[2024-05-22 13:14:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:14:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 13:14:30] [INFO ] Invariant cache hit.
[2024-05-22 13:14:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 13:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/535 variables, 246/248 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:14:36] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:14:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:14:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 2/537 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 279 constraints, problems are : Problem set: 0 solved, 288 unsolved in 19454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/535 variables, 246/277 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 286/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 2/537 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/537 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 567 constraints, problems are : Problem set: 0 solved, 288 unsolved in 26115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
After SMT, in 45658ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 45661ms
Starting structural reductions in LTL mode, iteration 1 : 248/340 places, 289/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45912 ms. Remains : 248/340 places, 289/383 transitions.
[2024-05-22 13:15:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:15:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:15:16] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 13:15:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:15:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:15:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12573709903354604234.gal : 1 ms
[2024-05-22 13:15:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16108709591704233559.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/CTLCardinality12573709903354604234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16108709591704233559.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 13:15:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:15:46] [INFO ] Applying decomposition
[2024-05-22 13:15:46] [INFO ] Flatten gal took : 5 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/graph18412523403915744895.txt' '-o' '/tmp/graph18412523403915744895.bin' '-w' '/tmp/graph18412523403915744895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18412523403915744895.bin' '-l' '-1' '-v' '-w' '/tmp/graph18412523403915744895.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:15:46] [INFO ] Decomposing Gal with order
[2024-05-22 13:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:15:46] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 13:15:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 13:15:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16252621519912391003.gal : 27 ms
[2024-05-22 13:15:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7487554183670627473.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/CTLCardinality16252621519912391003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7487554183670627473.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:16:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:16:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:16:16] [INFO ] Applying decomposition
[2024-05-22 13:16:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14825863108560915280.txt' '-o' '/tmp/graph14825863108560915280.bin' '-w' '/tmp/graph14825863108560915280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14825863108560915280.bin' '-l' '-1' '-v' '-w' '/tmp/graph14825863108560915280.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:16:16] [INFO ] Decomposing Gal with order
[2024-05-22 13:16:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:16:17] [INFO ] Removed a total of 127 redundant transitions.
[2024-05-22 13:16:17] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:16:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 13:16:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13373680504509772541.gal : 3 ms
[2024-05-22 13:16:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5640558369569528928.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/CTLCardinality13373680504509772541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5640558369569528928.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 13:26:26] [INFO ] Applying decomposition
[2024-05-22 13:26:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:26:26] [INFO ] Decomposing Gal with order
[2024-05-22 13:26:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:26:26] [INFO ] Removed a total of 127 redundant transitions.
[2024-05-22 13:26:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 982 labels/synchronizations in 16 ms.
[2024-05-22 13:26:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7095107329174568225.gal : 3 ms
[2024-05-22 13:26:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9581911049979675692.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/CTLCardinality7095107329174568225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9581911049979675692.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 13:39:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:39:04] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-22 13:39:04] [INFO ] Transformed 340 places.
[2024-05-22 13:39:04] [INFO ] Transformed 383 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 13:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality9223884547294390115.gal : 1 ms
[2024-05-22 13:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7781409651378417037.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/CTLCardinality9223884547294390115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7781409651378417037.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_STOP 1716385739379

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

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