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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 01:34 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 89K 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-12b-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716379612173

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 12:06:53] [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:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:06:53] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-22 12:06:53] [INFO ] Transformed 352 places.
[2024-05-22 12:06:53] [INFO ] Transformed 374 transitions.
[2024-05-22 12:06:53] [INFO ] Found NUPN structural information;
[2024-05-22 12:06:53] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 339 transition count 374
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 39 place count 313 transition count 348
Iterating global reduction 1 with 26 rules applied. Total rules applied 65 place count 313 transition count 348
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 311 transition count 346
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 311 transition count 346
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 309 transition count 344
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 309 transition count 344
Applied a total of 73 rules in 73 ms. Remains 309 /352 variables (removed 43) and now considering 344/374 (removed 30) transitions.
// Phase 1: matrix 344 rows 309 cols
[2024-05-22 12:06:53] [INFO ] Computed 3 invariants in 21 ms
[2024-05-22 12:06:53] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-22 12:06:53] [INFO ] Invariant cache hit.
[2024-05-22 12:06:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-22 12:06:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 3/300 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 12:06:57] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 10 ms to minimize.
[2024-05-22 12:06:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 344/644 variables, 300/305 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 12:07:02] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:07:03] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:07:04] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:07:05] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 9/653 variables, 9/337 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (OVERLAPS) 0/653 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 337 constraints, problems are : Problem set: 0 solved, 343 unsolved in 28149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 3/300 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 344/644 variables, 300/328 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 334/662 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 205 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 12:07:35] [INFO ] Deduced a trap composed of 204 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (OVERLAPS) 9/653 variables, 9/673 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 9/682 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/653 variables, and 682 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 27/27 constraints]
After SMT, in 58424ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 58441ms
Starting structural reductions in LTL mode, iteration 1 : 309/352 places, 344/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59092 ms. Remains : 309/352 places, 344/374 transitions.
Support contains 123 out of 309 places after structural reductions.
[2024-05-22 12:07:52] [INFO ] Flatten gal took : 55 ms
[2024-05-22 12:07:52] [INFO ] Flatten gal took : 35 ms
[2024-05-22 12:07:53] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 93 out of 309 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (102 resets) in 1597 ms. (25 steps per ms) remains 2/64 properties
BEST_FIRST walk for 40003 steps (15 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2024-05-22 12:07:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/188 variables, 45/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/561 variables, 184/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/643 variables, 70/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/653 variables, 10/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 312 constraints, problems are : Problem set: 1 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/188 variables, 45/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/561 variables, 184/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp50 is UNSAT
After SMT solving in domain Int declared 561/653 variables, and 233 constraints, problems are : Problem set: 2 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/309 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 442ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 12:07:54] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:07:54] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:07:54] [INFO ] Input system was already deterministic with 344 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 567 edges and 309 vertex of which 283 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 51 place count 258 transition count 303
Iterating global reduction 1 with 41 rules applied. Total rules applied 92 place count 258 transition count 303
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 105 place count 245 transition count 289
Iterating global reduction 1 with 13 rules applied. Total rules applied 118 place count 245 transition count 289
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 129 place count 234 transition count 277
Iterating global reduction 1 with 11 rules applied. Total rules applied 140 place count 234 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 151 place count 223 transition count 264
Iterating global reduction 1 with 11 rules applied. Total rules applied 162 place count 223 transition count 264
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 172 place count 213 transition count 247
Iterating global reduction 1 with 10 rules applied. Total rules applied 182 place count 213 transition count 247
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 191 place count 204 transition count 238
Iterating global reduction 1 with 9 rules applied. Total rules applied 200 place count 204 transition count 238
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 207 place count 197 transition count 231
Iterating global reduction 1 with 7 rules applied. Total rules applied 214 place count 197 transition count 231
Applied a total of 214 rules in 67 ms. Remains 197 /309 variables (removed 112) and now considering 231/344 (removed 113) transitions.
// Phase 1: matrix 231 rows 197 cols
[2024-05-22 12:07:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:07:54] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 12:07:54] [INFO ] Invariant cache hit.
[2024-05-22 12:07:54] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-22 12:07:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:07:58] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:07:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 19/217 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 1/428 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 218 constraints, problems are : Problem set: 0 solved, 230 unsolved in 11335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/217 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 229/446 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 1/428 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/428 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 448 constraints, problems are : Problem set: 0 solved, 230 unsolved in 14546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 19/19 constraints]
After SMT, in 25967ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 25979ms
Starting structural reductions in LTL mode, iteration 1 : 197/309 places, 231/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26429 ms. Remains : 197/309 places, 231/344 transitions.
[2024-05-22 12:08:20] [INFO ] Flatten gal took : 25 ms
[2024-05-22 12:08:20] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:08:20] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-22 12:08:20] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:08:20] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:08:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2770989428380617656.gal : 22 ms
[2024-05-22 12:08:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10768009168813087427.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2770989428380617656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10768009168813087427.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 12:08:50] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:08:50] [INFO ] Applying decomposition
[2024-05-22 12:08:50] [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/graph6721024266108436346.txt' '-o' '/tmp/graph6721024266108436346.bin' '-w' '/tmp/graph6721024266108436346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6721024266108436346.bin' '-l' '-1' '-v' '-w' '/tmp/graph6721024266108436346.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:08:51] [INFO ] Decomposing Gal with order
[2024-05-22 12:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:08:51] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-22 12:08:51] [INFO ] Flatten gal took : 64 ms
[2024-05-22 12:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 8 ms.
[2024-05-22 12:08:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13447110104203886636.gal : 5 ms
[2024-05-22 12:08:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12221613123744286917.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/CTLCardinality13447110104203886636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12221613123744286917.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 344
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 48 place count 261 transition count 307
Iterating global reduction 1 with 37 rules applied. Total rules applied 85 place count 261 transition count 307
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 250 transition count 296
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 250 transition count 296
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 242 transition count 287
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 242 transition count 287
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 236 transition count 281
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 236 transition count 281
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 141 place count 230 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 147 place count 230 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 152 place count 225 transition count 265
Iterating global reduction 1 with 5 rules applied. Total rules applied 157 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 162 place count 220 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 167 place count 220 transition count 260
Applied a total of 167 rules in 40 ms. Remains 220 /309 variables (removed 89) and now considering 260/344 (removed 84) transitions.
// Phase 1: matrix 260 rows 220 cols
[2024-05-22 12:09:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:09:21] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 12:09:21] [INFO ] Invariant cache hit.
[2024-05-22 12:09:21] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-22 12:09:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/480 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 3 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:09:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:09:27] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 248 constraints, problems are : Problem set: 0 solved, 259 unsolved in 12537 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/480 variables, 220/248 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 259/507 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 507 constraints, problems are : Problem set: 0 solved, 259 unsolved in 12040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 26/26 constraints]
After SMT, in 24667ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 24671ms
Starting structural reductions in LTL mode, iteration 1 : 220/309 places, 260/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25140 ms. Remains : 220/309 places, 260/344 transitions.
[2024-05-22 12:09:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:09:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:09:46] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-22 12:09:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:09:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:09:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7606129089393547944.gal : 3 ms
[2024-05-22 12:09:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1730825837149986423.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/CTLCardinality7606129089393547944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1730825837149986423.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 12:10:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:10:16] [INFO ] Applying decomposition
[2024-05-22 12:10:16] [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/graph17012051939525338619.txt' '-o' '/tmp/graph17012051939525338619.bin' '-w' '/tmp/graph17012051939525338619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17012051939525338619.bin' '-l' '-1' '-v' '-w' '/tmp/graph17012051939525338619.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:10:16] [INFO ] Decomposing Gal with order
[2024-05-22 12:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:10:16] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-22 12:10:16] [INFO ] Flatten gal took : 26 ms
[2024-05-22 12:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 12:10:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality18278340955820511903.gal : 4 ms
[2024-05-22 12:10:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5976755296902311270.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/CTLCardinality18278340955820511903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5976755296902311270.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 : 309/309 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 344
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 53 place count 256 transition count 302
Iterating global reduction 1 with 42 rules applied. Total rules applied 95 place count 256 transition count 302
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 108 place count 243 transition count 288
Iterating global reduction 1 with 13 rules applied. Total rules applied 121 place count 243 transition count 288
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 132 place count 232 transition count 276
Iterating global reduction 1 with 11 rules applied. Total rules applied 143 place count 232 transition count 276
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 154 place count 221 transition count 263
Iterating global reduction 1 with 11 rules applied. Total rules applied 165 place count 221 transition count 263
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 175 place count 211 transition count 246
Iterating global reduction 1 with 10 rules applied. Total rules applied 185 place count 211 transition count 246
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 194 place count 202 transition count 237
Iterating global reduction 1 with 9 rules applied. Total rules applied 203 place count 202 transition count 237
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 210 place count 195 transition count 230
Iterating global reduction 1 with 7 rules applied. Total rules applied 217 place count 195 transition count 230
Applied a total of 217 rules in 29 ms. Remains 195 /309 variables (removed 114) and now considering 230/344 (removed 114) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-22 12:10:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:10:46] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 12:10:46] [INFO ] Invariant cache hit.
[2024-05-22 12:10:47] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-22 12:10:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:10:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:10:51] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10848 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 20630ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20632ms
Starting structural reductions in LTL mode, iteration 1 : 195/309 places, 230/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20997 ms. Remains : 195/309 places, 230/344 transitions.
[2024-05-22 12:11:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:11:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:11:07] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 12:11:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:11:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:11:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality6971575653592586849.gal : 1 ms
[2024-05-22 12:11:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality12800690798959033903.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/CTLCardinality6971575653592586849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12800690798959033903.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 12:11:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:11:37] [INFO ] Applying decomposition
[2024-05-22 12:11:37] [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/graph12029034002049704123.txt' '-o' '/tmp/graph12029034002049704123.bin' '-w' '/tmp/graph12029034002049704123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12029034002049704123.bin' '-l' '-1' '-v' '-w' '/tmp/graph12029034002049704123.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:11:37] [INFO ] Decomposing Gal with order
[2024-05-22 12:11:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:11:37] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 12:11:37] [INFO ] Flatten gal took : 23 ms
[2024-05-22 12:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-22 12:11:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality18157402127440669014.gal : 3 ms
[2024-05-22 12:11:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9836333180276260184.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/CTLCardinality18157402127440669014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9836333180276260184.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 : 309/309 places, 344/344 transitions.
Graph (complete) has 567 edges and 309 vertex of which 286 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.6 ms
Discarding 23 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 285 transition count 273
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 228 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 227 transition count 272
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 117 place count 227 transition count 246
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 169 place count 201 transition count 246
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 182 place count 188 transition count 233
Iterating global reduction 3 with 13 rules applied. Total rules applied 195 place count 188 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 195 place count 188 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 187 transition count 232
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 207 place count 177 transition count 221
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 177 transition count 221
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 168 transition count 209
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 168 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 161 transition count 198
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 161 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 253 place count 157 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 257 place count 157 transition count 194
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 311 place count 130 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 313 place count 128 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 128 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 317 place count 126 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 126 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 125 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 125 transition count 160
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 125 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 123 transition count 158
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 13 rules applied. Total rules applied 338 place count 122 transition count 146
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 350 place count 110 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 350 place count 110 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 352 place count 109 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 108 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 108 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 357 place count 107 transition count 142
Applied a total of 357 rules in 91 ms. Remains 107 /309 variables (removed 202) and now considering 142/344 (removed 202) transitions.
// Phase 1: matrix 142 rows 107 cols
[2024-05-22 12:12:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:12:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 12:12:08] [INFO ] Invariant cache hit.
[2024-05-22 12:12:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 12:12:08] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-22 12:12:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 142/236 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 13/249 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 108 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2578 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 142/236 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 129/224 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 13/249 variables, 13/237 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 238 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 5339ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 5340ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/309 places, 142/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5653 ms. Remains : 107/309 places, 142/344 transitions.
[2024-05-22 12:12:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:12:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:12:13] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-22 12:12:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:12:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:12:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2333039083151405848.gal : 1 ms
[2024-05-22 12:12:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7976637347511229619.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2333039083151405848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7976637347511229619.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.81265e+12,2.57466,84220,2,21646,5,487529,6,0,547,360934,0


Converting to forward existential form...Done !
original formula: EF((AG((EF((p15==1)) * E((((p338==0)||(p56==1))&&(p327==1)) U (p301!=1)))) + (p80==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (p15==1)) * E((((p338==0)||(p56==1))&&(p327==1)) U (p301!=1)))))))] ...206
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t11, t16, t21, t26, t31, t36, t41, t46, t57, t61, t71, t77, t130, t131, t132, t133, t...302
Detected timeout of ITS tools.
[2024-05-22 12:12:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:12:43] [INFO ] Applying decomposition
[2024-05-22 12:12:43] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18187299228575802250.txt' '-o' '/tmp/graph18187299228575802250.bin' '-w' '/tmp/graph18187299228575802250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18187299228575802250.bin' '-l' '-1' '-v' '-w' '/tmp/graph18187299228575802250.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:12:43] [INFO ] Decomposing Gal with order
[2024-05-22 12:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:12:43] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-22 12:12:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 3 ms.
[2024-05-22 12:12:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10502682338180459658.gal : 2 ms
[2024-05-22 12:12:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5738530995076975942.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/CTLCardinality10502682338180459658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5738530995076975942.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.81265e+12,2.54433,91316,2408,160,144605,2426,277,585188,44,18524,0


Converting to forward existential form...Done !
original formula: EF((AG((EF((i0.u0.p15==1)) * E((((i13.u38.p338==0)||(i3.u6.p56==1))&&(i13.u36.p327==1)) U (i12.u33.p301!=1)))) + (i4.u8.p80==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (i0.u0.p15==1)) * E((((i13.u38.p338==0)||(i3.u6.p56==1))&&(i13.u36.p...248
Reverse transition relation is NOT exact ! Due to transitions t71, t132, t133, t134, t135, t137, t139, t140, i0.t141, i0.t138, i0.t136, i0.t131, i0.u0.t61,...412
(forward)formula 0,1,8.3035,249004,1,0,402072,5727,1351,1.60415e+06,197,72749,302265
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Graph (complete) has 567 edges and 309 vertex of which 283 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 282 transition count 269
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 223 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 222 transition count 268
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 121 place count 222 transition count 243
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 171 place count 197 transition count 243
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 183 transition count 229
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 183 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 199 place count 183 transition count 227
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 203 place count 181 transition count 227
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 213 place count 171 transition count 216
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 171 transition count 216
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 232 place count 162 transition count 204
Iterating global reduction 3 with 9 rules applied. Total rules applied 241 place count 162 transition count 204
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 249 place count 154 transition count 191
Iterating global reduction 3 with 8 rules applied. Total rules applied 257 place count 154 transition count 191
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 262 place count 149 transition count 186
Iterating global reduction 3 with 5 rules applied. Total rules applied 267 place count 149 transition count 186
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 321 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 120 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 120 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 327 place count 118 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 118 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 117 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 117 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 115 transition count 150
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 137 edges and 113 vertex of which 109 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 116 edges and 109 vertex of which 46 / 109 are part of one of the 23 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 3 with 39 rules applied. Total rules applied 372 place count 86 transition count 110
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 59 rules applied. Total rules applied 431 place count 51 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 432 place count 50 transition count 86
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 443 place count 39 transition count 64
Iterating global reduction 6 with 11 rules applied. Total rules applied 454 place count 39 transition count 64
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 465 place count 28 transition count 42
Iterating global reduction 6 with 11 rules applied. Total rules applied 476 place count 28 transition count 42
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 486 place count 18 transition count 22
Iterating global reduction 6 with 10 rules applied. Total rules applied 496 place count 18 transition count 22
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 505 place count 9 transition count 13
Iterating global reduction 6 with 9 rules applied. Total rules applied 514 place count 9 transition count 13
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 515 place count 9 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 517 place count 8 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 9
Applied a total of 519 rules in 71 ms. Remains 6 /309 variables (removed 303) and now considering 9/344 (removed 335) transitions.
[2024-05-22 12:12:52] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 12:12:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 12:12:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 12:12:52] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2024-05-22 12:12:52] [INFO ] Invariant cache hit.
[2024-05-22 12:12:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-22 12:12:52] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 12:12:52] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2024-05-22 12:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 39 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 31 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/309 places, 9/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 240 ms. Remains : 6/309 places, 9/344 transitions.
[2024-05-22 12:12:52] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:12:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:12:52] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-22 12:12:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:12:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:12:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6953415534128962922.gal : 0 ms
[2024-05-22 12:12:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14337693019062683497.ctl : 15 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/CTLCardinality6953415534128962922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14337693019062683497.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,664,0.002451,3344,2,22,5,248,6,0,32,206,0


Converting to forward existential form...Done !
original formula: EG(AF(E((p35==1) U EF((p335==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((p35==1) U E(TRUE U (p335==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t8, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
(forward)formula 0,1,0.006286,3664,1,0,32,663,50,20,196,770,40
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 303 transition count 344
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 39 place count 270 transition count 311
Iterating global reduction 1 with 33 rules applied. Total rules applied 72 place count 270 transition count 311
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 81 place count 261 transition count 301
Iterating global reduction 1 with 9 rules applied. Total rules applied 90 place count 261 transition count 301
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 254 transition count 294
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 254 transition count 294
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 111 place count 247 transition count 285
Iterating global reduction 1 with 7 rules applied. Total rules applied 118 place count 247 transition count 285
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 241 transition count 275
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 241 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 136 place count 235 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 142 place count 235 transition count 269
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 231 transition count 265
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 231 transition count 265
Applied a total of 150 rules in 29 ms. Remains 231 /309 variables (removed 78) and now considering 265/344 (removed 79) transitions.
// Phase 1: matrix 265 rows 231 cols
[2024-05-22 12:12:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:12:52] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-22 12:12:52] [INFO ] Invariant cache hit.
[2024-05-22 12:12:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-22 12:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/491 variables, 226/228 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:12:58] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:12:58] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 12:12:58] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:12:58] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 5/496 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 247 constraints, problems are : Problem set: 0 solved, 264 unsolved in 14008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/491 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 259/501 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 5/496 variables, 5/506 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 511 constraints, problems are : Problem set: 0 solved, 264 unsolved in 21249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 14/14 constraints]
After SMT, in 35346ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 35349ms
Starting structural reductions in LTL mode, iteration 1 : 231/309 places, 265/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35756 ms. Remains : 231/309 places, 265/344 transitions.
[2024-05-22 12:13:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:13:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:13:28] [INFO ] Input system was already deterministic with 265 transitions.
[2024-05-22 12:13:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:13:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:13:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17315801772910385916.gal : 2 ms
[2024-05-22 12:13:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5193759331402266117.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/CTLCardinality17315801772910385916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5193759331402266117.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 12:13:58] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:13:58] [INFO ] Applying decomposition
[2024-05-22 12:13:58] [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/graph18442579708006157386.txt' '-o' '/tmp/graph18442579708006157386.bin' '-w' '/tmp/graph18442579708006157386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18442579708006157386.bin' '-l' '-1' '-v' '-w' '/tmp/graph18442579708006157386.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:13:58] [INFO ] Decomposing Gal with order
[2024-05-22 12:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:13:58] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-22 12:13:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 12:13:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10910999311118613952.gal : 2 ms
[2024-05-22 12:13:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17886087604734316792.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/CTLCardinality10910999311118613952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17886087604734316792.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 49 place count 260 transition count 305
Iterating global reduction 1 with 39 rules applied. Total rules applied 88 place count 260 transition count 305
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 99 place count 249 transition count 293
Iterating global reduction 1 with 11 rules applied. Total rules applied 110 place count 249 transition count 293
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 239 transition count 282
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 239 transition count 282
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 140 place count 229 transition count 270
Iterating global reduction 1 with 10 rules applied. Total rules applied 150 place count 229 transition count 270
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 158 place count 221 transition count 257
Iterating global reduction 1 with 8 rules applied. Total rules applied 166 place count 221 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 173 place count 214 transition count 250
Iterating global reduction 1 with 7 rules applied. Total rules applied 180 place count 214 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 184 place count 210 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 210 transition count 246
Applied a total of 188 rules in 23 ms. Remains 210 /309 variables (removed 99) and now considering 246/344 (removed 98) transitions.
// Phase 1: matrix 246 rows 210 cols
[2024-05-22 12:14:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:14:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 12:14:28] [INFO ] Invariant cache hit.
[2024-05-22 12:14:28] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-22 12:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 246/455 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-22 12:14:32] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:14:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:14:32] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:14:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:14:32] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-22 12:14:34] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:14:34] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:14:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 235 constraints, problems are : Problem set: 0 solved, 245 unsolved in 14116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/455 variables, 209/234 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 244/478 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 480 constraints, problems are : Problem set: 0 solved, 245 unsolved in 20168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 23/23 constraints]
After SMT, in 34356ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 34359ms
Starting structural reductions in LTL mode, iteration 1 : 210/309 places, 246/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34622 ms. Remains : 210/309 places, 246/344 transitions.
[2024-05-22 12:15:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:15:03] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:15:03] [INFO ] Input system was already deterministic with 246 transitions.
[2024-05-22 12:15:03] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:15:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:15:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17434536854270500661.gal : 1 ms
[2024-05-22 12:15:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1012372968804449287.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/CTLCardinality17434536854270500661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1012372968804449287.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 12:15:33] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:15:33] [INFO ] Applying decomposition
[2024-05-22 12:15:33] [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/graph1222376095383886621.txt' '-o' '/tmp/graph1222376095383886621.bin' '-w' '/tmp/graph1222376095383886621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1222376095383886621.bin' '-l' '-1' '-v' '-w' '/tmp/graph1222376095383886621.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:15:33] [INFO ] Decomposing Gal with order
[2024-05-22 12:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:15:33] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-22 12:15:33] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-22 12:15:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6090202477490436809.gal : 4 ms
[2024-05-22 12:15:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9474064863995073741.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/CTLCardinality6090202477490436809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9474064863995073741.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 : 309/309 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 344
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 49 place count 260 transition count 306
Iterating global reduction 1 with 38 rules applied. Total rules applied 87 place count 260 transition count 306
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 97 place count 250 transition count 296
Iterating global reduction 1 with 10 rules applied. Total rules applied 107 place count 250 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 116 place count 241 transition count 286
Iterating global reduction 1 with 9 rules applied. Total rules applied 125 place count 241 transition count 286
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 134 place count 232 transition count 275
Iterating global reduction 1 with 9 rules applied. Total rules applied 143 place count 232 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 152 place count 223 transition count 260
Iterating global reduction 1 with 9 rules applied. Total rules applied 161 place count 223 transition count 260
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 168 place count 216 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 175 place count 216 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 180 place count 211 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 211 transition count 248
Applied a total of 185 rules in 18 ms. Remains 211 /309 variables (removed 98) and now considering 248/344 (removed 96) transitions.
// Phase 1: matrix 248 rows 211 cols
[2024-05-22 12:16:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:16:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 12:16:03] [INFO ] Invariant cache hit.
[2024-05-22 12:16:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 12:16:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/459 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:16:07] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-22 12:16:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-22 12:16:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 237 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11374 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/459 variables, 211/237 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 247/484 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 484 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 24/24 constraints]
After SMT, in 24189ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 24192ms
Starting structural reductions in LTL mode, iteration 1 : 211/309 places, 248/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24433 ms. Remains : 211/309 places, 248/344 transitions.
[2024-05-22 12:16:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:16:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:16:27] [INFO ] Input system was already deterministic with 248 transitions.
[2024-05-22 12:16:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:16:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:16:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5259229759022489720.gal : 1 ms
[2024-05-22 12:16:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2186378466903396463.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/CTLCardinality5259229759022489720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2186378466903396463.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 12:16:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:16:57] [INFO ] Applying decomposition
[2024-05-22 12:16:57] [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/graph2418027954469805370.txt' '-o' '/tmp/graph2418027954469805370.bin' '-w' '/tmp/graph2418027954469805370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2418027954469805370.bin' '-l' '-1' '-v' '-w' '/tmp/graph2418027954469805370.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:16:57] [INFO ] Decomposing Gal with order
[2024-05-22 12:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:16:57] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-22 12:16:57] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:16:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 12:16:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality1951448972306341451.gal : 3 ms
[2024-05-22 12:16:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality1036726403892812299.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/CTLCardinality1951448972306341451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1036726403892812299.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 : 309/309 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 344
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 52 place count 257 transition count 303
Iterating global reduction 1 with 41 rules applied. Total rules applied 93 place count 257 transition count 303
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 105 place count 245 transition count 290
Iterating global reduction 1 with 12 rules applied. Total rules applied 117 place count 245 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 128 place count 234 transition count 278
Iterating global reduction 1 with 11 rules applied. Total rules applied 139 place count 234 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 150 place count 223 transition count 265
Iterating global reduction 1 with 11 rules applied. Total rules applied 161 place count 223 transition count 265
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 213 transition count 248
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 213 transition count 248
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 189 place count 205 transition count 240
Iterating global reduction 1 with 8 rules applied. Total rules applied 197 place count 205 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 203 place count 199 transition count 234
Iterating global reduction 1 with 6 rules applied. Total rules applied 209 place count 199 transition count 234
Applied a total of 209 rules in 23 ms. Remains 199 /309 variables (removed 110) and now considering 234/344 (removed 110) transitions.
// Phase 1: matrix 234 rows 199 cols
[2024-05-22 12:17:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:17:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 12:17:28] [INFO ] Invariant cache hit.
[2024-05-22 12:17:28] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-22 12:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/433 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 12:17:31] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:17:31] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:17:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:17:31] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 12:17:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 12:17:33] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 12:17:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:17:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 12:17:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 12:17:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 227 constraints, problems are : Problem set: 0 solved, 233 unsolved in 10180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/433 variables, 199/227 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 233/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 10461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 26/26 constraints]
After SMT, in 20716ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 20720ms
Starting structural reductions in LTL mode, iteration 1 : 199/309 places, 234/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20935 ms. Remains : 199/309 places, 234/344 transitions.
[2024-05-22 12:17:48] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:17:48] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-22 12:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:17:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:17:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7714028783156851929.gal : 2 ms
[2024-05-22 12:17:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17814565804586433905.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/CTLCardinality7714028783156851929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17814565804586433905.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 12:18:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:18:19] [INFO ] Applying decomposition
[2024-05-22 12:18:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12319357674735149585.txt' '-o' '/tmp/graph12319357674735149585.bin' '-w' '/tmp/graph12319357674735149585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12319357674735149585.bin' '-l' '-1' '-v' '-w' '/tmp/graph12319357674735149585.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:18:19] [INFO ] Decomposing Gal with order
[2024-05-22 12:18:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:18:19] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 12:18:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 12:18:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2289540881407968863.gal : 1 ms
[2024-05-22 12:18:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5078678853086263319.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/CTLCardinality2289540881407968863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5078678853086263319.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 : 309/309 places, 344/344 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 301 transition count 344
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 39 place count 270 transition count 313
Iterating global reduction 1 with 31 rules applied. Total rules applied 70 place count 270 transition count 313
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 262 transition count 304
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 262 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 255 transition count 297
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 255 transition count 297
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 250 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 250 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 246 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 246 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 242 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 242 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 238 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 238 transition count 276
Applied a total of 134 rules in 14 ms. Remains 238 /309 variables (removed 71) and now considering 276/344 (removed 68) transitions.
// Phase 1: matrix 276 rows 238 cols
[2024-05-22 12:18:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:18:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 12:18:49] [INFO ] Invariant cache hit.
[2024-05-22 12:18:49] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-22 12:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 276/511 variables, 235/237 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:18:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-22 12:18:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 3/514 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (OVERLAPS) 0/514 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 265 constraints, problems are : Problem set: 0 solved, 275 unsolved in 17270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/262 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 272/534 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 3/514 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 3/540 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 0/514 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 540 constraints, problems are : Problem set: 0 solved, 275 unsolved in 26398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 25/25 constraints]
After SMT, in 43756ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 43760ms
Starting structural reductions in LTL mode, iteration 1 : 238/309 places, 276/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43986 ms. Remains : 238/309 places, 276/344 transitions.
[2024-05-22 12:19:33] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:19:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:19:33] [INFO ] Input system was already deterministic with 276 transitions.
[2024-05-22 12:19:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:19:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:19:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4673707833059287861.gal : 1 ms
[2024-05-22 12:19:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15335511582547895762.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/CTLCardinality4673707833059287861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15335511582547895762.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 12:20:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:20:03] [INFO ] Applying decomposition
[2024-05-22 12:20:03] [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/graph8522553979179847847.txt' '-o' '/tmp/graph8522553979179847847.bin' '-w' '/tmp/graph8522553979179847847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8522553979179847847.bin' '-l' '-1' '-v' '-w' '/tmp/graph8522553979179847847.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:20:03] [INFO ] Decomposing Gal with order
[2024-05-22 12:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:20:03] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-22 12:20:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 12:20:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12982607747505031525.gal : 10 ms
[2024-05-22 12:20:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7896108425125380490.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/CTLCardinality12982607747505031525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7896108425125380490.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 : 309/309 places, 344/344 transitions.
Graph (complete) has 567 edges and 309 vertex of which 283 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 282 transition count 271
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 225 transition count 269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 223 transition count 269
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 119 place count 223 transition count 243
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 171 place count 197 transition count 243
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 183 transition count 229
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 183 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 199 place count 183 transition count 227
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 203 place count 181 transition count 227
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 213 place count 171 transition count 216
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 171 transition count 216
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 232 place count 162 transition count 204
Iterating global reduction 3 with 9 rules applied. Total rules applied 241 place count 162 transition count 204
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 248 place count 155 transition count 193
Iterating global reduction 3 with 7 rules applied. Total rules applied 255 place count 155 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 259 place count 151 transition count 189
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 151 transition count 189
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 317 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 122 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 120 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 120 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 119 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 119 transition count 155
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 328 place count 119 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 117 transition count 153
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 140 edges and 115 vertex of which 111 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 120 edges and 111 vertex of which 46 / 111 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 3 with 40 rules applied. Total rules applied 370 place count 88 transition count 112
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 429 place count 52 transition count 89
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 438 place count 43 transition count 71
Iterating global reduction 5 with 9 rules applied. Total rules applied 447 place count 43 transition count 71
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 456 place count 34 transition count 53
Iterating global reduction 5 with 9 rules applied. Total rules applied 465 place count 34 transition count 53
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 474 place count 25 transition count 35
Iterating global reduction 5 with 9 rules applied. Total rules applied 483 place count 25 transition count 35
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 492 place count 16 transition count 26
Iterating global reduction 5 with 9 rules applied. Total rules applied 501 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 502 place count 16 transition count 25
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 5 with 1 rules applied. Total rules applied 503 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 504 place count 15 transition count 24
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 507 place count 12 transition count 21
Applied a total of 507 rules in 52 ms. Remains 12 /309 variables (removed 297) and now considering 21/344 (removed 323) transitions.
[2024-05-22 12:20:33] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2024-05-22 12:20:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 12:20:33] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 12:20:33] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2024-05-22 12:20:33] [INFO ] Invariant cache hit.
[2024-05-22 12:20:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-22 12:20:33] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 12:20:33] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2024-05-22 12:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 12 constraints, problems are : Problem set: 0 solved, 15 unsolved in 73 ms.
Refiners :[State Equation: 12/12 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 71 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/309 places, 21/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 256 ms. Remains : 12/309 places, 21/344 transitions.
[2024-05-22 12:20:33] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:20:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:20:33] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-22 12:20:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:20:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:20:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8472033181618553847.gal : 0 ms
[2024-05-22 12:20:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3088260114765747354.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/CTLCardinality8472033181618553847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3088260114765747354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((AG((p186==1)) + EF((p150==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p186==1)))) + E(TRUE U (p150==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t10, t12, t20, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,1,0.007952,3724,1,0,43,893,66,25,331,977,57
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 344
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 53 place count 256 transition count 302
Iterating global reduction 1 with 42 rules applied. Total rules applied 95 place count 256 transition count 302
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 108 place count 243 transition count 288
Iterating global reduction 1 with 13 rules applied. Total rules applied 121 place count 243 transition count 288
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 132 place count 232 transition count 276
Iterating global reduction 1 with 11 rules applied. Total rules applied 143 place count 232 transition count 276
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 154 place count 221 transition count 263
Iterating global reduction 1 with 11 rules applied. Total rules applied 165 place count 221 transition count 263
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 175 place count 211 transition count 246
Iterating global reduction 1 with 10 rules applied. Total rules applied 185 place count 211 transition count 246
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 194 place count 202 transition count 237
Iterating global reduction 1 with 9 rules applied. Total rules applied 203 place count 202 transition count 237
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 210 place count 195 transition count 230
Iterating global reduction 1 with 7 rules applied. Total rules applied 217 place count 195 transition count 230
Applied a total of 217 rules in 17 ms. Remains 195 /309 variables (removed 114) and now considering 230/344 (removed 114) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-22 12:20:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:20:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 12:20:33] [INFO ] Invariant cache hit.
[2024-05-22 12:20:33] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-22 12:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:20:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 20782ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20786ms
Starting structural reductions in LTL mode, iteration 1 : 195/309 places, 230/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21006 ms. Remains : 195/309 places, 230/344 transitions.
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:20:54] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:20:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14183911245678909341.gal : 1 ms
[2024-05-22 12:20:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality7092214301913200729.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/CTLCardinality14183911245678909341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7092214301913200729.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 12:21:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:21:24] [INFO ] Applying decomposition
[2024-05-22 12:21:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2773578671398200415.txt' '-o' '/tmp/graph2773578671398200415.bin' '-w' '/tmp/graph2773578671398200415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2773578671398200415.bin' '-l' '-1' '-v' '-w' '/tmp/graph2773578671398200415.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:21:24] [INFO ] Decomposing Gal with order
[2024-05-22 12:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:21:24] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 12:21:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 12:21:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7645533520562523748.gal : 1 ms
[2024-05-22 12:21:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3246170061572675770.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/CTLCardinality7645533520562523748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3246170061572675770.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 : 309/309 places, 344/344 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 301 transition count 344
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 44 place count 265 transition count 308
Iterating global reduction 1 with 36 rules applied. Total rules applied 80 place count 265 transition count 308
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 93 place count 252 transition count 294
Iterating global reduction 1 with 13 rules applied. Total rules applied 106 place count 252 transition count 294
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 117 place count 241 transition count 282
Iterating global reduction 1 with 11 rules applied. Total rules applied 128 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 137 place count 232 transition count 271
Iterating global reduction 1 with 9 rules applied. Total rules applied 146 place count 232 transition count 271
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 153 place count 225 transition count 260
Iterating global reduction 1 with 7 rules applied. Total rules applied 160 place count 225 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 166 place count 219 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 172 place count 219 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 176 place count 215 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 180 place count 215 transition count 250
Applied a total of 180 rules in 16 ms. Remains 215 /309 variables (removed 94) and now considering 250/344 (removed 94) transitions.
// Phase 1: matrix 250 rows 215 cols
[2024-05-22 12:21:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:21:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 12:21:55] [INFO ] Invariant cache hit.
[2024-05-22 12:21:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-22 12:21:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:22:00] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 3/465 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/465 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 237 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/234 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 246/480 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 3/465 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 0/465 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 486 constraints, problems are : Problem set: 0 solved, 249 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 20/20 constraints]
After SMT, in 31663ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 31666ms
Starting structural reductions in LTL mode, iteration 1 : 215/309 places, 250/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31913 ms. Remains : 215/309 places, 250/344 transitions.
[2024-05-22 12:22:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:22:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:22:26] [INFO ] Input system was already deterministic with 250 transitions.
[2024-05-22 12:22:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:22:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:22:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality14120091907162494933.gal : 1 ms
[2024-05-22 12:22:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality4250137154942866716.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/CTLCardinality14120091907162494933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4250137154942866716.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 12:22:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:22:56] [INFO ] Applying decomposition
[2024-05-22 12:22:56] [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/graph5827190950355025493.txt' '-o' '/tmp/graph5827190950355025493.bin' '-w' '/tmp/graph5827190950355025493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5827190950355025493.bin' '-l' '-1' '-v' '-w' '/tmp/graph5827190950355025493.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:22:56] [INFO ] Decomposing Gal with order
[2024-05-22 12:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:22:56] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-22 12:22:56] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-22 12:22:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7601672840367825845.gal : 2 ms
[2024-05-22 12:22:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9271911240129802343.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/CTLCardinality7601672840367825845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9271911240129802343.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 344/344 transitions.
Graph (complete) has 567 edges and 309 vertex of which 283 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 282 transition count 268
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 222 transition count 268
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 121 place count 222 transition count 242
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 173 place count 196 transition count 242
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 187 place count 182 transition count 228
Iterating global reduction 2 with 14 rules applied. Total rules applied 201 place count 182 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 201 place count 182 transition count 226
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 205 place count 180 transition count 226
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 215 place count 170 transition count 215
Iterating global reduction 2 with 10 rules applied. Total rules applied 225 place count 170 transition count 215
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 234 place count 161 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 243 place count 161 transition count 203
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 153 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 153 transition count 190
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 148 transition count 185
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 148 transition count 185
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 321 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 323 place count 120 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 120 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 118 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 118 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 330 place count 117 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 117 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 333 place count 115 transition count 150
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 137 edges and 113 vertex of which 109 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 119 edges and 109 vertex of which 48 / 109 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 40 rules applied. Total rules applied 373 place count 85 transition count 109
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 433 place count 49 transition count 85
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 444 place count 38 transition count 63
Iterating global reduction 4 with 11 rules applied. Total rules applied 455 place count 38 transition count 63
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 466 place count 27 transition count 41
Iterating global reduction 4 with 11 rules applied. Total rules applied 477 place count 27 transition count 41
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 488 place count 16 transition count 19
Iterating global reduction 4 with 11 rules applied. Total rules applied 499 place count 16 transition count 19
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 509 place count 6 transition count 9
Iterating global reduction 4 with 10 rules applied. Total rules applied 519 place count 6 transition count 9
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 520 place count 6 transition count 8
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 521 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 523 place count 4 transition count 6
Applied a total of 523 rules in 26 ms. Remains 4 /309 variables (removed 305) and now considering 6/344 (removed 338) transitions.
[2024-05-22 12:23:27] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 12:23:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 12:23:27] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 12:23:27] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 12:23:27] [INFO ] Invariant cache hit.
[2024-05-22 12:23:27] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2024-05-22 12:23:27] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 12:23:27] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 12:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/309 places, 6/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 159 ms. Remains : 4/309 places, 6/344 transitions.
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:23:27] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:23:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10637767478329064933.gal : 0 ms
[2024-05-22 12:23:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality186703104559035854.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/CTLCardinality10637767478329064933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality186703104559035854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((p199==1))
=> equivalent forward existential formula: [FwdG(Init,!((p199==1)))] = FALSE
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 0,0,0.003427,3640,1,0,9,244,20,3,120,279,8
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 12:23:27] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:23:27] [INFO ] Applying decomposition
[2024-05-22 12:23:27] [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/graph3789072625811538915.txt' '-o' '/tmp/graph3789072625811538915.bin' '-w' '/tmp/graph3789072625811538915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3789072625811538915.bin' '-l' '-1' '-v' '-w' '/tmp/graph3789072625811538915.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:23:27] [INFO ] Decomposing Gal with order
[2024-05-22 12:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:23:27] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 12:23:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 12:23:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5751329935158764834.gal : 3 ms
[2024-05-22 12:23:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16927958473833171593.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/CTLCardinality5751329935158764834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16927958473833171593.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26605e+18,277.789,3542360,100133,137,5.10835e+06,19935,673,1.94401e+07,61,215930,0


Converting to forward existential form...Done !
original formula: EG(AF(EX(((i19.i1.u72.p218==0)&&(i5.u13.p35==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(((i19.i1.u72.p218==0)&&(i5.u13.p35==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t312, t314, t316, i0.u76.t80, i3.i0.u7.t216, i3.i0.u7.t218, i3.i1.u10.t220, i4.t209, i4.t156,...1022
ITS-tools command line returned an error code 137
[2024-05-22 12:44:44] [INFO ] Applying decomposition
[2024-05-22 12:44:44] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:44:44] [INFO ] Decomposing Gal with order
[2024-05-22 12:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:44:44] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-22 12:44:44] [INFO ] Flatten gal took : 21 ms
[2024-05-22 12:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 762 labels/synchronizations in 15 ms.
[2024-05-22 12:44:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2924601058641526708.gal : 3 ms
[2024-05-22 12:44:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1154910081698402708.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/CTLCardinality2924601058641526708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1154910081698402708.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26605e+18,395.534,7003620,2595,3566,1.07137e+07,1.82911e+06,492,3.54171e+07,271,1.35666e+07,0


Converting to forward existential form...Done !
original formula: EG(AF(EX(((i0.i0.i0.i0.i0.u19.p218==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p35==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(((i0.i0.i0.i0.i0.u19.p218==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p35==1)))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t247, t312, t314, i0.t25, i0.u23.t27, i0.u23.t29, i0.i0.u22.t40, i0.i0.u22.t42, i0.i0.u22.t44...1828

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12b"
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-12b, 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-171631132700465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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